Related papers: An algorithmic approach to Rupert's problem

Given a prime $p$, the $p$-adic Littlewood Conjecture stands as a well-known arithmetic variant of the celebrated Littlewood Conjecture in Diophantine Approximation. In the same way as the latter, it admits a natural function field analogue…

Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

The purpose of this paper is to verify a conjecture of Gross under mild hypothesis: all reduced, separated, and excellent schemes have the resolution property away from a closed subset of codimension at least three. Our technique uses…

Given any two convex polyhedra P and Q, we prove as one of our main results that the surface of P can be reshaped to a homothet of Q by a finite sequence of "tailoring" steps. Each tailoring excises a digon surrounding a single vertex and…

We analyse a polyhedron which contains the convex hull of all Hamiltonian cycles of a given undirected connected cubic graph. Our constructed polyhedron is defined by polynomially-many linear constraints in polynomially-many continuous…

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid -- the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of…

For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so…

This presentation starts with the regular polygons, of course, then with the Platonic and Archimedean solids. The latter ones are whose symmetry groups are transitive on the vertices, and in addition, whose faces are regular polygons (see…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

There is a long standing conjecture in Hamiltonian analysis which claims that there exist at least $n$ geometrically distinct closed characteristics on every compact convex hypersurface in $\R^{2n}$ with $n\ge 2$. Besides many partial…

In this paper we address the celebrated Albert problem for exceptional Jordan algebras (i.e. Albert algebras): Does every Albert division algebra contain a cubic cyclic subfield? We prove that for any Albert division algebra $A$ over a…

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and…

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…

For any prime p, we construct, and simultaneously count, all of the complex Specht modules in a given p-block of the symmetric group which remain irreducible when reduced modulo p. We call the Specht modules with this property p-irreducible…