English
Related papers

Related papers: Integer decomposition property of polytopes

200 papers

In the paper of Montgomery, D. and Yang, C.T. [5], they discuss the de-suspension of smooth free actions of S1 on (2n+1)-dimensional homotopy spheres. In this paper we discuss the de-suspension of smooth free actions of S3 on (4n +…

Geometric Topology · Mathematics 2012-05-08 Issam Kaddoura

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

Number Theory · Mathematics 2020-12-15 Puyun Gao

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7,…

Combinatorics · Mathematics 2015-05-15 Michel Deza , Mathieu Dutour Sikiric

It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube $[0,k]^3$ is exactly $$ \frac{1}{\sqrt{2(2k^2-4k+5)(2k^2-2k+1)}} $$ for every integer $k$ at least $4$. The proof relies on…

Metric Geometry · Mathematics 2025-02-28 Antoine Deza , Zhongyuan Liu , Lionel Pournin

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Number Theory · Mathematics 2022-10-04 Artūras Dubickas , Min Sha

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

For $\partial \Omega$ the boundary of a bounded and connected strongly Lipschitz domain in $\mathbb{R}^{d}$ with $d\geq3$, we prove that any field $f\in L^{2} (\partial \Omega ; \mathbb{R}^{d})$ decomposes, in an unique way, as the sum of…

Analysis of PDEs · Mathematics 2020-09-14 L. Baratchart , C. Gerhards , A. Kegeles

In this paper we state a full classification for Coxeter polytopes in $\mathbb{H}^{n}$ with $n+3$ facets which are non-compact and have precisely one non-simple vertex.

Metric Geometry · Mathematics 2016-02-05 Mike Roberts

We present a geometric approach towards derandomizing the Isolation Lemma by Mulmuley, Vazirani, and Vazirani. In particular, our approach produces a quasi-polynomial family of weights, where each weight is an integer and quasi-polynomially…

Data Structures and Algorithms · Computer Science 2018-05-08 Rohit Gurjar , Thomas Thierauf , Nisheeth K. Vishnoi

We have conducted a thorough theoretical and numerical investigation of the electronic susceptibility, polarizability, plasmons, their damping rates, as well as the static screening in pseudospin-1 Dirac cone materials with a flat band, or…

We introduce the notion of Lorentzian fans, which form a special class of tropical fans that are particularly well-suited for proving Alexandrov-Fenchel type inequalities. To demonstrate the utility of Lorentzian fans, we prove a practical…

Algebraic Geometry · Mathematics 2023-04-27 Dustin Ross

We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices…

Statistical Mechanics · Physics 2015-06-24 F. Y. Wu

The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…

Algebraic Geometry · Mathematics 2023-08-01 Victor V. Batyrev

We study integer programming instances over polytopes P(A,b)={x:Ax<=b} where the constraint matrix A is random, i.e., its entries are i.i.d. Gaussian or, more generally, its rows are i.i.d. from a spherically symmetric distribution. The…

Data Structures and Algorithms · Computer Science 2013-08-27 Karthekeyan Chandrasekaran , Santosh Vempala

The integer point transform $\sigma_{\mathcal P}$ is an important invariant of a rational polytope $\mathcal P$, and here we show that it is a complete invariant. We prove that it is only necessary to evaluate $\sigma_{\mathcal P}$ at one…

Combinatorics · Mathematics 2024-02-14 Sinai Robins

Given an affine algebra $R=K[x_1,\dots,x_n]/I$ over a field $K$, where $I$ is an ideal in the polynomial ring $P=K[x_1,\dots,x_n]$, we examine the task of effectively calculating re-embeddings of $I$, i.e., of presentations $R=P'/I'$ such…

Commutative Algebra · Mathematics 2024-01-19 Martin Kreuzer , Le Ngoc Long , Lorenzo Robbiano

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Combinatorics · Mathematics 2023-07-07 Benjamin Braun , Kaitlin Bruegge

We provide a quiver-theoretic interpretation of certain smooth complete simplicial fans associated to arbitrary finite root systems in recent work of S. Fomin and A. Zelevinsky. The main properties of these fans then become easy…

Representation Theory · Mathematics 2020-12-21 Bethany Marsh , Markus Reineke , Andrei Zelevinsky

We reconsider the geometry of pure and mixed states in a finite quantum system. The rangesof eigenvalues of the density matrices delimit a regular simplex (Hypertetrahedron TN) in any dimension N; the polytope isometry group is the…

Quantum Physics · Physics 2009-11-13 Luis J. Boya , Kuldeep Dixit

We develop a general theory of log spaces, in which one can make sense of the basic notions of logarithmic geometry, in the sense of Fontaine-Illusie-Kato. Many of our general constructions with log spaces are new, even in the algebraic…

Differential Geometry · Mathematics 2015-07-27 W. D. Gillam , Samouil Molcho