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 Convex-normal (Pairs of) Polytopes

2017 ◽  
Vol 60 (3) ◽  
pp. 510-521
Author(s):  
Christian Haase ◽  
Jan Hofmann
Keyword(s):  
Lattice Polytopes ◽  
Decomposition Property ◽  
Integer Decomposition Property

AbstractIn 2012, Gubeladze (Adv. Math. 2012) introduced the notion ofk-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+ 1) have the integer decomposition property. In the first part of this paper we show that for lattice polytopes there is no diòerence betweenk- and (k+ 1)-convex-normality (fork≥ 3) and improve the bound to 2d(d+ 1). In the second part we extend the definition to pairs of polytopes. Given two rational polytopesPandQ, where the normal fan ofPis a reûnement of the normal fan ofQ, if every edge ePofPis at least d times as long as the corresponding face (edge or vertex) eQofQ, then.

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 Mutations of Fake Weighted Projective Planes

2015 ◽  
Vol 59 (2) ◽  
pp. 271-285 ◽  
Author(s):  
Mohammad E. Akhtar ◽  
Alexander M. Kasprzyk
Keyword(s):  
Diophantine Equations ◽  
Toric Varieties ◽  
Projective Planes ◽  
Complete Characterization ◽  
Lattice Polytopes ◽  
One Step

AbstractIn previous work by Coates, Galkin and the authors, the notion of mutation between lattice polytopes was introduced. Such mutations give rise to a deformation between the corresponding toric varieties. In this paper we study one-step mutations that correspond to deformations between weighted projective planes, giving a complete characterization of such mutations in terms ofT-singularities. We also show that the weights involved satisfy Diophantine equations, generalizing results of Hacking and Prokhorov.

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.

scholarly journals Protein complex formation in methionine chain-elongation and leucine biosynthesis

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Li-Qun Chen ◽  
Shweta Chhajed ◽  
Tong Zhang ◽  
Joseph M. Collins ◽  
Qiuying Pang ◽  
...  
Keyword(s):  
Protein Complexes ◽  
Complete Characterization ◽  
Bimolecular Fluorescence Complementation ◽  
Chain Elongation ◽  
Substrate Channeling ◽  
Leucine Biosynthesis ◽  
Protein Complex Formation ◽  
Genes Encoding ◽  
Isopropylmalate Dehydrogenase

AbstractDuring the past two decades, glucosinolate (GLS) metabolic pathways have been under extensive studies because of the importance of the specialized metabolites in plant defense against herbivores and pathogens. The studies have led to a nearly complete characterization of biosynthetic genes in the reference plant Arabidopsis thaliana. Before methionine incorporation into the core structure of aliphatic GLS, it undergoes chain-elongation through an iterative three-step process recruited from leucine biosynthesis. Although enzymes catalyzing each step of the reaction have been characterized, the regulatory mode is largely unknown. In this study, using three independent approaches, yeast two-hybrid (Y2H), coimmunoprecipitation (Co-IP) and bimolecular fluorescence complementation (BiFC), we uncovered the presence of protein complexes consisting of isopropylmalate isomerase (IPMI) and isopropylmalate dehydrogenase (IPMDH). In addition, simultaneous decreases in both IPMI and IPMDH activities in a leuc:ipmdh1 double mutants resulted in aggregated changes of GLS profiles compared to either leuc or ipmdh1 single mutants. Although the biological importance of the formation of IPMI and IPMDH protein complexes has not been documented in any organisms, these complexes may represent a new regulatory mechanism of substrate channeling in GLS and/or leucine biosynthesis. Since genes encoding the two enzymes are widely distributed in eukaryotic and prokaryotic genomes, such complexes may have universal significance in the regulation of leucine biosynthesis.

scholarly journals Topological Approach to Mathematical Programs with Switching Constraints

2021 ◽  
Author(s):  
Vladimir Shikhman
Keyword(s):  
Stationary Point ◽  
Mountain Pass Theorem ◽  
Strong Stability ◽  
Complete Characterization ◽  
Stationary Points ◽  
Mathematical Programs ◽  
Linear Independence Constraint Qualification ◽  
Point Set ◽  
Stationary Level

AbstractWe study mathematical programs with switching constraints (for short, MPSC) from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point set, continuous deformation of lower level sets can be performed. However, when passing a W-stationary level, the topology of the lower level set changes via the attachment of a w-dimensional cell. The dimension w equals the W-index of the nondegenerate W-stationary point. The W-index depends on both the number of negative eigenvalues of the restricted Lagrangian’s Hessian and the number of bi-active switching constraints. As a consequence, we show the mountain pass theorem for MPSC. Additionally, we address the question if the assumption on the nondegeneracy of W-stationary points is too restrictive in the context of MPSC. It turns out that all W-stationary points are generically nondegenerate. Besides, we examine the gap between nondegeneracy and strong stability of W-stationary points. A complete characterization of strong stability for W-stationary points by means of first and second order information of the MPSC defining functions under linear independence constraint qualification is provided. In particular, no bi-active Lagrange multipliers of a strongly stable W-stationary point can vanish.

Sign in / Sign up

Export Citation Format

Share Document