Related papers: Rotation Remainders
We determine the homological residue fields, in the sense of tensor-triangular geometry, in a series of concrete examples ranging from topological stable homotopy theory to modular representation theory of finite groups.
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
In this paper the authors prove fundamental decomposition theorems pertaining to the internal structure of monoidal triangulated categories (M$\Delta$Cs). The tensor structure of an M$\Delta$C enables one to view these categories like…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…
We consider a family of piecewise contractions admitting a rotation number and defined for every $x\in[0,1)$ by $f(x)=\lambda x + \delta + d \theta_a(x) \pmod 1$, where $\lambda\in(0,1)$, $d\in(0,1-\lambda)$, $\delta\in[0,1]$, $a\in[0,1]$…
A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…
We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on a line segment, a…
We investigate the rotation sets of billiards on the $m$-dimensional torus with one small convex obstacle and in the square with one small convex obstacle. In the first case the displacement function, whose averages we consider, measures…
Consider a finite positive integer. If it is even, divide it by 2, and if it is odd, multiply it by 3 and add 1. This will give you a new integer. Following the procedure for the new integer, you will receive another integer. Repeat the…
We study the random rotation number for random circle homeomorphisms. We introduce two new definitions of the random rotation number that can be stated without reference to any choice of lift of the dynamics to the real line, and prove that…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
Let $d\ge 1$ be an integer and ${\bf r}=(r_0,\dots,r_{d-1}) \in \mathbf{R}^d$. The {\em shift radix system} $\tau_\mathbf{r}: \mathbb{Z}^d \to \mathbb{Z}^d$ is defined by $$ \tau_{{\bf r}}({\bf z})=(z_1,\dots,z_{d-1},-\lfloor {\bf r} {\bf…
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We study the properties of rotation numbers for some groups of piecewise linear homeomorphisms of the circle. We use these properties to obtain results on PL rigidity, non isomorphicity, non exoticity of automorphisms, non smoothability for…
We study the classical dynamics of spinning particles using scattering amplitudes and eikonal exponentiation. We show that observables are determined by a simple algorithm. A wealth of complexity arises in perturbation theory as positions,…
Research on the distribution of prime numbers has revealed a dual character: deterministic in definition yet exhibiting statistical behavior reminiscent of random processes. In this paper we show that it is possible to use an image-focused…
We describe recurring patterns of numbers that survive each wave of the Sieve of Eratosthenes, including symmetries, uniform subdivisions, and quantifiable, predictive cycles that characterize their distribution across the number line. We…
Rotation representations are foundational in fields such as computer graphics, robotics, and machine learning, where precise and efficient modeling of 3D orientations is critical. This paper comprehensively investigates diverse…
Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…