Related papers: Symbolic coding for linear trajectories in the reg…
Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
Symbolic codes for rotational orbits and "islands-around-islands" are constructed for the quadratic, area-preserving Henon map. The codes are based upon continuation from an anti-integrable limit, or alternatively from the horseshoe. Given…
Dynamical systems with translational or rotational symmetry arise frequently in studies of spatially extended physical systems, such as Navier-Stokes flows on periodic domains. In these cases, it is natural to express the state of the fluid…
We describe geometric algorithms that generalize the classical continued fraction algorithm for the torus to all translation surfaces in hyperelliptic components of translation surfaces. We show that these algorithms produce all saddle…
This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
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 work we study the acyclic orientations of graphs. We obtain an encoding of the acyclic orientations of the complete $p$-partite graph with size of its parts $n_1,n_2,\ldots,n_p$ via a vector with $p$ symbols and length…
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…
The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…
We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling…
We revisit existing linear computation coding (LCC) algorithms, and introduce a new framework that measures the computational cost of computing multidimensional linear functions, not only in terms of the number of additions, but also with…
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make…
The aim of this paper is to extend the so called slice analysis to a general case in which the codomain is a real vector space of even dimension, i.e. is of the form $\mathbb{R}^{2n}$. We define a cone $\mathcal{W}_\mathcal{C}^d$ in…
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…
Most well-known multidimensional continued fractions, including the M\"{o}nkemeyer map and the triangle map, are generated by repeatedly subdividing triangles. This paper constructs a family of multidimensional continued fractions by…