English
Related papers

Related papers: The rotating normal form of braids is regular

200 papers

The main result of this article is that pure orbifold braid groups fit into an exact sequence $1\rightarrow…

Geometric Topology · Mathematics 2023-05-09 Jonas Flechsig

We solve the normal ordering problem for (A* A)^n where A* (resp. A) are one mode deformed bosonic creation (resp. annihilation) operators satisfying [A,A*]=[N+1]-[N]. The solution generalizes results known for canonical and q-bosons. It…

Quantum Physics · Physics 2009-11-10 P. Blasiak , A. Horzela , K. A. Penson , A. I. Solomon

We give a complete classification to when a finite group of outer automorphisms preserves a bi-order on a non-abelian free group and bi-orderable surface groups. We also give another new criterion for an outer automorphism of $F_n$ induced…

Group Theory · Mathematics 2026-04-24 Jonathan Johnson , Khanh Le

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…

Discrete Mathematics · Computer Science 2015-03-18 Jean-Marc Fédou , Gabriele Fici

We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…

Quantum Physics · Physics 2010-12-30 P. Blasiak

In this short note, we first associate a new simple undirected graph with a given word over an ordered alphabet of $n$-letters. We will call it the Lyndon graph of that word. Then, we introduce the concept of the Lyndon-word representable…

Combinatorics · Mathematics 2022-05-30 Hossein Teimoori Faal

We identify a subclass of the regular commutative languages that is closed under the iterated shuffle, or shuffle closure. In particular, it is regularity-preserving on this subclass. This subclass contains the commutative group languages…

Formal Languages and Automata Theory · Computer Science 2021-08-19 Stefan Hoffmann

We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…

Combinatorics · Mathematics 2022-04-12 Joseph Johnson , Ricky Ini Liu

Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…

Formal Languages and Automata Theory · Computer Science 2025-04-16 Verónica Becher , Simon Lew Deveali , Ignacio Mollo Cunningham

We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target…

Formal Languages and Automata Theory · Computer Science 2020-04-29 Pierre Marcus , Ilkka Törmä

It is formally constructed a normal form for a class of real-formal surfaces defined near a CR Singularity.

Complex Variables · Mathematics 2021-01-28 Valentin Burcea

We study algebraic isomonodromic deformations of flat logarithmic connections on the Riemann sphere with $n\geq 4$ poles, for arbitrary rank. We introduce a natural property of algebraizability for the germ of universal deformation of such…

Algebraic Geometry · Mathematics 2016-03-01 Gaël Cousin

This paper represents a first attempt at unifying two promising models that attempt to explain the origin of the internal symmetries of leptons and quarks. It is shown that each of the four normed division algebras over the reals admits a…

General Physics · Physics 2018-07-04 Niels G. Gresnigt

The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…

Logic in Computer Science · Computer Science 2022-03-14 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Thomas Zeume

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

Group Theory · Mathematics 2007-05-23 Mark Kambites

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

Combinatorics · Mathematics 2009-09-21 Daniel Appel

In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from - lower and upper bounds on growth rate; in particular boundedness, - images, - regularity (recognizability by a…

Formal Languages and Automata Theory · Computer Science 2022-02-02 Daniel Krenn , Jeffrey Shallit

In this paper we adapt the method of [P. H. Baptistelli, M. Manoel and I. O. Zeli. Normal form theory for reversible equivariant vector fields. Bull. Braz. Math. Soc., New Series 47 (2016), no. 3, 935-954] to obtain normal forms of a class…

Dynamical Systems · Mathematics 2017-02-16 P. H. Baptistelli , M. Manoel , I. O. Zeli

We state a conjecture about centralizers of certain roots of central elements in braid groups, and check it for Artin braid groups and some other cases. Our proof makes use of results by Birman-Ko-Lee; we give a new intrinsic account of…

Group Theory · Mathematics 2007-05-23 David Bessis , Francois Digne , Jean Michel

We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…

Formal Languages and Automata Theory · Computer Science 2024-11-15 Jorge Almeida , Manfred Kufleitner , Jan Philipp Wächter
‹ Prev 1 4 5 6 7 8 10 Next ›