Related papers: Maximal admissible faces and asymptotic bounds for…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
Motivated by the search for reduced polytopes, we consider the following question: For which polytopes exists a vertex-facet assignment, that is, a matching between vertices and non-incident facets, so that the matching covers either all…
We prove an asymptotic formula for the average number of rational points on Fano hypersurfaces that are contained in a small ball centered at a given adelic point. We also prove an asymptotic formula for the number of hypersurfaces…
Let $M$ be a Hadamard manifold with curvature bounded above by a negative constant $-\alpha$, satisfying the "strict convexity condition", and assume that $M$ admits a "helicoidal" one-parameter subgroup $G$ of isometries of $M$. Then,…
We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
Andrews plots provide aesthetically pleasant visualizations of high-dimensional datasets. This work proves that Andrews plots (when defined in terms of the principal component scores of a dataset) are optimally ``smooth'' on average, and…
The 2-parameter family of certain homogeneous Lorentzian 3-manifolds which includes Minkowski 3-space and anti-de Sitter 3-space is considered. Each homogeneous Lorentzian 3-manifold in the 2-parameter family has a solvable Lie group…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…
We investigate a class of composite nonconvex functions, where the outer function is the sum of univariate extended-real-valued convex functions and the inner function is the limit of difference-of-convex functions. A notable feature of…
Incompressibility is established for three-dimensional and two-dimensional deformations of an anisotropic linearly elastic material, as conditions to be satisfied by the elastic compliances. These conditions make it straightforward to…
We evaluate the mean square limit of exponential sums related with a rational ellipsoid, extending a work of Marklof. Moreover, as a result of it, we study the asymptotic values of the normalized deviations of the number of lattice points…
The enumeration of normal surfaces is a crucial but very slow operation in algorithmic 3-manifold topology. At the heart of this operation is a polytope vertex enumeration in a high-dimensional space (standard coordinates). Tollefson's…
We study the problem of asymptotic consensus as it occurs in a wide range of applications in both man-made and natural systems. In particular, we study systems with directed communication graphs that may change over time. We recently…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure…
This article exhibits a 4-dimensional combinatorial polytope that has no antiprism, answering a question posed by Bernt Lindst\"om. As a consequence, any realization of this combinatorial polytope has a face that it cannot rest upon without…
This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…