Combinatorial Geometry in Characteristic 1
نویسندگان
چکیده
Many geometries over fields have formal analogues which can be thought of as geometries over the field of 1 element1. For example, the projective plane over the field Fq has q2 + q+ 1 points and the same number of lines; every line in the plane has q + 1 points. When q = 1, we have a plane with three points and three lines, i.e. a triangle. The flag complex of the triangle is a thin building of type A2 = Sym3. In general, the Coxeter complex W of the Coxeter group W is a thin building of type W and behaves like the building of type W over the field of 1 element. In this work we define the combinatorial flag varieties Ωn, n = 2, 3, . . . , which behave in many aspects as buildings of type An−1 over the field of 1 element but have the much more rich structure than Coxeter complexes. Their most surprising property is that every matroid on n elements is representable in Ωn. We start with three equivalent definitions of Ωn.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملA Note on Shelling
The radial distribution function is a characteristic geometric quantity of a point set in Euclidean space that reflects itself in the corresponding diffraction spectrum and related objects of physical interest. The underlying combinatorial and algebraic structure is well understood for crystals, but less so for non-periodic arrangements such as mathematical quasicrystals or model sets. In this ...
متن کاملDegree-regular triangulations of torus and Klein bottle
A combinatorial 2-manifold is called weakly regular if the action of its automorphism group on its vertices is transitive. A combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular combinatorial 2-manifold is degree-regular. In [5], Lutz has classified all the weakly-regular combinatorial 2-manifolds on at most 15 vertices, among...
متن کاملIntrinsic Volumes of Polyhedral Cones: A Combinatorial Perspective
These notes provide a self-contained account of the combinatorial theory of intrinsic volumes for polyhedral cones. Streamlined derivations of the General Steiner formula, the conic analogues of the Brianchon-Gram-Euler and the Gauss-Bonnet relations, and the Principal Kinematic Formula are given. In addition, a connection between the characteristic polynomial of a hyperplane arrangement and th...
متن کاملHodge Theory for Combinatorial Geometries
The matroid is called loopless if the empty subset of E is closed, and is called a combinatorial geometry if in addition all single element subsets of E are closed. A closed subset of E is called a flat of M, and every subset of E has a well-defined rank and corank in the poset of all flats of M. The notion of matroid played a fundamental role in graph theory, coding theory, combinatorial optim...
متن کامل