Related papers: Maximal admissible faces and asymptotic bounds for…

We characterize the extreme points of the set of incentive-compatible mechanisms for screening problems with linear utility. Our framework subsumes problems with and without transfers, such as monopoly pricing, principal-optimal bilateral…

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$.…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. Based on this condition, we characterize the problem…

We give a bound, linear in the complexity of the surface, on the asymptotic dimension of the curve complex as well as the capacity dimension of the ending lamination space.

We study touching cones of a (not necessarily closed) convex set in a finitedimensional real Euclidean vector space and we draw relationships to other concepts in Convex Geometry. Exposed faces correspond to normal cones by an antitone…

Admissible vectors for unitary representations of locally compact groups are the basis for group-frame and covariant coherent state expansions. Main tools in the study of admissible vectors have been Plancherel and central integral…

We investigate on the existence of smooth complete hypersurface with prescribed Weingarten curvature and asymptotic boundary at infinity in hyperbolic space under the assumption that there exists an asymptotic subsolution. We give an…

We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}*a*f), where n is the number of vertices, m is the number of facets, a is the number of…

In (the surface of) a convex polytope P^3 in R^4, an area-minimizing surface avoids the vertices of P and crosses the edges orthogonally. In a smooth Riemannian manifold M with a group of isometries G, an area-minimizing G-invariant…

We evaluate priors by the second order asymptotic behavior of the corresponding estimators.Under certain regularity conditions, the risk differences between efficient estimators of parameters taking values in a domain D, an open connected…

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

The existence of a smooth complete strictly locally convex hypersurface with prescribed scalar curvature and asymptotic boundary at infinity in $\mathbb{H}^{3}$ is proved under the assumption that there exists a strictly locally convex…

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine…

We consider the natural problem of counting isotopy classes of essential surfaces in 3-manifolds, focusing on closed essential surfaces in a broad class of hyperbolic 3-manifolds. Our main result is that the count of (possibly disconnected)…

In this paper, we consider a problem of counting multiplicities. We fix a counting function of multiplicity of rational points in a hypersurface of a projective space over a finite field, and we give an upper bound for the sum with respect…

A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change…