scholarly journals A Note on Palindromic $\delta$-Vectors for Certain Rational Polytopes

10.37236/893 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Matthew H. J. Fiset ◽  
Alexander M. Kasprzyk
Keyword(s):  
Lattice Point ◽  
Convex Polytope ◽  
Lattice Polytope ◽  
Elementary Lattice

Let $P$ be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if $P$ is also a lattice polytope then the Ehrhart $\delta$-vector of $P$ is palindromic. Perhaps less well-known is that a similar result holds when $P$ is rational. We present an elementary lattice-point proof of this fact.

scholarly journals On Counterexamples to a Conjecture of Wills and Ehrhart Polynomials whose Roots have Equal Real Parts

10.37236/3757 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Matthias Henze
Keyword(s):  
Lattice Point ◽  
Convex Bodies ◽  
Discrete Analog ◽  
Side Length ◽  
Ehrhart Polynomials ◽  
Lattice Polytopes ◽  
Lattice Polytope ◽  
Positive Side ◽  
Reflexive Polytopes

As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a $0$-symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side length two. We discuss several counterexamples to this conjecture and, on the positive side, we identify a family of lattice polytopes that fulfill the claimed inequalities. This family is related to the recently introduced class of $l$-reflexive polytopes.

scholarly journals Grossberg–Karshon Twisted Cubes and Hesitant Jumping Walk Avoidance

10.37236/9278 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
Eunjeong Lee
Keyword(s):  
Algebraic Group ◽  
Recent Work ◽  
Borel Subgroup ◽  
Convex Polytope ◽  
Lattice Points ◽  
Lattice Polytope ◽  
Integer Sequence ◽  
Demazure Module ◽  
Twisted Cube ◽  
Twisted Cubes

Let $G$ be a complex simply-laced semisimple algebraic group of rank $r$ and $B$ a Borel subgroup. Let $\mathbf i \in [r]^n$ be a word and let $\boldsymbol{\ell} = (\ell_1,\dots,\ell_n)$ be a sequence of non-negative integers. Grossberg and Karshon introduced a virtual lattice polytope associated to $\mathbf i$ and $\boldsymbol{\ell}$ called a twisted cube, whose lattice points encode the character of a $B$-representation. More precisely, lattice points in the twisted cube, counted with sign according to a certain density function, yields the character of the generalized Demazure module determined by $\mathbf i$ and $\boldsymbol{\ell}$. In recent work, the author and Harada described precisely when the Grossberg–Karshon twisted cube is untwisted, i.e., the twisted cube is a closed convex polytope, in the situation when the integer sequence $\boldsymbol{\ell}$ comes from a weight $\lambda$ of $G$. However, not every integer sequence $\boldsymbol{\ell}$ comes from a weight of $G$. In the present paper, we interpret the untwistedness of Grossberg–Karshon twisted cubes associated with any word $\mathbf i$ and any integer sequence $\boldsymbol{\ell}$ using the combinatorics of $\mathbf i$ and $\boldsymbol{\ell}$. Indeed, we prove that the Grossberg–Karshon twisted cube is untwisted precisely when $\mathbf i$ is hesitant-jumping-$\boldsymbol{\ell}$-walk-avoiding.

A New Condition of Formation and Stablity of All Crystalline Systems in a Good Agreement with Experimental Data

2015 ◽  
Vol 11 (3) ◽  
pp. 3224-3228
Author(s):  
Tarek El-Ashram
Keyword(s):  
Experimental Data ◽  
Brillouin Zone ◽  
Electron Concentration ◽  
Free Electron ◽  
Lattice Point ◽  
Valence Electron ◽  
Fermi Gas ◽  
Valence Electron Concentration ◽  
Fermi Sphere ◽  
Good Agreement

In this paper we derived a new condition of formation and stability of all crystalline systems and we checked its validity andit is found to be in a good agreement with experimental data. This condition is derived directly from the quantum conditionson the free electron Fermi gas inside the crystal. The new condition relates both the volume of Fermi sphere VF andvolume of Brillouin zone VB by the valence electron concentration VEC as ;𝑽𝑭𝑽𝑩= 𝒏𝑽𝑬𝑪𝟐for all crystalline systems (wheren is the number of atoms per lattice point).

scholarly journals A short note on extreme points of certain polytopes

2020 ◽  
Vol 8 (1) ◽  
pp. 36-39
Author(s):  
Lei Cao ◽  
Ariana Hall ◽  
Selcuk Koyuncu
Keyword(s):  
Short Proof ◽  
Convex Polytopes ◽  
Short Note ◽  
Convex Polytope ◽  
Extreme Points ◽  
Alternative Proof ◽  
Stochastic Matrices ◽  
Doubly Stochastic ◽  
Birkhoff's Theorem ◽  
Birkhoff’S Theorem

AbstractWe give a short proof of Mirsky’s result regarding the extreme points of the convex polytope of doubly substochastic matrices via Birkhoff’s Theorem and the doubly stochastic completion of doubly sub-stochastic matrices. In addition, we give an alternative proof of the extreme points of the convex polytopes of symmetric doubly substochastic matrices via its corresponding loopy graphs.

Characterization of the conditional stationary distribution in Markov chains via systems of linear inequalities

2020 ◽  
Vol 52 (4) ◽  
pp. 1249-1283
Author(s):  
Masatoshi Kimura ◽  
Tetsuya Takine
Keyword(s):  
Markov Chains ◽  
Stationary Distribution ◽  
Continuous Time ◽  
State Transition ◽  
Convex Polytope ◽  
Linear Inequalities ◽  
Systems Of Linear Inequalities ◽  
Free Sets ◽  
Practical Implications

AbstractThis paper considers ergodic, continuous-time Markov chains $\{X(t)\}_{t \in (\!-\infty,\infty)}$ on $\mathbb{Z}^+=\{0,1,\ldots\}$ . For an arbitrarily fixed $N \in \mathbb{Z}^+$ , we study the conditional stationary distribution $\boldsymbol{\pi}(N)$ given the Markov chain being in $\{0,1,\ldots,N\}$ . We first characterize $\boldsymbol{\pi}(N)$ via systems of linear inequalities and identify simplices that contain $\boldsymbol{\pi}(N)$ , by examining the $(N+1) \times (N+1)$ northwest corner block of the infinitesimal generator $\textbf{\textit{Q}}$ and the subset of the first $N+1$ states whose members are directly reachable from at least one state in $\{N+1,N+2,\ldots\}$ . These results are closely related to the augmented truncation approximation (ATA), and we provide some practical implications for the ATA. Next we consider an extension of the above results, using the $(K+1) \times (K+1)$ ( $K > N$ ) northwest corner block of $\textbf{\textit{Q}}$ and the subset of the first $K+1$ states whose members are directly reachable from at least one state in $\{K+1,K+2,\ldots\}$ . Furthermore, we introduce new state transition structures called (K, N)-skip-free sets, using which we obtain the minimum convex polytope that contains $\boldsymbol{\pi}(N)$ .

scholarly journals Bounds on the Lattice Point Enumerator via Slices and Projections

2021 ◽  
Author(s):  
Ansgar Freyer ◽  
Martin Henk
Keyword(s):  
Convex Body ◽  
Lattice Point ◽  
Geometric Mean ◽  
Discrete Analogue ◽  
Lattice Points ◽  
General Context ◽  
General Bound

AbstractGardner et al. posed the problem to find a discrete analogue of Meyer’s inequality bounding from below the volume of a convex body by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated by this problem, for which we provide a first general bound, we study in a more general context the question of bounding the number of lattice points of a convex body in terms of slices, as well as projections.

scholarly journals 10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope

2001 ◽  
Vol 22 (5) ◽  
pp. 705-708 ◽  
Author(s):  
David Forge ◽  
Michel Las Vergnas ◽  
Peter Schuchert
Keyword(s):  
Convex Polytope
Sign in / Sign up

Export Citation Format

Share Document