A duality principle for lattices and categories of modules

Let R be a ring with 1, R^op the opposite ring, and R-Mod the category of left unitary R-modules and R-linear maps. A characterization of well-powered abelian categories $\text{A}$ such that there exists an exact embedding functor $\text{A}$→R-Mod is given. Using this characterization and abelian category duality, the following duality principles can be established.Theorem. There exists an exact embedding functor $\text{A}$→R-Mod if and only if there exists an exact embedding functor $\text{A}$^op→R^op-Mod.Corollary. If R-Mod has a specified diagram-chasing property, then R^op-Mod has the dual property.A lattice L is representable by R-modules if it is embeddable in the lattice of submodules of some unitary left R-module; $\text{L}$(R) denotes the quasivariety of all lattices representable by R-modules.Theorem. A lattice L is representable by R-modules if and only if its order dual L¹ is representable by R^op-modules. That is, $\text{L}\text{(}\text{R}{}^{\mathrm{op}}\text{)={L}{}^1\text{:L?}\text{L}\text{(}\text{R}\text{)}}$.If $\text{R}$ is a commutative ring with 1 and a specified diagram-chasing result is satisfied in R-Mod, then the dual result is also satisfied in R-Mod. Furthermore, $\text{L}\text{(}\text{R}\text{)}$ is self-dual: $\text{L}\text{(}\text{R}\text{)= {L}{}^1\text{:L?}\text{L}\text{(}\text{R}\text{)}.}$     

A linear time implementation of the reverse Cuthill-McKee algorithm

The Reverse Cuthill-McKee (RCM) algorithm is a method for reordering a sparse matrix so that it has a small envelope. Given a starting node, we provide an implementation of the algorithm whose run-time complexity is proved to be linear in the number of nonzeros in the matrix. Numerical experiments are provided which compare the performance of the new implementation to a good conventional implementation.     

Primes,irreducibles and extremal lattices

This paper studies certain types of join and meet-irreducibles called coprimes and primes. These elements can be used to characterize certain types of lattices. For example, a lattice is distributive if and only if every join-irreducible is coprime. Similarly, a lattice is meet-pseudocomplemented if and only if each atom is coprime. Furthermore, these elements naturally decompose lattices into sublattices so that often properties of the original lattice can be deduced from properties of the sublattice. Not every lattice has primes and coprimes. This paper shows that lattices which are long enough must have primes and coprimes and that these elements and the resulting decompositions can be used to study such lattices.The length of every finite lattice is bounded above by the minimum of the number of meet-irreducibles (meet-rank) and the number of join-irreducibles (join-rank) that it has. This paper studies lattices for which length=join-rank or length=meet-rank. These are called p-extremal lattices and they have interesting decompositions and properties. For example, ranked, p-extremal lattices are either lower locally distributive (join-rank=length), upper locally distributive (meet-rank=length) or distributive (join-rank=meet-rank=length). In the absence of the Jordan-Dedekind chain condition, p-extremal lattices still have many interesting properties. Of special interest are the lattices that satisfy both equalities. Such lattices are called extremal; this class includes distributive lattices and the associativity lattices of Tamari. Even though they have interesting decompositions, extremal lattices cannot be characterized algebraically since any finite lattice can be embedded as a subinterval into an extremal lattice. This paper shows how prime and coprime elements, and the poset of irreducibles can be used to analyze p-extremal and other types of lattices.The results presented in this paper are used to deduce many key properties of the Tamari lattices. These lattices behave much like distributive lattices even though they violate the Jordan-Dedekind chain condition very strongly having maximal chains that vary in length from N-1 to N(N-1)/2 where N is a parameter used in the construction of these lattices.     

Solving multiobjective,multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

In this paper, we solve instances of the multiobjective multiconstraint (or multidimensional) knapsack problem (MOMCKP) from the literature, with three objective functions and three constraints. We use exact as well as approximate algorithms. The exact algorithm is a properly modified version of the multicriteria branch and bound (MCBB) algorithm, which is further customized by suitable heuristics. Three branching heuristics and a more general purpose composite branching and construction heuristic are devised. Comparison is made to the published results from another exact algorithm, the adaptive ε-constraint method [Laumanns, M., Thiele, L., Zitzler, E., 2006. An efficient, adaptive parameter variation scheme for Metaheuristics based on the epsilon-constraint method. European Journal of Operational Research 169, 932–942], using the same data sets. Furthermore, the same problems are solved using standard multiobjective evolutionary algorithms (MOEA), namely, the SPEA2 and the NSGAII. The results from the exact case show that the branching heuristics greatly improve the performance of the MCBB algorithm, which becomes faster than the adaptive ε -constraint. Regarding the performance of the MOEA algorithms in the specific problems, SPEA2 outperforms NSGAII in the degree of approximation of the Pareto front, as measured by the coverage metric (especially for the largest instance).     

The Standard Cosmological Model: Achievements and Issues

The present day standard cosmological model is a great theoretical achievement. This chapter surveys the main themes that have arisen and issues that are still oustanding.     

Dual hologram interferometry

This report describes dual hologram interferometry, a new electro-optic technique used to calculate two-dimensional density distributions from measurable changes in index of refraction. Using this technique, two scenes recorded at different times are stored in separate holograms. One hologram contains reference data depicting the subject in an undisturbed state and the other hologram describes the same subject in a test or disturbed condition. Desired interference patterns are obtained by super-imposing the two separate scenes which are simultaneously reconstructed from each hologram. Specific interferograms, infinite fringe and various finite fringe patterns, are obtained by carefully regulating the optical attitude between the holograms and the reference beam during reconstruction of the scenes. In this project, dual hologram interferometry is used to describe quantitatively free convection from a uniformly heated right circular cylinder. Temperature distributions through the boundary layer and local heat transfer coefficients are determined at different azimuth positions. The results are compared both to experimental data obtained from another holographic technique and to a theoretical prediction of this specific test. This investigation shows that dual hologram interferometry accurately records changes in index of refraction which means the technique can be used to accurately measure experimental fluid flow data.     

The angular dependence of flux,mean energy and speed ratio for D2 molecules desorbing from a Ni(111) surface

Experimental data are presented for the angular dependence of the relative flux, the mean energy and the speed ratio of deuterium molecules desorbing from a Ni(111) crystal surface at a surface temperature of T_s = 1143 K and at sulphur coverages ranging between 30% and less than 2% of a monolayer.The angular flux distribution is sharply peaked in the forward direction (cos^dθwith 3 ? d ? 5) and the mean energy 〈E〉 of the desorbate depends strongly on the desorption angle θ. For normal desorption $\text{(θ = 0°)}\text{〈E〉}\text{2k}$ is about 700 K higher than T_s and for glancing angles (θ = 80°) it decreases to about 400 K below T_s The results obtained on sulphur free and sulphur covered Ni(111) surfaces are compared with our former data on polycrystalline nickel. The main differences in the kinetic features can be ascribed to the surface roughness. Accordingly, the angular distributions of flux, mean energy, and speed ratio, which deviate strongly from the Knudson and Maxwellian law, do not seem to depend considerably on sulphur coverage and surface structure. A qualitative explanation for these deviations is presented using the principle of detailed balancing.     

Elastic behaviour near polymorphic transitions: Silver iodide

Longitudinal and transverse wave velocities have been determined as functions of pressure in polycrystalline silver iodide using the pulse transmission method. The velocities decrease with increasing pressure in the low pressure phase and increase with increasing pressure in the NaCl structure phase which is stable above 4 kbar at room temperature. The calculated value of the pressure derivative of the incompressibility of the low pressure phase is exceptionally low, sufficiently so to be inconsistent with some lattice dynamics formulations. The unusual properties of the low pressure phase may be due to the effect of Frenkel defects on elastic wave propagation.