Related papers: Maximal admissible faces and asymptotic bounds for…

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Sensitivity analysis of the optimal solution in response surface methodology is studied and an explicit form of the effect of perturbation of the regression coefficients on the optimal solution is obtained. The characterisation of the…

In this paper, we study the exterior problem for the maximal surface equation. We obtain the precise asymptotic behavior of the exterior solution at infinity. And we prove that the exterior Dirichlet problem is uniquely solvable given…

The disk complex of a surface in a 3-manifold is used to define its {\it topological index}. Surfaces with well-defined topological index are shown to generalize well-known classes, such as incompressible, strongly irreducible, and critical…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

To each face $\mathcal{F}$ of the coweight polytope $\mathcal{P}_{\mu}$, we associate a subset $\text{Adm}(\mu)_{\mathcal{F}}$ of the $\mu$-admissible set $\text{Adm}(\mu)$, which we refer to as a face of $\text{Adm}(\mu)$. This gives rise…

In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested…

This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…

This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing…

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

We show the existence of a complete, strictly locally convex hypersurface within $\mathbb{H}^{n+1}$ that adheres to a curvature equation applicable to a broad range of curvature functions. This hypersurface possesses a prescribed asymptotic…

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

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…

We prove an asymptotic formula for the number of integral points of bounded log anticanonical height on a singular quartic del Pezzo surface over arbitrary number fields, with respect to the largest admissible boundary divisor. The…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…