Related papers: Quasi--Euclidean classification of Alcoved Convex …
In this paper we bring together tropical linear algebra and convex 3-dimensional bodies. We show how certain convex 3-dimensional bodies having 20 vertices and 12 facets can be encoded in a $4\times 4$ integer zero-diagonal matrix $A$. A…
Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
We describe a new sequence of polytopes which characterize A_infinity maps from a topological monoid to an A_infinity space. Therefore each of these polytopes is a quotient of the corresponding multiplihedron. Later term(s) in our sequence…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…
Pogorelov proved in 1949 that every every convex polyhedron has at least three simple closed quasigeodesics. Whereas a geodesic has exactly pi surface angle to either side at each point, a quasigeodesic has at most pi surface angle to…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
We prove that there are thirteen Archimedean/semiregular polyhedra by using Euler's polyhedral formula.
For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
We classify closed, simply-connected, non-negatively curved 6-manifolds of almost maximal symmetry rank up to equivariant diffeomorphism.
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…
We introduce the class of almost symmetric submanifolds of Euclidean space, a close relative of symmetric submanifolds and (contact) sub-Riemannian symmetric spaces. More specifically, we prove that every full irreducible almost symmetric…
The vector space of the tensors $\mathcal F$ of type (0,3) having the same symmetries as the covariant derivative of the fundamental form of an almost contact metric manifold is considered. A scheme of decomposition of $\mathcal F$ into…
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…
In this paper, we study nonmaximal representations of surface groups in PU(2,1). In genus large enough, we show the existence of convex-cocompact representations of non-maximal Toledo invariant admitting a unique equivariant minimal…
A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…