Related papers: Cyclic polytope of the simplest cubic fields
We introduce a double-folded operator that, upon iterative application, generates a dynamical system with two types of trajectories: a cyclic one and, another that grows endlessly on parabolas. These trajectories produce two distinct…
We consider the symmetries of coincidence site lattices of 3-dimensional cubic lattices. This includes the discussion of the symmetry groups and the Bravais classes of the CSLs. We derive various criteria and necessary conditions for…
A square lattice distribution of coupled oscillators that have heteroclinic cycle attractors is studied. In this system, we find a novel type of patterns that is spatially disordered and periodic in time. These patterns are limit cycle…
A coding lattice $\Lambda_c$ and a shaping lattice $\Lambda_s$ forms a nested lattice code $\mathcal{C}$ if $\Lambda_s \subseteq \Lambda_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This…
We give a geometrical derivation of the Dirac equation by considering a spin-1/2 particle travelling with the speed of light in a cubic spacetime lattice. The mass of the particle acts to flip the multi-component wavefunction at the lattice…
The iterated composition of two operators, both of which are involutions and translation invariant, partitions the set of lattice points in the plane into an infinite sequence of discrete parabolas. Each such parabola contains an associated…
The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres…
Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…
In this paper we study plus-one generated arrangements of conics and lines in the complex projective plane with simple singularities. We provide several degree-wise classification results that allow us to construct explicit examples of such…
This paper (written in Russian) presents a survey of new and earlier results on fine zonotopal tilings (briefly, cubillages) of cyclic zonotopes. The combinatorial theory of these objects is of interest in its own right and also has a…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
We characterize polynomials that are cyclic in Dirichlet-type spaces in the unit ball in $\mathbb C^2$
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
For certain real quadratic fields $K$ with sufficiently small discriminant we produce explicit unit generators for specific ray class fields of $K$ using a numerical method that arose in the study of complete sets of equiangular lines in…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…
The monotone path polytope of a polytope $P$ encapsulates the combinatorial behavior of the shadow vertex rule (a pivot rule used in linear programming) on $P$. Computing monotone path polytopes is the entry door to the larger subject of…
By computing all cyclotomic points on some algebraic varieties, we get an independent and efficient way to find all rational $a^3b$-monotiles for the sphere, thereby completing the classification of edge-to-edge monohedral quadrilateral…
We apply the averaging theory of high order for computing the limit cycles of discontinuous piecewise quadratic and cubic polynomial perturbations of a linear center. These discontinuous piecewise differential systems are formed by two…