English
Related papers

Related papers: Counting Lattice Points in Generalized Permutohedr…

200 papers

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

Combinatorics · Mathematics 2013-09-23 Victor Batyrev , Johannes Hofscheier

We confirm a conjecture of Monical, Tokcan and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.

Combinatorics · Mathematics 2019-11-19 Neil J. Y. Fan , Peter L. Guo , Simon C. Y. Peng , Sophie C. C. Sun

Let $G$ be $PGL(n,F)$, $n \geq 3$, $F$ a certain non-archimedean local field; or let $G$ be $PSL(2,\mathbb{R}) \times \cdots \times PSL(2,\mathbb{R})$. Let $\Gamma$ be a lattice in $G$, and let $( \Lambda_n )$ be a sequence of lattices in…

Operator Algebras · Mathematics 2019-07-18 Lauren C. Ruth

Restricted Whitney numbers of the first kind appear in the combinatorial recursion for the matroid Kazhdan-Lusztig polynomials. In the special case of braid matroids (the matroid associated to the partition lattice, the complete graph, the…

Combinatorics · Mathematics 2018-02-06 Trevor K. Karn , Max D. Wakefield

Gr\"atzer asked in 1971 for a characterization of sublattices of Tamari lattices (associahedra). A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice---in short, bounded…

Combinatorics · Mathematics 2013-04-24 Luigi Santocanale , Friedrich Wehrung

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

Dynamical Systems · Mathematics 2020-11-25 Tal Horesh , Yakov Karasik

We extract an exact formula relating the number of lattice points in an expanding region of a complex semi-simple symmetric space and the automorphic spectrum from a spectral identity, which is obtained by producing two expressions for the…

Number Theory · Mathematics 2011-05-24 Amy DeCelles

We give asymptotic estimates for the number of non-overlapping homothetic copies of some centrally symmetric oval $B$ which have a common point with a 2-dimensional domain $F$ having rectifiable boundary, extending previous work of the…

Metric Geometry · Mathematics 2013-10-25 Valentin Boju , Louis Funar

Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…

Combinatorics · Mathematics 2010-10-12 Suho Oh

The bulk-boundary and a new bulk-defect correspondence principles are formulated using groupoid algebras. The new strategy relies on the observation that the groupoids of lattices with boundaries or defects display spaces of units with…

Operator Algebras · Mathematics 2021-09-24 Emil Prodan

Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $\varphi\colon V\rightarrow \CC $ be a homogeneous polynomial function of…

Number Theory · Mathematics 2021-12-21 Matthias Beck , Paul E. Gunnells , Evgeny Materov

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

In this paper we motivate some new directions of research regarding the lattice width of convex bodies. We show that convex bodies of sufficiently large width contain a unimodular copy of a standard simplex. This implies that every lattice…

Combinatorics · Mathematics 2019-11-12 Gennadiy Averkov , Johannes Hofscheier , Benjamin Nill

Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…

Combinatorics · Mathematics 2012-09-26 Komei Fukuda , Hiroyuki Miyata , Sonoko Moriyama

The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…

Number Theory · Mathematics 2026-01-26 Chahat Ahuja

We extend the asymptotic formula for counting integral matrices with a given irreducible characteristic polynomial by Eskin, Mozes and Shah in 1996 to the case of counting elements in a maximal order of certain central simple algebra with a…

Number Theory · Mathematics 2025-03-05 Jiaqi Xie

It is well-known that the Eulerian polynomials, which count permutations in $S_n$ by their number of descents, give the $h$-polynomial/$h$-vector of the simple polytopes known as permutohedra, the convex hull of the $S_n$-orbit for a…

Algebraic Geometry · Mathematics 2010-09-10 Letitia Golubitsky

A lattice path in $\mathbb{Z}^d$ is a sequence $\nu_1,\nu_2,\ldots,\nu_k\in\mathbb{Z}^d$ such that the steps $\nu_i-\nu_{i-1}$ lie in a subset $\mathbf{S}$ of $\mathbb{Z}^d$ for all $i=2,\ldots,k$. Let $T_{m,n}$ be the $m\times n$ table in…

There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…

Combinatorics · Mathematics 2024-09-24 Eleonore Bach , Matthias Beck , Sophie Rehberg

We give mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in $\mathbb{R}^d$, when averaged over families of shears of the lattice.

Number Theory · Mathematics 2015-12-21 Dubi Kelmer