English
Related papers

Related papers: Decompositions of Ehrhart $h^*$-polynomials for ra…

200 papers

This work reports and classifies the most general construction of rational quantum potentials in terms of the generalized Hermite polynomials. This is achieved by exploiting the intrinsic relation between third-order shape-invariant…

Mathematical Physics · Physics 2022-12-07 Ian Marquette , Kevin Zelaya

We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…

Combinatorics · Mathematics 2026-01-06 Enrique Reyes , Carlos E. Valencia , Rafael H. Villarreal

Brion's Formula realizes the Laurent polynomial of lattice points in a lattice polytope P as the sum of rational functions associated to the vertices of P. In this paper, we consider the special case where P is a generalized permutohedron.…

Combinatorics · Mathematics 2026-05-06 Matthias Beck , Caroline Klivans , Dustin Ross

We show that the base polytope $P_M$ of any paving matroid $M$ can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers…

We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…

Symbolic Computation · Computer Science 2021-02-15 Mark Giesbrecht , Hui Huang , George Labahn , Eugene Zima

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

The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…

Algebraic Geometry · Mathematics 2010-03-02 Elisa Postinghel

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

A method to construct multi-indexed exceptional Laguerre polynomials using isospectral deformation technique and quantum Hamilton-Jacobi (QHJ) formalism is presented. We construct generalized superpotentials using singularity structure…

Mathematical Physics · Physics 2017-11-15 S. Sree Ranjani

We study the hypersimplex under the action of the symmetric group $S_n$ by coordinate permutation. We prove that the evaluation of its equivariant $H^*$-polynomial at $1$ is the permutation character of decorated ordered set partitions…

Combinatorics · Mathematics 2026-01-14 Oliver Clarke , Max Kölbl

We show that if $P$ is a lattice polytope in the nonnegative orthant of $\R^k$ and $\chi$ is a coloring of the lattice points in the orthant such that the color $\chi(a+b)$ depends only on the colors $\chi(a)$ and $\chi(b)$, then the number…

Combinatorics · Mathematics 2007-06-11 Vit Jelinek , Martin Klazar

For $n\in\mathbb{N}$ and $\ell\in\{0,1,\dots,n\}$, we consider the function extracting the $\ell$th coefficient of the Ehrhart polynomials of lattice polytopes in $\mathbb{R}^n$. These functions form a basis of the space of unimodular…

Combinatorics · Mathematics 2025-07-17 Claudia Alfes , Joshua Maglione , Christopher Voll

In this paper we use the technique of Hopf algebras and quasi-symmetric functions to study the combinatorial polytopes. Consider the free abelian group $\mathcal{P}$ generated by all combinatorial polytopes. There are two natural bilinear…

Combinatorics · Mathematics 2015-05-20 Victor M. Buchstaber , Nickolai Erokhovets

The central object of study in this paper are infinite banded Hessenberg matrices admitting factorisations as products of bidiagonal matrices. In the two main novel results of this paper, we show that these Hessenberg matrices are…

Classical Analysis and ODEs · Mathematics 2025-05-19 Hélder Lima

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

Classical Analysis and ODEs · Mathematics 2008-11-26 Satoru Odake , Ryu Sasaki

We consider the Ehrhart polynomial of hypersimplices. It is proved that these polynomials have positive coefficients and we give a combinatorial formula for each of them. This settles a problem posed by Stanley and also proves that uniform…

Combinatorics · Mathematics 2020-11-23 Luis Ferroni

We describe a genetic algorithm to find candidates for $h^*$-vectors satisfying given properties in the space of integers vectors of finite length. We use an implementation of such algorithm to find a 52-dimensional lattice polytope having…

Combinatorics · Mathematics 2024-10-25 Gabriele Balletti

Let $M$ be a compact torsion-free $G_2$ 7-manifold or Calabi-Yau 6-manifold. We prove Hodge decomposition theorems for the $dd^\phi$ operators, introduced by Harvey and Lawson, which generalize the $i\partial\bar\partial$ operator used in…

Differential Geometry · Mathematics 2025-07-02 Tommaso Pacini , Alberto Raffero

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…

Combinatorics · Mathematics 2023-10-10 William Q. Erickson , Markus Hunziker

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Computational Complexity · Computer Science 2012-10-30 Nicolas de Rugy-Altherre
‹ Prev 1 8 9 10 Next ›