Related papers: The Three Gap Theorem, Interval Exchange Transform…

For fixed $\alpha \in [0,1]$, consider the set $S_{\alpha,N}$ of dilated squares $\alpha, 4\alpha, 9\alpha, \dots, N^2\alpha \, $ modulo $1$. Rudnick and Sarnak conjectured that for Lebesgue almost all such $\alpha$ the gap-distribution of…

For a natural number $N\geq 2$ and a real $\alpha$ such that $0 < \alpha \leq \sqrt{N}-1$, we define $I_\alpha:=[\alpha,\alpha+1]$ and $I_\alpha^-:=[\alpha,\alpha+1)$ and investigate the continued fraction map $T_\alpha:I_\alpha \to…

We show that for any ergodic Lebesgue measure preserving transformation $f: [0,1) \rightarrow [0,1)$ and any decreasing sequence $\{b_i\}_{i=1}^{\infty}$ of positive real numbers with divergent sum, the set…

Interval translation maps (ITMs) are a non-invertible generalization of interval exchange transformations (IETs). The dynamics of finite type ITMs is similar to IETs, while infinite type ITMs are known to exhibit new interesting effects. In…

A variable line through the centroid G of a triangle divides the triangle into two parts each of whose lengths as a fraction of the perimeter fills a closed interval [m,1-m], with m between 0 and 1/2. We show that the range of m taken over…

Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with…

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

The irregularities of a distribution of $N$ points in the unit interval are often measured with various notions of discrepancy. The discrepancy function can be defined with respect to intervals of the form $[0,t)\subset [0,1)$ or arbitrary…

Interval exchange transformations are typically uniquely ergodic maps and therefore have uniformly distributed orbits. Their degree of uniformity can be measured in terms of the star-discrepancy. Few examples of interval exchange…

We calculate the limiting gap distribution for the fractional parts of log n, where n runs through all positive integers. By rescaling the sequence, the proof quickly reduces to an argument used by Barra and Gaspard in the context of level…

A sharp bound on the number of invariant components of an interval exchange transformation is provided. More precisely, it is proved that the number of periodic components n_per and the number of minimal components n_min of an interval…

The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…

We study the ergodic properties of compositions of interval exchange transformations and rotations. We show that for any interval exchange transformation T, there is a full measure set of \alpha in [0, 1) so that T composed with R_{\alpha}…

We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…

The Farey sequence is the sequence of all rational numbers in the real unit interval, stratified by increasing denominators. A classical result by Hall says that its normalized gap distribution is the same as the distribution of the random…

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

A hypergraph $(V,E)$ is called an interval hypergraph if there exists a linear order $l$ on $V$ such that every edge $e\in E$ is an interval w.r.t. $l$; we also assume that $\{j\}\in E$ for every $j\in V$. Our main result is a de…

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

An interesting characterization of the Fibonacci numbers is that, if we write them as $F_1 = 1$, $F_2 = 2$, $F_3 = 3$, $F_4 = 5, ...$, then every positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. This is…