相关论文: Face numbers of Engstr\"om representations of matr…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…
We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
For any rank $r$ oriented matroid $M$, a construction is given of a "topological representation" of $M$ by an arrangement of homotopy spheres in a simplicial complex which is homotopy equivalent to $S^{r-1}$. The construction is completely…
We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…
For a natural number $c$, a $c$-arrangement is an arrangement of dimension $c$ subspaces satisfying the following condition: the sum of any subset of the subspaces has dimension a multiple of $c$. Matroids arising as normalized rank…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
This article presents a study of an algebra spanned by the faces of a hyperplane arrangement. The quiver with relations of the algebra is computed and the algebra is shown to be a Koszul algebra. It is shown that the algebra depends only on…
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…
We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent…
In recent years it has been noted that a number of combinatorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular…
We study linear relations between face numbers of levels in arrangements. Let $V = \{ v_1, \ldots, v_n \} \subset \mathbf{R}^{r}$ be a vector configuration in general position, and let $\mathcal{A}(V)$ be polar dual arrangement of…
We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…