Related papers: A note concerning frames and geometric inequalitie…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We consider a quantity that measures the roundness of a bounded, convex $d$-polytope in $\mathbb{R}^d$. We majorise this quantity in terms of the smallest singular value of the matrix of outer unit normals to the facets of the polytope.
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…
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…
A multidimensional nonnegative matrix is called polystochastic if the sum of its entries at each line is equal to $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$. In the present…
We classify here combinatorially rigid simple polytopes with three facets more than their dimension.
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection of non-negative integer parameters of…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
The affinely regular polygons in certain planar sets are characterized. It is also shown that the obtained results apply to cyclotomic model sets and, additionally, have consequences in the discrete tomography of these sets.
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
This paper is devoted to a systematic study of certain geometric integral inequalities which arise in continuum combinatorial approaches to $L^p$-improving inequalities for Radon-like transforms over polynomial submanifolds of intermediate…
One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…
We give a complete enumeration of all 2-neighborly $d$-polytopes with $d+9$ and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,10,15}$. In…
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
We introduce topological notions of polytopes and simplexes, the latter being expected to play in p-adically closed fields the role played by real simplexes in the classical results of triangulation of semi-algebraic sets over real closed…