相关论文: Lattice-free Schubitopes

An n-dimensional simplex \Delta in \R^n is called empty lattice simplex if \Delta \cap\Z^n is exactly the set of vertices of \Delta . A theorem of G. K. White shows that if n=3 then any empty lattice simplex \Delta \subset\R^3 is isomorphic…

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…

The local $h^*$-polynomial is a natural invariant of a lattice polytope appearing in Ehrhart theory and Hodge theory. In this work, we study the question posed in [GKZ94] concerning the classification of lattice simplices with vanishing…

The following two results are shown. 1) Let $G$ be the $k$-rational points of a simple algebraic group over a local field $k$ and let $H$ be a lattice in $G.$ Then the regular representation of $G$ on $L^2(G/H)$ has a spectral gap (that is,…

A quadratic lattice $M$ over a Dedekind domain $R$ with fraction field $F$ is defined to be a finitely generated torsion-free $R$-module equipped with a non-degenerate quadratic form on the $F$-vector space $F\otimes_{R}M$. Assuming that…

We prove that for every complex classical group $G$ the string polytope associated to a special reduced decomposition and any dominant integral weight $\lambda$ will be a lattice polytope if and only if the highest weight representation of…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…

We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…

A graph is called t-perfect if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We show that it can be decided in polynomial time whether a given claw-free graph is t-perfect.

Let $M$ be an uniformizable Anderson $t$-motive of rank $r$, $L$ its lattice and $l_*:=\{l_1,\dots, l_r\}$ its basis. We define a map $\delta$ from the set of these bases to a flag variety (the present text gives the definition of $\delta$…

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

The lattice size $\operatorname{ls_\Delta}(P)$ of a lattice polytope $P$ is a geometric invariant, which was formally introduced in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an…

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

Let $S$ be a finite subset of ${\mathbb R}^2 \setminus (0,0)$. Generally, one would expect the pattern of lines $Ax + By = 1$, where $(A, B) \in S$ to contain polygons of all shapes and sizes. We show, however, that when $S$ is a…

In this paper we study algebras of modular forms on unitary groups of signature $(n,1)$. We give a necessary and sufficient condition for an algebra of unitary modular forms to be free in terms of the modular Jacobian. As a corollary we…

We present examples of smooth lattice polytopes in dimensions 3 and higher where each coefficient of their Ehrhart polynomials that can potentially be negative is indeed negative. This answers a question by Bruns. We also discuss…

We study D\'iaz-Dineen's problem for regular homogeneous vector-valued polynomials. In particular, we prove that if $E^*$ and $F^*$ are lattice isomorphic with at least one having order continuous norm, then $\mathcal{P}^r(^n E; G^*)$ and…

A classical result states that if $f(z)$ is a polynomial of degree at most $n$ with nonnegative coefficients, then $f(z)$ has no zeros in the sector $|\arg(z)| < \frac{\pi}{n}$ of the complex plane, and the bound $\frac{\pi}{n}$ is tight.…

In this article, we establish the relations between a sandpile graph, its sandpile monoid and the weighted Leavitt path algebra associated with it. Namely, we show that the lattice of all idempotents of the sandpile monoid $\text{SP}(E)$ of…