scholarly journals Ehrhart $f^*$-Coefficients of Polytopal Complexes are Non-negative Integers

10.37236/2106 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Felix Breuer
Keyword(s):  
Complete Characterization ◽  
Lattice Points ◽  
Ehrhart Polynomial ◽  
Simplicial Cone ◽  
Ehrhart Theory ◽  
Ehrhart Polynomials ◽  
Integer Points ◽  
Polytopal Complex ◽  
Main Technical Tool

The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart $\delta$-vector), which is the vector of coefficients of $L_P$ with respect to a certain binomial basis and which coincides with the $h$-vector of a regular unimodular triangulation of $P$ (if one exists). One important result by Stanley about $h^*$-vectors of polytopes is that their entries are always non-negative. However, recent combinatorial applications of Ehrhart theory give rise to polytopal complexes with $h^*$-vectors that have negative entries.In this article we introduce the Ehrhart $f^*$-vector of polytopes or, more generally, of polytopal complexes $K$. These are again coefficient vectors of $L_K$ with respect to a certain binomial basis of the space of polynomials and they have the property that the $f^*$-vector of a unimodular simplicial complex coincides with its $f$-vector. The main result of this article is a counting interpretation for the $f^*$-coefficients which implies that $f^*$-coefficients of integral polytopal complexes are always non-negative integers. This holds even if the polytopal complex does not have a unimodular triangulation and if its $h^*$-vector does have negative entries. Our main technical tool is a new partition of the set of lattice points in a simplicial cone into discrete cones. Further results include a complete characterization of Ehrhart polynomials of integral partial polytopal complexes and a non-negativity theorem for the $f^*$-vectors of rational polytopal complexes.

scholarly journals GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY

2019 ◽  
Vol 7 ◽  
Author(s):  
SPENCER BACKMAN ◽  
MATTHEW BAKER ◽  
CHI HO YUEN
Keyword(s):  
Spanning Trees ◽  
Finite Abelian Group ◽  
Tutte Polynomial ◽  
Geometric Interpretation ◽  
Lattice Points ◽  
Combinatorial Interpretation ◽  
Ehrhart Polynomial ◽  
Ehrhart Theory ◽  
Regular Matroid ◽  
Definition Of

Let $M$ be a regular matroid. The Jacobian group $\text{Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$ . This group generalizes the definition of the Jacobian group (also known as the critical group or sandpile group) $\operatorname{Jac}(G)$ of a graph $G$ (in which case bases of the corresponding regular matroid are spanning trees of $G$ ). There are many explicit combinatorial bijections in the literature between the Jacobian group of a graph $\text{Jac}(G)$ and spanning trees. However, most of the known bijections use vertices of $G$ in some essential way and are inherently ‘nonmatroidal’. In this paper, we construct a family of explicit and easy-to-describe bijections between the Jacobian group of a regular matroid $M$ and bases of $M$ , many instances of which are new even in the case of graphs. We first describe our family of bijections in a purely combinatorial way in terms of orientations; more specifically, we prove that the Jacobian group of $M$ admits a canonical simply transitive action on the set ${\mathcal{G}}(M)$ of circuit–cocircuit reversal classes of $M$ , and then define a family of combinatorial bijections $\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D70E},\unicode[STIX]{x1D70E}^{\ast }}$ between ${\mathcal{G}}(M)$ and bases of $M$ . (Here $\unicode[STIX]{x1D70E}$ (respectively $\unicode[STIX]{x1D70E}^{\ast }$ ) is an acyclic signature of the set of circuits (respectively cocircuits) of $M$ .) We then give a geometric interpretation of each such map $\unicode[STIX]{x1D6FD}=\unicode[STIX]{x1D6FD}_{\unicode[STIX]{x1D70E},\unicode[STIX]{x1D70E}^{\ast }}$ in terms of zonotopal subdivisions which is used to verify that $\unicode[STIX]{x1D6FD}$ is indeed a bijection. Finally, we give a combinatorial interpretation of lattice points in the zonotope $Z$ ; by passing to dilations we obtain a new derivation of Stanley’s formula linking the Ehrhart polynomial of $Z$ to the Tutte polynomial of $M$ .

scholarly journals Lattice Polytopes from Schur and Symmetric Grothendieck Polynomials

10.37236/9621 ◽  
2021 ◽  
Vol 28 (2) ◽  
Author(s):  
Margaret Bayer ◽  
Bennet Goeckner ◽  
Su Ji Hong ◽  
Tyrrell McAllister ◽  
McCabe Olsen ◽  
...  
Keyword(s):  
Complete Characterization ◽  
Algebraic Combinatorics ◽  
Schur Polynomials ◽  
Ehrhart Theory ◽  
Lattice Polytopes ◽  
Newton Polytopes ◽  
Decomposition Property ◽  
Integer Decomposition Property ◽  
Grothendieck Polynomials

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent interest, the confluence of these properties is a source of active investigation due to conjectures regarding the unimodality of the $h^\ast$-polynomial. In this paper, we consider the Newton polytopes arising from two families of polynomials in algebraic combinatorics: Schur polynomials and inflated symmetric Grothendieck polynomials. In both cases, we prove that these polytopes have the integer decomposition property by using the fact that both families of polynomials have saturated Newton polytope. Furthermore, in both cases, we provide a complete characterization of when these polytopes are reflexive. We conclude with some explicit formulas and unimodality implications of the $h^\ast$-vector in the case of Schur polynomials.

scholarly journals Viewing counting polynomials as Hilbert functions via Ehrhart theory

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Felix Breuer ◽  
Aaron Dall
Keyword(s):  
Hilbert Function ◽  
Chromatic Polynomial ◽  
Point Of View ◽  
Hilbert Functions ◽  
Sufficient Criterion ◽  
Ehrhart Polynomial ◽  
Ehrhart Theory ◽  
International Audience ◽  
Polytopal Complex ◽  
Nous Utilisons

International audience Steingrímsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the Ehrhart polynomial of a given relative polytopal complex is a Hilbert function in Steingrímsson's sense. We use this result to establish that the modular and integral flow and tension polynomials of a graph are Hilbert functions. Steingrímsson (2001) a montré que le polynôme chromatique d'un graphe est la fonction de Hilbert d'un idéal relatif de Stanley-Reisner. Nous abordons ce résultat du point de vue de la théorie d'Ehrhart et donnons un critère suffisant pour que le polynôme d'Ehrhart d'un complexe polytopal relatif donné soit une fonction de Hilbert au sens de Steingrímsson. Nous utilisons ce résultat pour établir que les polynômes de flux et de tension modulaires et intégraux d'un graphe sont des fonctions de Hilbert.

scholarly journals Mixed Ehrhart polynomials

10.37236/5815 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Christian Haase ◽  
Martina Juhnke-Kubitzke ◽  
Raman Sanyal ◽  
Thorsten Theobald
Keyword(s):  
Mixed Volume ◽  
Ehrhart Polynomial ◽  
Ehrhart Polynomials ◽  
Lattice Polytopes ◽  
Real Roots

For lattice polytopes $P_1,\ldots, P_k \subseteq \mathbb{R}^d$, Bihan (2016) introduced the discrete mixed volume $DMV(P_1,\dots,P_k)$ in analogy to the classical mixed volume.  In this note we study the associated mixed Ehrhart polynomial $ME_{P_1, \dots,P_k}(n) = DMV(nP_1, \dots, nP_k)$.  We provide a characterization of all mixed Ehrhart coefficients in terms of the classical multivariate Ehrhart polynomial. Bihan (2016) showed that the discrete mixed volume is always non-negative. Our investigations yield simpler proofs for certain special cases.We also introduce and study the associated mixed $h^*$-vector. We show that for large enough dilates $r  P_1, \ldots, rP_k$ the corresponding mixed $h^*$-polynomial has only real roots and as a consequence  the mixed $h^*$-vector becomes non-negative. 

scholarly journals On Ehrhart Polynomials of Lattice Triangles

10.37236/6624 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Johannes Hofscheier ◽  
Benjamin Nill ◽  
Dennis Öberg
Keyword(s):  
Lattice Points ◽  
Ehrhart Polynomial ◽  
Ehrhart Polynomials ◽  
Lattice Polygon

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 $(b(P),i(P))$ are completely described by a theorem due to Scott. In this note, we describe the shape of the set of pairs $(b(T),i(T))$ for lattice triangles $T$ by finding infinitely many new Scott-type inequalities.

Experimental Characterization of Mechanical Behavior of Cord-Rubber Composites

1982 ◽  
Vol 10 (1) ◽  
pp. 37-54 ◽  
Author(s):  
M. Kumar ◽  
C. W. Bert
Keyword(s):  
Response Characteristic ◽  
Cord Compression ◽  
Complete Characterization ◽  
Strain Response ◽  
Strain Gages ◽  
Experimental Characterization ◽  
Rubber Composites ◽  
Stress Strain ◽  
Strain Data

Abstract Unidirectional cord-rubber specimens in the form of tensile coupons and sandwich beams were used. Using specimens with the cords oriented at 0°, 45°, and 90° to the loading direction and appropriate data reduction, we were able to obtain complete characterization for the in-plane stress-strain response of single-ply, unidirectional cord-rubber composites. All strains were measured by means of liquid mercury strain gages, for which the nonlinear strain response characteristic was obtained by calibration. Stress-strain data were obtained for the cases of both cord tension and cord compression. Materials investigated were aramid-rubber, polyester-rubber, and steel-rubber.

Characterization of CMOS Structures (0.6 µm process) Submitted to HBM and COM ESD Stress Tests

1997 ◽  
Author(s):  
G. Meneghesso ◽  
E. Zanoni ◽  
P. Colombo ◽  
M. Brambilla ◽  
R. Annunziata ◽  
...  
Keyword(s):  
Electron Microscopy ◽  
Electrostatic Discharge ◽  
Stress Test ◽  
Complete Characterization ◽  
Stress Tests ◽  
Test Procedures ◽  
Emission Microscopy ◽  
Fast Rise ◽  
Scanning Electron

Abstract In this work, we present new results concerning electrostatic discharge (ESD) robustness of 0.6 μm CMOS structures. Devices have been tested according to both HBM and socketed CDM (sCDM) ESD test procedures. Test structures have been submitted to a complete characterization consisting in: 1) measurement of the tum-on time of the protection structures submitted to pulses with very fast rise times; 2) ESD stress test with the HBM and sCDM models; 3) failure analysis based on emission microscopy (EMMI) and Scanning Electron Microscopy (SEM).

scholarly journals Complete characterization of spin chains with two Ising symmetries

2019 ◽  
Vol 125 (1) ◽  
pp. 10008 ◽  
Author(s):  
Bat-el Friedman ◽  
Atanu Rajak ◽  
Emanuele G. Dalla Torre
Keyword(s):  
Complete Characterization ◽  
Spin Chains

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

Sign in / Sign up

Export Citation Format

Share Document