Related papers: Cutting sequences in Veech surfaces
We study the integer sequence v_n of numbers of lines in hypersurfaces of degree 2n-3 of P^n, n>1. We prove a number of congruence properties of these numbers of several different types. Furthermore, the asymptotics of the v_n are described…
This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity we derive a…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
We introduce $\mathcal{V}$-polyhedral disjunctive cuts (VPCs) for generating valid inequalities from general disjunctions. Cuts are critical to integer programming solvers, but the benefit from many families is only realized when the cuts…
We derive the equations of chains for path geometries on surfaces by solving the equivalence problem of a related structure: sub-Riemannian geometry of signature $(1,1)$ on a contact 3-manifold. This approach is significantly simpler than…
This paper describes the cutting sequences of geodesic flow on the modular surface H/PSL(2,Z) with respect to the standard fundamental domain F = {z=x+iy: -1/2 <= x <= 1/2 and |z|>=1} of PSL(2,Z). The cutting sequence for a vertical…
Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
The modular curves serve as excellent objects for testing conjectures in arithmetic geometry. They possess a natural geometric definition in contrast with rather nontrivial structure. On the other hand, they are well-studied from the…
We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (V, E), its cycle space is the family of all subsets of E that have even degree at each vertex. We prove that with high probability, sampling the…
We provide an elementary derivation of an orthogonal coordinate system for boundary layers around evolving smooth surfaces and curves based on the signed-distance function. We go beyond previous works on the signed-distance function and…
In this century, a square-tiled translation surface (an origami) is intensively studied as an object with special properties of its translation structure and its $SL(2,\mathbb{R})$-orbit embedded in the moduli space. We generalize this…
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…
The starting point of this paper is the existence of Peano curves, that is, continuous surjections mapping the unit interval onto the unit square. From this fact one can easily construct of a continuous surjection from the real line…
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
Circuit cutting is a technique for simulating large quantum circuits by partitioning them into smaller subcircuits, which can be executed on smaller quantum devices. The results from these subcircuits are then combined in classical…
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…
The dynamics of straight line flows on compact half-translation surfaces (surfaces formed by gluing Euclidean polygons edge-to-edge via translations possibly composed with rotation by $\pi$) has been widely studied due to their connections…
This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…