12,307 research outputs found
Lattice congruences of the weak order
We study the congruence lattice of the poset of regions of a hyperplane
arrangement, with particular emphasis on the weak order on a finite Coxeter
group. Our starting point is a theorem from a previous paper which gives a
geometric description of the poset of join-irreducibles of the congruence
lattice of the poset of regions in terms of certain polyhedral decompositions
of the hyperplanes. For a finite Coxeter system (W,S) and a subset K of S, let
\eta_K:w \mapsto w_K be the projection onto the parabolic subgroup W_K. We show
that the fibers of \eta_K constitute the smallest lattice congruence with
1\equiv s for every s\in(S-K). We give an algorithm for determining the
congruence lattice of the weak order for any finite Coxeter group and for a
finite Coxeter group of type A or B we define a directed graph on subsets or
signed subsets such that the transitive closure of the directed graph is the
poset of join-irreducibles of the congruence lattice of the weak order.Comment: 26 pages, 4 figure
The geometry of symplectic pairs
We study the geometry of manifolds carrying symplectic pairs consisting of
two closed 2-forms of constant ranks, whose kernel foliations are
complementary. Using a variation of the construction of Boothby and Wang we
build contact-symplectic and contact pairs from symplectic pairs.Comment: to appear in Transactions of the American Mathematical Societ
A generalization of Voronoi's reduction theory and its application
We consider Voronoi's reduction theory of positive definite quadratic forms
which is based on Delone subdivision. We extend it to forms and Delone
subdivisions having a prescribed symmetry group. Even more general, the theory
is developed for forms which are restricted to a linear subspace in the space
of quadratic forms. We apply the new theory to complete the classification of
totally real thin algebraic number fields which was recently initiated by
Bayer-Fluckiger and Nebe. Moreover, we apply it to construct new best known
sphere coverings in dimensions 9,..., 15.Comment: 31 pages, 2 figures, 2 tables, (v4) minor changes, to appear in Duke
Math.
Computational Approaches to Lattice Packing and Covering Problems
We describe algorithms which address two classical problems in lattice
geometry: the lattice covering and the simultaneous lattice packing-covering
problem. Theoretically our algorithms solve the two problems in any fixed
dimension d in the sense that they approximate optimal covering lattices and
optimal packing-covering lattices within any desired accuracy. Both algorithms
involve semidefinite programming and are based on Voronoi's reduction theory
for positive definite quadratic forms, which describes all possible Delone
triangulations of Z^d.
In practice, our implementations reproduce known results in dimensions d <= 5
and in particular solve the two problems in these dimensions. For d = 6 our
computations produce new best known covering as well as packing-covering
lattices, which are closely related to the lattice (E6)*. For d = 7, 8 our
approach leads to new best known covering lattices. Although we use numerical
methods, we made some effort to transform numerical evidences into rigorous
proofs. We provide rigorous error bounds and prove that some of the new
lattices are locally optimal.Comment: (v3) 40 pages, 5 figures, 6 tables, some corrections, accepted in
Discrete and Computational Geometry, see also
http://fma2.math.uni-magdeburg.de/~latgeo
- …