Related papers: Indecomposability of 0/1-polytopes

We establish an upper bound on the number of real multiquadratic fields that admit a universal quadratic lattice of a given rank, or contain a given amount of indecomposable elements modulo totally positive units, obtaining density zero…

David Gabai showed that disk decomposable knot and link complements carry taut foliations of depth one. In an arbitrary sutured 3-manifold M, such foliations F, if they exist at all, are determined up to isotopy by an associated ray [F]…

A complete classification is established of Minkowski valuations on lattice polytopes that intertwine the special linear group over the integers and are translation invariant. In the contravariant case, the only such valuations are…

The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…

We discuss here geometric structures of condensed matters by means of a fundamental topological method. Any geometric pattern can be universally represented by a decomposition space of a topological space consisting of the infinite product…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

We give some necessary conditions for maximality of $0/1$-determinant. Let ${\bf M}$ be a nondegenerate $0/1$-matrix of order $n$. Denote by $\bf A$ the matrix of order $n+1$ which appears from ${\bf M}$ after adding the $(n+1)$th row…

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

For each positive integer $d$, we prove a uniform $l^2$-decoupling inequality for the collection of all polynomials phases of degree at most $d$. Our result is intimately related to \cite{MR4078083}, but we use a different partition that is…

We provide necessary and sufficient conditions on the characteristics of an infinitely divisible distribution under which its characteristic function $\phi$ decays polynomially. Under a mild regularity condition this polynomial decay is…

We consider the entire characteristic functions of order 2 and we prove some decomposition theorems in a multidimensional case. We show that the lack of zeros of the density function is a necessary but not a sufficient (as in the…

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…

In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…

We provide two examples of complex homogeneous quadratic polynomials P on Banach spaces of the form l_1(I). The first polynomial P has both separable and nonseparable maximal zero subspaces. The second polynomial P has the property that…

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

By using the 3+1 point of view and parametrized Minkowski theories we develop the theory of {\it non-inertial} frames in Minkowski space-time. The transition from a non-inertial frame to another one is a gauge transformation connecting the…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the…