English
Related papers

Related papers: The rotating normal form of braids is regular

200 papers

In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…

Formal Languages and Automata Theory · Computer Science 2017-05-24 Jie-Meng Zhang , Jin Chen , Yingjun Guo , Zhixiong Wen

We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous…

Formal Languages and Automata Theory · Computer Science 2018-07-10 Nicolás Álvarez , Verónica Becher , Olivier Carton

We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.

Combinatorics · Mathematics 2012-08-15 Blake Madill , Narad Rampersad

In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard…

Group Theory · Mathematics 2013-04-30 Vladimir V. Vershinin

In this work we construct an automaton for the commutative closure of a given regular group language. The number of states of the resulting automaton is bounded by the number of states of the original automaton, raised to the power of the…

Formal Languages and Automata Theory · Computer Science 2020-08-14 Stefan Hoffmann

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Aehlig

We introduce a subclass of the commutative regular languages that is characterized by the property that the state set of the minimal deterministic automaton can be written as a certain Cartesian product. This class behaves much better with…

Formal Languages and Automata Theory · Computer Science 2021-11-29 Stefan Hoffmann

A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon…

Quantum Physics · Physics 2017-08-23 Allan I. Solomon , Gerard Duchamp , Pawel Blasiak , Andrzej Horzela , Karol A. Penson

Let $q$ be an odd prime power and $D$ be the set of monic irreducible polynomials in $\mathbb F_q[x]$ which can be written as a composition of monic degree two polynomials. In this paper we prove that $D$ has a natural regular structure by…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

Formal Languages and Automata Theory · Computer Science 2024-03-13 Maximilian Kotowsky , Jan Philipp Wächter

For each integer $n\ge 1$, after fixing a proper complexity function on the braid group $\B_{2n}$, we use the Dehornoy order to define a strict total order on the set \[ \mathcal P_{2n}=H_{2n}\backslash \B_{2n}/H_{2n} \] of $2n$--plat…

Geometric Topology · Mathematics 2026-04-10 Makoto Ozawa

Dehn twists around simple closed curves in oriented surfaces satisfy the braid relations. This gives rise to a group theoretic from the braid group to the mapping class group. We prove here that this map is trivial in stable homology with…

Algebraic Topology · Mathematics 2007-05-23 Yongjin Song , Ulrike Tillmann

We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regularity for such functions has been defined using two-way…

Formal Languages and Automata Theory · Computer Science 2014-02-14 Rajeev Alur , Adam Freilich , Mukund Raghothaman

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

Group Theory · Mathematics 2012-02-21 V. V. Vershinin

We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$. We show that the languages accepted by…

Formal Languages and Automata Theory · Computer Science 2019-03-11 Oscar H. Ibarra , Ian McQuillan , Bala Ravikumar

We show that for any given n, there exists a sequence of words a_k in the generators sigma_1, ... sigma_{n-1} of the braid group B_n, representing the identity element of B_n, such that the number of braid relations of the form sigma_i…

Group Theory · Mathematics 2009-06-02 Joel Hass , Arkadius Kalka , Tahl Nowik

We reconsider the classical problem of the continuation of degenerate periodic orbits in Hamiltonian systems. In particular we focus on periodic orbits that arise from the breaking of a completely resonant maximal torus. We here propose a…

Dynamical Systems · Mathematics 2018-03-14 Tiziano Penati , Marco Sansottera , Veronica Danesi

The normal ordering formulae for powers of the boson number operator $\hat{n}$ are extended to deformed bosons. It is found that for the `M-type' deformed bosons, which satisfy $a a^{\dagger} - q a^{\dagger} a = 1$, the extension involves a…

Mathematical Physics · Physics 2009-10-31 Jacob Katriel , Maurice Kibler

We obtain a parametric normal form for any non-degenerate perturbation of the generalized saddle-node case of Bogdanov--Takens singularity. Explicit formulas are derived and greatly simplified for an efficient implementation in any computer…

Dynamical Systems · Mathematics 2014-12-25 Majid Gazor , Mojtaba Moazeni

We define orbifold mapping class groups (with marked points) and study them using their action on certain orbifold analogs of arcs and simple closed curves. Moreover, we establish a Birman exact sequence for suitable subgroups of orbifold…

Geometric Topology · Mathematics 2023-05-09 Jonas Flechsig
‹ Prev 1 3 4 5 6 7 10 Next ›