English
Related papers

Related papers: The cyclic flats of $\mathcal{L}$-polymatroids

200 papers

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…

Combinatorics · Mathematics 2025-07-02 Luis Ferroni , Benjamin Schröter

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…

Commutative Algebra · Mathematics 2008-11-26 Adam Hughes , JohnMark Lau , Eric Peterson

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…

Differential Geometry · Mathematics 2025-09-19 An Huihui , Tan Ju , Yan Zaili

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…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

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…

Number Theory · Mathematics 2007-05-23 Matthew Emerton , Mark Kisin

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…

Combinatorics · Mathematics 2026-05-13 Matias von Bell , Cesar Ceballos

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…

Combinatorics · Mathematics 2022-11-15 Soohyun Park

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…

Classical Analysis and ODEs · Mathematics 2012-04-12 N. S. Witte

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…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

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…

Rings and Algebras · Mathematics 2010-03-15 Miguel Couceiro , Jean-Luc Marichal

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…

Complex Variables · Mathematics 2014-02-26 M. Muzychuk , F. Pakovich

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…

Algebraic Topology · Mathematics 2007-05-23 G. Debongnie

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…

Metric Geometry · Mathematics 2015-01-16 Ciprian S. Borcea , Ileana Streinu

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…

Combinatorics · Mathematics 2023-01-12 Dillon Mayhew , Andrew Probert

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…

Quantum Physics · Physics 2013-05-15 Miloslav Znojil , Junde Wu

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…

Combinatorics · Mathematics 2020-09-07 Hidefumi Ohsugi , Akiyoshi Tsuchiya

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…

Mesoscale and Nanoscale Physics · Physics 2017-09-19 D. Bercioux , O. Dutta , E. Rico

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…

Combinatorics · Mathematics 2025-04-09 Dale R. Worley

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…

Logic · Mathematics 2020-06-26 George Georgescu

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…

Combinatorics · Mathematics 2022-08-05 Guillermo Pineda-Villavicencio , Benjamin Schröter