English
Related papers

Related papers: Lattice-free Schubitopes

200 papers

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…

Combinatorics · Mathematics 2025-08-14 Luis Ferroni , Alex Fink

Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits multiple bases. Among these, the canonical base, the canonical…

Combinatorics · Mathematics 2025-09-03 Kira Adaricheva , Simon Vilmin

The Mordell-Weil lattices (MW lattices) associated to rational elliptic surfaces are classified into 74 types. Among them, there are cases in which the MW lattice is none of the weight lattices of simple Lie algebras or direct sums thereof.…

High Energy Physics - Theory · Physics 2019-05-01 Shun'ya Mizoguchi , Taro Tani

We consider a two-dimensional periodic Schr\"odinger operator $H=-\Delta+W$ with $\Gamma$ being the lattice of periods. We investigate the structure of the edges of open gaps in the spectrum of $H$. We show that under arbitrary small…

Mathematical Physics · Physics 2017-05-01 Leonid Parnovski , Roman Shterenberg

We describe a construction of the Tutte polynomial for both matroids and $q$-matroids based on an appropriate partition of the underlying support lattice into intervals that correspond to prime-free minors, which we call a Tutte partition.…

Combinatorics · Mathematics 2024-11-12 Eimear Byrne , Andrew Fulcher

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

Combinatorics · Mathematics 2016-08-24 Marcin Wrochna

In this paper, we introduce a novel first-order derivative for functions on a lattice graph, which extends the discrete Laplacian and generalizes the theory of discrete PDEs on lattices. First, we establish the well-posedness of generalized…

Analysis of PDEs · Mathematics 2024-10-29 Jiajun Wang

In this paper we prove that the cyclotomic Khovanov-Lauda-Rouquier algebras in type A, $\mathscr R_n^\Lambda$, are $\mathbb{Z}$-free. We then extend the graded cellular basis of $\mathscr R_n^\Lambda$ constructed by Hu and Mathas to…

Representation Theory · Mathematics 2014-12-12 Ge Li

The configuration of a matroid $M$ is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of $M$, and stronger…

Combinatorics · Mathematics 2025-12-18 Joseph E. Bonin , Anna de Mier

The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…

Combinatorics · Mathematics 2018-09-03 Ginji Hamano , Takayuki Hibi , Hidefumi Ohsugi

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Combinatorics · Mathematics 2014-05-12 Aaron Dall , Julian Pfeifle

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…

Exactly Solvable and Integrable Systems · Physics 2011-05-27 Jarmo Hietarinta , Claude Viallet

A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…

Combinatorics · Mathematics 2024-12-24 Ethan Shelburne , Stephanie van Willigenburg

We start a systematic analysis of the first-order model theory of free lattices. Firstly, we prove that the free lattices of finite rank are not positively indistinguishable, as there is a positive $\exists \forall$-sentence true in…

Logic · Mathematics 2024-03-28 J. B. Nation , Gianluca Paolini

We prove that hypersurfaces defined by irreducible square-free polynomials have rational singularities. As an easy consequence, we deduce that certain (possibly non-square-free) polynomials associated to pairs of square-free polynomials…

Algebraic Geometry · Mathematics 2025-05-13 Daniel Bath , Mircea Mustaţă , Uli Walther

In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…

Combinatorics · Mathematics 2021-05-24 Luis Ferroni

We prove the torsion freeness of the decomposable Orlik--Solomon algebra of a simple matroid on ground set $[n]$. In the class of hypersolvable \& non-supersolvable complex hyperplane arrangements, the torsion freeness, in a certain degree,…

Combinatorics · Mathematics 2023-02-22 Anca Macinic

We study the Chow classes of arbitrary matroids in the Grassmannian. We develop a new combinatorial approach for computing them, by first focusing on snake matroids and then extending our results via valuativity to any matroid. Our main…

Combinatorics · Mathematics 2025-11-21 Jon Pål Hamre , Benjamin Schröter , Lorenzo Vecchi , Emil Verkama

The space $M_{\mu/i,j}$ spanned by all partial derivatives of the lattice polynomial $\Delta_{\mu/i,j}(X;Y)$ is investigated in math.CO/9809126 and many conjectures are given. Here, we prove all these conjectures for the $Y$-free component…

Combinatorics · Mathematics 2016-11-08 Jean-Christophe Aval , Francois Bergeron , Nantel Bergeron

We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…

Combinatorics · Mathematics 2016-05-13 Mónica Blanco , Francisco Santos