Related papers: The cyclic flats of $\mathcal{L}$-polymatroids
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…
We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…
This paper presents a systematic study of the structure of non-solvable cyclic metric Lie algebras. A cyclic metric is a symmetric bilinear form satisfying a cyclic cocycle condition, which arises naturally in the contexts of…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
Let f: X -> Y be a separated morphism of schemes of finite type over a finite field of characteristic p, let Lambda be an artinian local Z_p-algebra with finite residue field, let m be the maximal ideal of Lambda, and let L^\bullet be a…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
Let $M$ be a matroid satisfying a matroidal analogue of the Cayley-Bacharach condition. Given a number $k \ge 2$, we show that there is no nontrivial bound on ranks of a $k$-tuple of flats covering the underlying set of $M$. This addresses…
A $\mathbb{D}$-semi-classical weight is one which satisfies a particular linear, first order homogeneous equation in a divided-difference operator $\mathbb{D}$. It is known that the system of polynomials, orthogonal with respect to this…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…
In this paper we prove several results about the lattice of imprimitivity systems of a permutation group containing a cyclic subgroup with at most two orbits. As an application we generalize the first Ritt theorem about functional…
Let A be a subspace arrangement with a geometric lattice such that codim(x) > 1 for every x in A. Using rational homotopy theory, we prove that the complement M(A) is rationally elliptic if and only if the sum of the orthogonal subspaces is…
We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic…
A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and…
N-site-lattice Hamiltonians H are introduced and perceived as a set of systematic discrete approximants of a certain PT-symmetric square-well-potential model with the real spectrum and with a non-Hermiticity which is localized near the…
Stanley introduced a lattice polytope $\mathcal{C}_P$ arising from a finite poset $P$, which is called the chain polytope of $P$. The geometric structure of $\mathcal{C}_P$ has good relations with the combinatorial structure of $P$. In…
We investigate the spectral properties of a quasi-one-dimensional lattice in two possible dimerisation configurations. Both configurations are characterized by the same lattice topology and the identical spectra containing a flat band at…
This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…
Several topologies can be defined on the prime, the maximal and the minimal prime spectra of a commutative ring; among them, we mention the Zariski topology, the patch topology and the flat topology. By using these topologies, Tarizadeh and…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…