English
Related papers

Related papers: Perfect but not generating Delaunay polytopes

200 papers

We introduce a criterion that a given bihamiltonian structure allows a local coordinate system where both brackets have constant coefficients. This criterion is applied to the bihamiltonian open Toda lattice in a generic point, which is…

Differential Geometry · Mathematics 2007-05-23 Israel M. Gelfand , Ilya Zakharevich

An $n$-dimensional lattice polytope ${\mathcal Q}_\sigma$ can be associated to any composition $\sigma$ of a positive integer $n$, as a special case of constructions due to Pitman--Stanley and Chapoton. The entries of the $h$-vector of…

Combinatorics · Mathematics 2026-01-27 Christos A. Athanasiadis

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

Logic · Mathematics 2024-11-20 Richard A. Shore , Bjørn Kjos-Hanssen

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

Rings and Algebras · Mathematics 2021-05-10 Daizhan Cheng , Zhengping Ji

We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…

Combinatorics · Mathematics 2019-12-24 Giulia Codenotti , Francisco Santos

Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…

Combinatorics · Mathematics 2026-02-17 Ahmad Abdi , Gérard Cornuéjols , Siyue Liu , Olha Silina

In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most…

Number Theory · Mathematics 2026-03-30 Leo Hong , Dmitry Kleinbock , Vasiliy Neckrasov

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

Combinatorics · Mathematics 2026-04-14 Benjamin Nill

The classification work [5], [9] left unsettled only those anomalous isoparametric hypersurfaces with four principal curvatures and multiplicity pair $\{4,5\},\{6,9\}$ or $\{7,8\}$ in the sphere. By systematically exploring the ideal theory…

Differential Geometry · Mathematics 2011-05-23 Quo-Shin Chi

First we develop a technique to construct Banach lattices of homogeneous polynomials. We obtain, in particular, conditions for the linear spans of all positive compact and weakly compact $n$-homogeneous polynomials between the Banach…

Functional Analysis · Mathematics 2024-06-06 Geraldo Botelho , Vinícius C. C. Miranda , Pilar Rueda

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

Algebraic Geometry · Mathematics 2024-12-31 Laura Escobar , Megumi Harada , Christopher Manon

For each positive integer $n \geq 4$, we give an inequality satisfied by rank functions of arrangements of $n$ subspaces. When $n=4$ we recover Ingleton's inequality; for higher $n$ the inequalities are all new. These inequalities can be…

Combinatorics · Mathematics 2010-04-13 Ryan Kinser

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

Combinatorics · Mathematics 2015-10-20 Roland Bacher

In two dimensional digital geometry, two lattice points are 4-connected (resp. 8-connected) if their Euclidean distance is at most one (resp. $\sqrt{2}$). A set $S \subset Z^2$ is 4-connected (resp. 8-connected) if for all pair of points…

Computational Geometry · Computer Science 2021-03-09 Crombez Loïc

Herzog and Srinivasan have conjectured that for any homogeneous k-algebra, the degree is bounded above by a function of the maximal degrees of the syzygies. Combining the syzygy quadrangle decomposition of Peeva and Sturmfels and a delicate…

Commutative Algebra · Mathematics 2007-05-23 Leah H. Gold

We investigate the integer solutions of Diophantine equations related to perfect numbers. These solutions generalize the example, found by Descartes in 1638, of an odd, ``spoof'' perfect factorization $3^2\cdot 7^2\cdot 11^2\cdot 13^2\cdot…

Number Theory · Mathematics 2020-06-19 BYU Computational Number Theory Group

The classical Skolem--Noether Theorem [Giraud, 71] shows us (1) how we can assign to an Azumaya algebra $A$ on a scheme $X$ a cohomological Brauer class in $H^2(X,\mathbf G_m)$ and (2) how Azumaya algebras correspond to twisted vector…

Algebraic Geometry · Mathematics 2022-07-01 Ajneet Dhillon , Pál Zsámboki

For any $\gamma>0$, Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$-vertex $k$-uniform hypergraph whose minimum codegree is at least $n/k+\gamma n$. We prove a…

Combinatorics · Mathematics 2016-06-21 Jie Han

Let $\calM=\Gamma\bs \calH^{(n)}$, where $\calH^{(n)}$ is a product of $n+1$ hyperbolic planes and $\Gamma\subset\PSL(2,\bbR)^{n+1}$ is an irreducible cocompact lattice. We consider closed geodesics on $\calM$ that propagate locally only in…

Number Theory · Mathematics 2010-08-31 Dubi Kelmer