Related papers: One Hundred and Twelve Point Three Degree Theorem
A special case of a conjecture by Thomass\'e is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexample exists, we present reductions and establish bounds on…
We study periodic infinite billiards in the plane. We show that for rational models, some particular obstacles can be added periodically, so that the billiard flow in the resulting table is recurrent in almost every direction.
In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least half the number of undirected paths between them (rounded…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…
In this experimental work we study billiard trajectories in triangular pyramids and try to establish conditions that guarantee the existence (or absence) of 4-cycles (there can be not more, than three of them). We formulate conjectures and…
We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
We consider classical dynamical properties of a particle in a constant gravitational force and making specular reflections with circular, elliptic or oval boundaries. The model and collision map are described and a detailed study of the…
A rational triangle $T$ (one whose angles are rational multiples of $\pi$) unfolds to a translation surface $(X_T,\omega_T)$. The lattice triangle problem asks to classify those $T$ for which $(X_T,\omega_T)$ is a Veech (lattice) surface,…
We introduce a new equivalence relation on the set of all polygonal billiards. We say that two billiards (or polygons) are order equivalent if each of the billiards has an orbit whose footpoints are dense in the boundary and the two…
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…
We show that a randomly perturbed digraph, where we start with a dense digraph $D_\alpha$ and add a small number of random edges to it, will typically contain a fixed orientation of a bounded degree spanning tree. This answers a question…
Yet another example where "physical" (i.e. only checking finitely many special cases) gives a fully rigorous proof, notwithstanding what your "Intro To Proofs" prof told you!
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz [12],…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
In this paper we study the dynamical billiards on a convex 2D sphere. We investigate some generic properties of the convex billiards on a general convex sphere. We prove that $C^\infty$ generically, every periodic point is either hyperbolic…
We examine the possible trajectories of a classical particle, trapped in a two-dimensional infinite rectangular well, using the Hamilton-Jacobi equation. We observe that three types of trajectories are possible: periodic orbits, open orbits…
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
The periodic orbit conjecture states that, on closed manifolds, the set of lengths of the orbits of a non-vanishing vector field all whose orbits are closed admits an upper bound. This conjecture is known to be false in general due to a…