English
Related papers

Related papers: Techniques in equivariant Ehrhart theory

200 papers

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels

We study the Ehrhart $h^\ast$-polynomial of (the boundary of) a lattice polytope via regular unimodular triangulations and Gr\"obner degenerations of toric ideals. Our main result is a boundary analogue of the well-known Sturmfels…

Combinatorics · Mathematics 2026-04-28 Martina Juhnke , Steffen Schlie

We give rigorous foundations for parametrized homotopy theory in this monograph. After preliminaries on point-set topology, base change functors, and proper actions of non-compact Lie groups, we develop the homotopy theory of equivariant…

Algebraic Topology · Mathematics 2007-05-23 J. P. May , J. Sigurdsson

We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…

Combinatorics · Mathematics 2009-07-10 Alan Stapledon

In this study, we introduce a method for learning group (known or unknown) equivariant functions by learning the associated quadratic form $x^T A x$ corresponding to the group from the data. Certain groups, known as orthogonal groups,…

Machine Learning · Computer Science 2025-10-16 Pavan Karjol , Vivek V Kashyap , Rohan Kashyap , Prathosh A P

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…

Combinatorics · Mathematics 2020-02-11 Johannes Hofscheier , Benjamin Nill , Dennis Öberg

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address…

Machine Learning · Statistics 2026-02-12 Wilson G. Gregory , Josué Tonelli-Cueto , Nicholas F. Marshall , Andrew S. Lee , Soledad Villar

We use sheaf theory and the six operations to define and study the (equivariant) homology of stacks. The construction makes sense in the algebraic, complex-analytic, or even topological categories.

Algebraic Topology · Mathematics 2025-06-06 Adeel A. Khan

This article provides a comprehensive exposition about inequalities that the coefficients of Ehrhart polynomials and $h^*$-polynomials satisfy under various assumptions. We pay particular attention to the properties of Ehrhart positivity as…

Combinatorics · Mathematics 2024-08-23 Luis Ferroni , Akihiro Higashitani

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

Combinatorics · Mathematics 2020-02-11 Tyrrell B. McAllister

This is the second in a series of papers. Here we develop here an intersection theory for manifolds equipped with an action of a finite group. As in our previous paper, our approach will be homotopy theoretic, enabling us to circumvent the…

Algebraic Topology · Mathematics 2009-01-23 John R. Klein , Bruce Williams

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

Combinatorics · Mathematics 2024-02-20 Jesús A. De Loera , Laura Escobar , Nathan Kaplan , Chengyang Wang

This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…

Combinatorics · Mathematics 2007-06-25 Beifang Chen

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

An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…

Combinatorics · Mathematics 2007-05-23 Rade T. Zivaljevic

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

Combinatorics · Mathematics 2007-05-23 M. Beck , J. A. De Loera , M. Develin , J. Pfeifle , R. P. Stanley

Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…

Geometric Topology · Mathematics 2007-05-23 Nafaa Chbili

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

Combinatorics · Mathematics 2017-01-03 Jesús A. De Loera , David C. Haws , Matthias Köppe

We define the equivariant Kazhdan-Lusztig polynomial of a matroid equipped with a group of symmetries, generalizing the nonequivariant case. We compute this invariant for arbitrary uniform matroids and for braid matroids of small rank.

Combinatorics · Mathematics 2016-11-23 Katie Gedeon , Nicholas Proudfoot , Ben Young