Related papers: Space vectors forming rational angles
Given a polynomial or a rational map f we associate to it a space of maps. We introduce local coordinates in this space, which are essentially the set of critical values of the map. Then we consider an arbitrary periodic orbit of f with…
We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…
Kupavskii, Volostnov, and Yarovikov have recently shown that any set of $n$ points in general position in the plane has at least as many (partial) triangulations as the convex $n$-gon. We generalize this in two directions: we show that…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
The paper considers systems of contraction similarities in $\mathbb R^d$ sending a given polyhedron $P$ to polyhedra $P_i\subset P$, whose non-empty intersections are singletons and contain the common vertices of those polyhedra, while the…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
The orbit polytope for a finite group G acting linearly and freely on a sphere S is used to construct a cellularized fundamental domain for the action. A resolution of the integers over G results from the associated G-equivariant…
For a faithful linear representation $V$ of a finite group $G$ in coprime characteristic, we show that if the field Noether number $\beta_{\mathrm{field}}$ is the minimum $d$ such that the invariant polynomials of degree $\leq d$ generate…
We identify thirteen isomorphism classes of indecomposable coisotropic relations between Poisson vector spaces and show that every coisotropic relation between finite-dimensional Poisson vector spaces may be decomposed as a direct sum of…
Generically, the set of points along which two non-singular vector fields on the three-sphere are positively (resp. negatively) collinear form a link. We prove that the two vector fields are homotopic if and only if the linking number of…
Dyadic rationals are rationals whose denominator is a power of 2. A dyadic n-dimensional convex set is defined as the intersection with n-dimensional dyadic space of an n-dimensional real convex set. Such a dyadic convex set is said to be a…
We give a new proof that all external rays of the Mandelbrot set at rational angles land, and of the relation between the external angle of such a ray and the dynamics at the landing point. Our proof is different from the original one,…
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…
The main result of this paper is the following. Given countably many multivariate polynomials with rational coefficients and maximum degree $d$, we construct a compact set $E\subset \R^n$ of Hausdorff dimension $n/d$ which does not contain…
We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…
We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…
The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of…
Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…
A formalism is developed which allows to determine the locations of all local symmetry axes of three-dimensional particles with overall icosahedral symmetry. It relies on the fact that the root system of the non-crystallographic Coxeter…