The plaid model and outer billiards on kites

Richard Evan Schwartz

Home/Archive/arXiv

arXiv · 1511.09091

The plaid model and outer billiards on kites

Richard Evan Schwartz

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is the third in a series which explores a combinatorial method for generating lattice polygons in the plane. I call this method the plaid model. In this paper I prove the main result I had been aiming for since the beginning, which is to show that there is a coarse isomorphism between the plaid model and the so-called arithmetic graph for outer billiards on kites. The content of the theorem is that the plaid model predicts the symbolic dynamics of the outer billiards orbits, up to an error of one unit. This result combines with the work in the other papers to give a second proof that outer billiards has unbounded orbits for every irrational kite. So far, these are the only known polygonal examples with this property.

Explore related subjects

math.DS math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Richard Evan Schwartz. 2015-11-29. The plaid model and outer billiards on kites. https://arxiv.org/abs/1511.09091

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗

arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗

arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗