Related papers: Realizability and inscribability for simplicial po…

In this article we construct closed, isospectral, non-isometric locally symmetric manifolds. We have three main results. First, we construct arbitrarily large sets of closed, isospectral, non-isometric manifolds. Second, we show the growth…

We construct, for $m\geq 6$ and $2n\leq m$, closed manifolds $M^{m}$ with finite nonzero $\varphi(M^{m},S^{n}$), where $\varphi(M,N)$ denotes the minimum number of critical points of a smooth map $M\to N$. We also give some explicit…

This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…

This paper presents a novel algorithm for reachability analysis of nonlinear discrete-time systems. The proposed method combines constrained zonotopes (CZs) with polyhedral relaxations of factorable representations of nonlinear functions to…

The result of Padrol asserts that for every $d\geq 4$, there exist $2^{\Omega(n\log n)}$ distinct combinatorial types of $\lfloor d/2\rfloor$-neighborly simplicial $(d-1)$-spheres with $n$ vertices. We present a construction showing that…

In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the…

We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…

Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…

We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such…

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

An invariant of orientable 3-manifolds is defined by taking the minimum $n$ such that a given 3-manifold embeds in the connected sum of $n$ copies of $S^2 \times S^2$, and we call this $n$ the embedding number of the 3-manifold. We give…

While several classes of integer linear optimization problems are known to be solvable in polynomial time, far fewer tractability results exist for integer nonlinear optimization. In this work, we narrow this gap by identifying a broad…

We introduce the notion of locally consistent system of half-spaces for a real hyperplane arrangement. We embed a sphere in the complexified complement by shifting the real unit sphere into the imaginary direction indicated by the…

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…