English
Related papers

Related papers: Beyond positivity in Ehrhart Theory

200 papers

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

Combinatorics · Mathematics 2018-02-28 Amanda Cameron , Alex Fink

We show how to compute the Ehrhart polynomial of the free sum of two lattice polytopes containing the origin $P$ and $Q$ in terms of the enumerative combinatorics of $P$ and $Q$. This generalizes work of Beck, Jayawant, McAllister, and…

Combinatorics · Mathematics 2021-10-05 Alan Stapledon

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…

Combinatorics · Mathematics 2016-03-17 Benjamin Braun , Liam Solus

The present paper is devoted to the description of finite-dimensional semisimple Leibniz algebras over complex numbers, their derivations and automorphisms.

Rings and Algebras · Mathematics 2017-08-29 Shavkat Ayupov , Karimbergen Kudaybergenov , Bakhrom Omirov , Kaiming Zhao

Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…

Combinatorics · Mathematics 2026-05-21 Takashi Hirotsu

The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…

Combinatorics · Mathematics 2007-05-23 Matthias Beck , Dennis Pixton

Counting lattice points and triangulating polytopes is a prominent subject in discrete geometry, yet proving Ehrhart positivity or existence of unimodular triangulations remain of utmost difficulty in general, even for ``easy'' simplices.…

Combinatorics · Mathematics 2025-12-22 Jhon B. Caicedo , Martina Juhnke , Germain Poullot

We conjecture unimodality for some sequences of generalized Kronecker coefficients and prove it for partitions with at most two columns. The proof is based on a hard Lefschetz property for corresponding highest weight spaces. We also study…

Combinatorics · Mathematics 2023-12-29 Alimzhan Amanov , Damir Yeliussizov

A combinatorial study of multiple $q$-integrals is developed. This includes a $q$-volume of a convex polytope, which depends upon the order of $q$-integration. A multiple $q$-integral over an order polytope of a poset is interpreted as a…

Combinatorics · Mathematics 2016-08-12 Jang Soo Kim , Dennis Stanton

We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.

Combinatorics · Mathematics 2011-05-24 Michele D'Adderio , Luca Moci

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…

Combinatorics · Mathematics 2024-12-02 Girtrude Hamm , Johannes Hofscheier , Alexander Kasprzyk

An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…

Quantum Algebra · Mathematics 2012-08-30 Jasper V. Stokman

Lehmer constructs four classes of matrices constructed from roots of unity for which the characteristic polynomials and the $k$-th powers can be determined explicitly. Here we study a class of matrices which arise naturally in…

Number Theory · Mathematics 2023-12-06 Satoshi Kumabe , Hasan Saad

We present a new notion of non-positively curved groups: the collection of discrete countable groups acting (AU-)acylindrically on finite products of $\delta$-hyperbolic spaces with general type factors. Inspired by the classical theory of…

Group Theory · Mathematics 2025-12-30 Sahana Balasubramanya , Talia Fernos

We show that in positive characteristic special loci of deformation spaces of rank one $\ell$-adic local systems are quasilinear. From this we deduce the Hard Lefschetz theorem for rank one $\ell$-adic local systems and a generic vanishing…

Algebraic Geometry · Mathematics 2021-05-21 Hélène Esnault , Moritz Kerz

We study vertex algebras and their modules associated with possibly degenerate even lattices, using an approach somewhat different from others. Several known results are recovered and a number of new results are obtained. We also study…

Quantum Algebra · Mathematics 2008-02-04 Haisheng Li , Qing Wang

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

Number Theory · Mathematics 2016-03-18 Eugen J. Ionascu

We show that coefficients in unicellular LLT polynomials are evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements. We express these in terms of traditional trace bases, induction, and Kazhdan-Lusztig R-polynomials.

Combinatorics · Mathematics 2024-06-25 Alejandro H. Morales , Mark A. Skandera , Jiayuan Wang

We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…

Logic in Computer Science · Computer Science 2025-01-30 Cécilia Pradic