English
Related papers

Related papers: Reflexive polytopes arising from perfect graphs

200 papers

Given arbitrary integers $d$ and $r$ with $d \geq 4$ and $1 \leq r \leq d + 1$, a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ with ${\rm depth} K[\mathcal{P}] = r$ for which its dual polytope $\mathcal{P}^\vee$ is…

Commutative Algebra · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…

Combinatorics · Mathematics 2023-08-29 Matthias Beck , Sophia Elia , Sophie Rehberg

We characterize the absolute retracts in the category of reflexive oriented graphs, that is, antisymmetric reflexive graphs, where morphisms between objects preserve arcs (which may be sent to loops). Here we show, by correcting a much…

Combinatorics · Mathematics 2023-12-12 Hans-Jürgen Bandelt , Maurice Pouzet , Faouzi Saïdane

Martin-L\"of's identity types provide a generic (albeit opaque) notion of identification or "equality" between any two elements of the same type, embodied in a canonical reflexive graph structure $(=_A, \mathbf{refl})$ on any type $A$. The…

Logic in Computer Science · Computer Science 2026-01-21 Jonathan Sterling

We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…

Logic in Computer Science · Computer Science 2022-07-01 Marlou M. Gijzen , Hajime Ishihara , Tatsuji Kawai

Reflexive functors of modules naturally appear in Algebraic Geometry, mainly in the theory of linear representations of group schemes, and in "duality theories". In this paper we study and determine reflexive functors and we give many…

Commutative Algebra · Mathematics 2013-10-23 J. Navarro , C. Sancho , P. Sancho

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

Commutative Algebra · Mathematics 2016-02-01 Emilie Dufresne

We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as…

Combinatorics · Mathematics 2021-10-27 Farid Aliniaeifard , Carolina Benedetti , Nantel Bergeron , Shu Xiao Li , Franco Saliola

For each integer partition $\mathbf{q}$ with $d$ parts, we denote by $\Delta_{(1,\mathbf{q})}$ the lattice simplex obtained as the convex hull in $\mathbb{R}^d$ of the standard basis vectors along with the vector $-\mathbf{q}$. For…

Combinatorics · Mathematics 2020-10-27 Benjamin Braun , Derek Hanely

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

Classical Analysis and ODEs · Mathematics 2007-12-18 Alexei Zhedanov

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Combinatorics · Mathematics 2017-06-07 Sören Berg , Katharina Jochemko , Laura Silverstein

We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…

Algebraic Geometry · Mathematics 2008-09-12 Maximilian Kreuzer

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

The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed…

Combinatorics · Mathematics 2013-01-31 Roger E. Behrend

The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…

Combinatorics · Mathematics 2025-04-08 Himanshu Chandrakar , Anurag Singh

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Mathematical Physics · Physics 2011-09-16 Paul Baird

Assume that the valuation semigroup $\Gamma(\lambda)$ of an arbitrary partial flag variety corresponding to the line bundle $\mathcal L_\lambda$ constructed via a full-rank valuation is finitely generated and saturated. We use Ehrhart…

Algebraic Geometry · Mathematics 2020-11-24 Christian Steinert

Reflexive functors of modules naturally appear in Algebraic Geometry. In this paper we define a wide and elementary family of reflexive functors of modules, closed by tensor products and homomorphisms, in which Algebraic Geometry can be…

Algebraic Geometry · Mathematics 2015-11-16 Pedro Sancho

When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…

Metric Geometry · Mathematics 2007-05-23 Barry Monson , Egon Schulte

We study semigroup algebras arising from lattice polytopes, compute their volume polynomials (particularizing work of Hochster), and establish strong Lefschetz properties (generalizing work of the first three authors). This resolves several…