English
Related papers

Related papers: Linear recursions for integer point transforms

200 papers

We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…

Combinatorics · Mathematics 2025-04-30 Luis Ferroni , Daniel McGinnis

For a lattice polytope P, define A_P(t) as the sum of the solid angles of all the integer points in the dilate tP. Ehrhart and Macdonald proved that A_P(t) is a polynomial in the positive integer variable t. We study the numerator…

Combinatorics · Mathematics 2015-06-29 Matthias Beck , Sinai Robins , Steven V Sam

We prove that for every complex classical group $G$ the string polytope associated to a special reduced decomposition and any dominant integral weight $\lambda$ will be a lattice polytope if and only if the highest weight representation of…

Representation Theory · Mathematics 2020-11-25 Christian Steinert

Let $ K $ be a number field, $ S $ a finite set of places of $ K $, and $ \mathcal{O}_S $ be the ring of $ S $-integers. Moreover, let $$ G_n^{(0)} Z^d + \cdots + G_n^{(d-1)} Z + G_n^{(d)} $$ be a polynomial in $ Z $ having simple linear…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…

Combinatorics · Mathematics 2025-03-28 Ming Yean Lim

From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…

Combinatorics · Mathematics 2016-09-23 Jishe Feng

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

Number Theory · Mathematics 2018-02-01 Lenny Fukshansky , Nikolay Moshchevitin

Let a polyhedron $P$ be defined by one of the following ways: (i) $P = \{x \in R^n \colon A x \leq b\}$, where $A \in Z^{(n+k) \times n}$, $b \in Z^{(n+k)}$ and $rank\, A = n$; (ii) $P = \{x \in R_+^n \colon A x = b\}$, where $A \in Z^{k…

Computational Complexity · Computer Science 2022-11-30 D. V. Gribanov , N. Yu. Zolotykh

In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…

Metric Geometry · Mathematics 2010-06-11 Marko Lindner , Steffen Roch

We prove that every degree-g polynomial in the $\psi$-classes on $\overline{\mathcal M}_{g, n}$ can be expressed as a sum of tautological classes supported on the boundary with no $\kappa$-classes. Such equations, which we refer to as…

Algebraic Geometry · Mathematics 2023-10-24 Emily Clader , Felix Janda , Xin Wang , Dmitry Zakharov

We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…

Combinatorics · Mathematics 2025-07-22 Nevena Marić

We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}_w$ as a monomial times $\mathfrak{S}_\sigma$ (in reindexed variables) plus a polynomial with nonnegative coefficients.…

Combinatorics · Mathematics 2020-11-17 Alex Fink , Karola Mészáros , Avery St. Dizier

We prove a converse theorem for the multiplicative Borcherds lift for lattices of square-free level whose associated discriminant group is anisotropic. This can be seen as generalization of Bruinier's results in \cite{Br2}, which provides a…

Number Theory · Mathematics 2023-07-12 Oliver Stein

Let $X\subset \mathbb {P}^r$ be an integral and non-degenerate variety. For any $q\in \mathbb {P}^r$ let $r_X(q)$ be its $X$-rank and $\mathcal {S} (X,q)$ the set of all finite subsets of $X$ such that $|S|=r_X(q)$ and $q\in \langle…

Algebraic Geometry · Mathematics 2019-03-26 Edoardo Ballico

A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…

alg-geom · Mathematics 2008-02-03 Sacha Sardo-Infirri

Let $m$ and $n$ be positive integers, and let $p$ be a prime. Let $T(x)=\Phi_{p^m}\left(\Phi_{2^n}(x)\right)$, where $\Phi_k(x)$ is the cyclotomic polynomial of index $k$. In this article, we prove that $T(x)$ is irreducible over $\mathbb…

Number Theory · Mathematics 2019-09-10 Joshua Harrington , Lenny Jones

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

Combinatorics · Mathematics 2025-08-26 Frédéric Chapoton

In this paper, we show that Oda's question holds for $n$-dimensional simplicial reflexive polytope $P$ and lattice polytope $Q$ containing the origin, when the vertex of $Q$ is either a vertex of $P$ or the origin, provided that $P$ has no…

Combinatorics · Mathematics 2025-11-07 Binnan Tu

One considers weighted sums over points of lattice polytopes, where the weight of a point v is the monomial q^f(v) for some linear form f. One proposes a q-analogue of the classical theory of Ehrhart series and Ehrhart polynomials,…

Quantum Algebra · Mathematics 2013-02-26 Frédéric Chapoton

We give an algorithmic proof of Pick's theorem which calculates the area of a lattice-polygon in terms of the lattice-points.

Number Theory · Mathematics 2014-07-03 Haim Shraga Rosner