Related papers: Polygons as sections of higher-dimensional polytop…
It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…
We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…
Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the…
We construct new topological invariants of three-dimensional manifolds which can, in particular, distinguish homotopy equivalent lens spaces L(7,1) and L(7,2). The invariants are built on the base of a classical (not quantum) solution of…
We give a few simple methods to geometically describe some polygon and chain-spaces in R^d. They are strong enough to give tables of m-gons and m-chains when m <= 6.
In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…
It is well-known that every polyhedral cone is finitely generated (i.e. polytopal), and vice versa. Surprisingly, the two notions differ almost always for non-commutative versions of such cones. This was obtained as a byproduct in an…
We study a variant of a polygon partition problem, introduced by Chung, Iwama, Liao, and Ahn [ISAAC'25]. Given orthogonal unit vectors $\mathbf{u},\mathbf{v}\in \mathbb{R}^2$ and a polygon $P$ with $n$ vertices, we partition $P$ into…
A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach asked the following question: For n > 3 odd, what is the maximum perimeter…
We use methods of combinatorics of polytopes together with geometrical and computational ones to obtain the complete list of compact hyperbolic Coxeter n-polytopes with n+3 facets, 3<n<8. Combined with results of Esselmann (1994), Andreev…
In this article, we construct an arithmetic hyperbolic $6-$orbifold $\mathcal{O}$ such that, any square-rootable Salem number of degree at most $4$ over $\mathbb{Q}$ is realized as the exponential of the length of a closed geodesic in…
Let us say that an $n$-sided polygon is semi-regular if it is circumscriptible and its angles are all equal but possibly one, which is then larger than the rest. Regular polygons, in particular, are semi-regular. We prove that semi-regular…
We construct a sequence of rank 3 distributions on $n$-dimensional manifolds for any $n\geq 7$ such that the dimension of their symmetry group grows exponentially in $n$ (more precisely it is equal to $\operatorname{Fib}_{n-1}+n+2$, where…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
Motivated by a question from V. Arnold about self-dual curves in projective spaces, we study {\cal M}_{m,n,k}: the moduli space of m-self-dual n-gons in {\mathbb P}^k. This paper lays out an explicit construction of self-dual polygons, and…
For generic $r=(r_1,\ldots,r_n) \in \mathbb{R}^n_+$ the space $\mathcal{M}(r)$ of $n$--gons in $\mathbb{R}^3$ with edges of lengths $r$ is a smooth, symplectic manifold. We investigate its Gromov width and prove that the expression $$2\pi…
The image of a polygonal knot K under a spherical inversion of R^3 (union infinity) is a simple closed curve made of arcs of circles, having the same knot type as the mirror image of K. Suppose we reconnect the vertices of the inverted…
We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…
We show that the polyhedron defined as the convex hull of the lattice points above the hyperbola $\left\{xy = n\right\}$ has between $\Omega(n^{1/3})$ and $O(n^{1/3} \log n)$ vertices. The same bounds apply to any hyperbola with rational…