Related papers: Optimizing for the Rupert property
A conforming partition of a rectilinear n-gon P (possibly with holes) is a partition of P into rectangles without using Steiner points (i.e., all corners of all rectangles must lie on the boundary of P). The stabbing number of such a…
We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.
The dynamics of all quadratic Newton maps of rational functions are completely described. The Julia set of such a map is found to be either a Jordan curve or totally disconnected. It is proved that no Newton map with degree at least three…
It has been shown in earlier works that the vertices of Platonic solids are good measurement choices for tests of EPR-steering using isotropically entangled pairs of qubits. Such measurements are regularly spaced, and measurement diversity…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear programs or to leave degenerate vertices while running the…
We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…
We construct a highly-symmetric periodic orbit of eight bodies in three dimensions. In this orbit, each body collides with its three nearest neighbors in a regular periodic fashion. Regularization of the collisions in the orbit is achieved…
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…
We enumerate all spaces obtained by gluing in pairs the faces of the octahedron in an orientation-reversing fashion. Whenever such a gluing gives rise to non-manifold points, we remove small open neighbourhoods of these points, so we…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
In this article we consider an open conjecture about coherently labelling a polyhedron in three dimensions. We exhibit all the forty eight possible coherent labellings of a tetrahedron. We also exhibit that some simplicial polyhedra like…
The real roots of the cubic and quartic polynomials are studied geometrically with the help of their respective Siebeck--Marden--Northshield equilateral triangle and regular tetrahedron. The Vi\`ete trigonometric formulae for the roots of…
The aim of the study presented here was the analysis of packings generated according to random sequential adsorption protocol consisting of identical Platonic and Archimedean solids. The computer simulations performed showed, that the…
In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…
The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…