English
Related papers

Related papers: Indecomposability of 0/1-polytopes

200 papers

Let $\mathbb{F}$ be a finite field of odd characteristic. When $|\mathbb{F}|\ge 5$, we prove that every matrix $A$ admits a decomposition into $D+M$ where $D$ is diagonalizable and $M^2=0$. For $\mathbb{F}=\mathbb{F}_3$, we show that such…

Rings and Algebras · Mathematics 2026-04-20 Peter Danchev , Esther García , Miguel Gómez Lozano

We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

Optimization and Control · Mathematics 2015-03-18 Yuri Faenza , Laura Sanità

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Classical Analysis and ODEs · Mathematics 2018-03-08 José Ginés Espín Buendía , Víctor Jiménez López

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel

Recent progress on flow polytopes indicates many interesting families with product formulas for their volume. These product formulas are all proved using analytic techniques. Our work breaks from this pattern. We define a family of closely…

Combinatorics · Mathematics 2017-07-12 Karola Mészáros , Connor Simpson , Zoe Wellner

For each $d\geq 0$, we prove decoupling inequalities in $\mathbb R^3$ for the graphs of all bivariate polynomials of degree at most $d$ with bounded coefficients, with the decoupling constant depending uniformly in $d$ but not the…

Classical Analysis and ODEs · Mathematics 2024-11-01 Jianhui Li , Tongou Yang

Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…

Algebraic Geometry · Mathematics 2024-12-20 Chatchai Noytaptim , Xiao Zhong

We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero…

Symbolic Computation · Computer Science 2015-03-17 Yinglin Li , Bican Xia , Zhihai Zhang

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

Commutative Algebra · Mathematics 2019-02-20 Thomas Kahle , Ezra Miller , Christopher O'Neill

It has been shown that the Cartan subalgebra of $W_{\infty}$- algebra is the space of the two-variable, definite-parity polynomials. Explicit expressions of these polynomials, and their basic properties are presented. Also has been shown…

Quantum Physics · Physics 2009-10-30 A. Verçin

It is known that every lattice polytope is unimodularly equivalent to a face of some reflexive polytope. A stronger question is to ask whether every $(0,1)$-polytope is unimodularly equivalent to a facet of some reflexive polytope. A large…

Combinatorics · Mathematics 2020-09-08 Takahiro Nagaoka , Akiyoshi Tsuchiya

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

Combinatorics · Mathematics 2018-02-16 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

Algebraic Geometry · Mathematics 2021-03-31 Joachim von zur Gathen , Guillermo Matera

Polytopes in R^n with integral vertices form a monoid under the Minkowski sum, and the Grothendieck construction gives rise to a group. We show that every symmetric polytope is a norm in this group for every n.

Geometric Topology · Mathematics 2015-12-22 Jae Choon Cha , Stefan Friedl , Florian Funke

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

Alcoved polytopes are characterized by the property that all facet normal directions are parallel to the roots $e_i-e_j$. Unlike other prominent families of polytopes, like generalized permutahedra, alcoved polytopes are not closed under…

Combinatorics · Mathematics 2025-11-05 Nick Early , Lukas Kühne , Leonid Monin

The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…

Representation Theory · Mathematics 2014-10-21 Eugenio Giannelli , Mark Wildon

First we give here a simple proof of a remarkable result of Videnskii and Shirokov: let $B$ be a Blaschke product with $n$ zeros, then there exists an outer function $\phi, \phi(0)=1$, such that $\|(B\phi)'\| \leq C n$, where $C$ is an…

Functional Analysis · Mathematics 2016-09-07 F. Peherstorfer , A. Volberg , P. Yuditskii

Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…

Combinatorics · Mathematics 2020-09-30 María Jesús de la Puente , Pedro Luis Clavería

In this article we prove that the adjoint polynomial of arbitrary convex polytopes is up to scaling uniquely determined by vanishing to the right order on the polytopes residual arrangement. This answers a problem posed by Kohn and Ranestad…

Combinatorics · Mathematics 2025-11-18 Clemens Brüser , Julian Weigert