Related papers: Principally Box-integer Polyhedra and Equimodular …
An n-dimensional polytope P^n is called simple if exactly n codimension-one faces meet at each vertex. The lattice of faces of a simple polytope P^n with m codimension-one faces defines an arrangement of even-dimensional planes in R^{2m}.…
An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…
Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…
An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant. The cone of copositive matrices strictly contains the cone of completely positive matrices, i.e., all matrices of the…
The nonlinear integral equation P(x)=\int_alpha^beta dy w(y) P(y) P(x+y) is investigated. It is shown that for a given function w(x) the equation admits an infinite set of polynomial solutions P(x). For polynomial solutions, this nonlinear…
A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…
For $O$ an imaginary quadratic ring, we compute a fundamental polyhedron of $\text{PE}_2(O)$, the projective elementary subgroup of $\text{PSL}_2(O)$. This allows for new, simplified proofs of theorems of Cohn, Nica, Fine, and Frohman.…
Given an integral polyhedron P and a rational polyhedron Q living in the same n-dimensional space and containing the same integer points as P, we investigate how many iterations of the Chv\'atal-Gomory closure operator have to be performed…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Let $P$ be a simple polytope of dimension $n$ with $m$ facets. In this paper we pay our attention on those elementary symmetric polynomials in the Stanley--Reisner face ring of $P$ and study how the decomposability of the $n$-th elementary…
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…
A polytope $P$ is circumscribed about a convex body $\Phi\subset \mathbb{R}^n$ if $\Phi\subset P$ and each facet of $P$ is contained in a support hyperplane of $\Phi$. We say that a convex body $\Phi\subset \mathbb{R}^n$ is a rotor of a…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
We study convex polyhedra in $\mathbb{R}\mathbb{P}^3$ with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be…
For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is a certain integral polytope in $\mathbb{R}^m$, which can be defined as the convex hull of the vectors from $\{0,1,\ldots,n\}^m$ whose nonzero entries are…
The image and the inverse image of a polyhedron under a linear transformation are polyhedrons.
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
Given a polytope P in $\mathbb{R}^n$, we say that P has a positive semidefinite lift (psd lift) of size d if one can express P as the linear projection of an affine slice of the positive semidefinite cone $\mathbf{S}^d_+$. If a polytope P…