English
Related papers

Related papers: Characterization of substitution invariant 3iet wo…

200 papers

If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub

We study the group of interval exchange transformations. Let $T$ be an $m$-interval exchange transformation. By the rank of $T$ we mean the dimension of the $\mathbb{Q}$-vector space spanned by the lengths of the exchanged subintervals. We…

Dynamical Systems · Mathematics 2019-10-28 Daniel Bernazzani

Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…

Combinatorics · Mathematics 2010-03-03 Anouk Bergeron-Brlek , Christophe Hohlweg , Mike Zabrocki

Let $T(n)=\left\{\begin{array}{ll}3n+1&(n\hbox{ odd})\frac n2&(n\hbox{ even})\end{array}\right.$ ($n\in\mathbb Z$). We call "the orbit of the integer $n$", the set $$ \mathcal O_n:=\{m\in\mathbb Z\;:\;\exists k\ge0,\ m=T^k(n)\} $$ and we…

Number Theory · Mathematics 2016-11-10 Alain Thomas

An involution on a finite set is a bijection such as I(I(e))=e for all the element of the set. A fixed-point free involution on a finite set is an involution such as I(e)=e for none element of the set. In this article, the fixed-point free…

Data Structures and Algorithms · Computer Science 2010-07-26 Cyril Prissette

Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying…

Combinatorics · Mathematics 2023-06-22 Sylvie Corteel , Megan A. Martinez , Carla D. Savage , Michael Weselcouch

The paper is concerned with the problem of determining a complete set of invariants for output feedback. Using tools from geometric invariant theory it is shown that there exists a quasi-projective variety whose points parameterize the…

Optimization and Control · Mathematics 2007-05-23 M. S. Ravi , Joachim Rosenthal , Uwe Helmke

An infinite word x is said to be quasiperiodic if there exists a finite word q such that x is covered by occurrences of q (such a q is called a quasiperiod of x). Using the notion of derivation, we show that this definition is not…

Dynamical Systems · Mathematics 2007-05-23 Thierry Monteil , Solomon Marcus

We introduce a class of fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words. We conjecture that this class contains all fixed points of primitive morphisms among aperiodic binary generalized…

Combinatorics · Mathematics 2017-01-18 Lubomira Dvorakova , Tereza Velka

We present a new method for computing orbits in the perturbed two-body problem: the position and velocity vectors of the propagated object in Cartesian coordinates are replaced by eight orbital elements, i.e., constants of the unperturbed…

Classical Physics · Physics 2020-03-11 Giulio Baù , Javier Roa

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

N=3 super-Schwarzian and N=(3,0) super-Liouville theories are formulated by the coadjoint orbit method. We study the coadjoint orbit dependence of the respective theories, represented by a superfield b. We show that it is renormalized into…

High Energy Physics - Theory · Physics 2022-12-22 Shogo Aoyama

We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…

Formal Languages and Automata Theory · Computer Science 2018-03-09 Jörg Endrullis , Juhani Karhumäki Jan Willem Klop , Aleksi Saarela

We introduce a definition of admissibility for subintervals in interval exchange transformations. Using this notion, we prove a property of the natural codings of interval exchange transformations, namely that any derived set of a regular…

Discrete Mathematics · Computer Science 2015-02-25 Francesco Dolce , Dominique Perrin

Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…

Rings and Algebras · Mathematics 2024-12-30 Joscha Diehl , Rosa Preiß , Jeremy Reizenstein

A new diffeomorphism invariant of integral homology 3-spheres is defined using a non-abelian 'quaternionic' version of the Seiberg-Witten equations.

Differential Geometry · Mathematics 2014-11-11 Yuhan Lim

We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…

Group Theory · Mathematics 2025-02-21 Nir Gadish

An interval translation map (ITM) is a map $T \colon I \to I$ defined as a piecewise translation on a finite partition of an interval $I$ into $r \ge 2$ subintervals. Unlike classical interval exchange transformations (IETs), the images of…

Dynamical Systems · Mathematics 2026-05-06 Kostiantyn Drach , Leon Staresinic , Sebastian van Strien

We investigate the issue of coordinate redefinition invariance by carefully performing nonlinear transformations in the discretized quantum mechanical path integral. By resorting to hamiltonian path integral methods, we provide the first…

High Energy Physics - Theory · Physics 2009-10-28 K. M. Apfeldorf , C. R. Ordonez

A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$ intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$ into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz for every $1\le…

Dynamical Systems · Mathematics 2020-01-08 Benito Pires