English
Related papers

Related papers: Lyndon word decompositions and pseudo orbits on q-…

200 papers

In a previous paper [FT1], for any logarithmic symplectic pair (X,D) of a symplectic manifold X and a simple normal crossings symplectic divisor D, we introduced the notion of log pseudo-holomorphic curve and proved a compactness theorem…

Symplectic Geometry · Mathematics 2019-10-14 Mohammad Farajzadeh-Tehrani

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

Combinatorics · Mathematics 2021-09-01 Hiêp Hàn , Marcos Kiwi , Matías Pavez-Signé

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived…

Formal Languages and Automata Theory · Computer Science 2010-08-11 Ronny Polley , Ludwig Staiger

This paper addresses a theory of R(p,q)-deformed combinatorics in discrete probability. It mainly focuses on R(p,q)-deformed factorials, binomial coefficients, Vandermonde's formula, Cauchy's formula, binomial and negative binomial…

General Mathematics · Mathematics 2019-06-10 Mahouton Norbert Hounkonnou , Fridolin Melong

Tensor methods have emerged as a powerful paradigm for consistent learning of many latent variable models such as topic models, independent component analysis and dictionary learning. Model parameters are estimated via CP decomposition of…

Machine Learning · Computer Science 2015-06-22 Furong Huang , Animashree Anandkumar

We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…

Formal Languages and Automata Theory · Computer Science 2020-04-03 Štěpán Holub

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Logic in Computer Science · Computer Science 2007-05-23 Thomas Colcombet

The outline of lattice simulations of $(2+1)D$ soliton-propagations in the background of Weyl spinors is presented. Clifford algebra is applied on Luescher's domain decomposition method. The Clifford algebra shows that there are loop parts…

High Energy Physics - Lattice · Physics 2021-07-21 Sadataka Furui

We prove the cone theorem for varieties with LCIQ singularities using deformation theory of stable maps into Deligne-Mumford stacks. We also obtain a sharper bound on $-(K_X+D)$-degree of $(K_X+D)$-negative extremal rays for projective…

Algebraic Geometry · Mathematics 2009-08-20 Jiun-Cheng Chen , Hsian-Hua Tseng

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

Combinatorics · Mathematics 2020-02-11 Tyrrell B. McAllister

We derive color decompositions of arbitrary tree and one-loop QCD amplitudes into color ordered objects called primitive amplitudes. Furthermore, we derive general fermion flip and reversion identities spanning the null space among the…

High Energy Physics - Phenomenology · Physics 2014-05-28 Theodor Schuster

I review progress made in solving gauge theories such as collinear quantum chromodynamics using light-cone Hamiltonian methods. I also show how the light-cone Fock expansion for hadron wavefunctions can be used to compute operator matrix…

High Energy Physics - Phenomenology · Physics 2007-05-23 S. J. Brodsky

In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^\omega$ and $v^\omega$. Informally, we say that we compare $u$ and $v$ by the infinite order. We show several properties of Lyndon…

Discrete Mathematics · Computer Science 2019-04-02 Francesco Dolce , Antonio Restivo , Christophe Reutenauer

A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t). Properties of pseudo-primitive words are investigated in…

Computational Complexity · Computer Science 2010-02-23 Lila Kari , Benoît Masson , Shinnosuke Seki

We discuss various tests of the factorization hypothesis making use of the close relationship between semi-leptonic and factorized nonleptonic decay amplitudes. It is pointed out that factorization leads to truely model-independent…

High Energy Physics - Phenomenology · Physics 2009-10-22 Volker Rieckert

We extend Lax-Phillips' theorem on discreteness of pseudo-cuspforms, in the style of Colin de Verdi{\`e}re's use of the Friedrichs self-adjoint extension of a restriction of the Laplace-Beltrami operator, as opposed to the use of semigroup…

Number Theory · Mathematics 2019-12-02 Iver Walkoe

We obtain a presentation by generators and relations of any Nichols algebra of diagonal type with finite root system. We prove that the defining ideal is finitely generated. The proof is based in Kharchenko's theory of PBW basis of Lyndon…

Quantum Algebra · Mathematics 2010-08-26 Iván Ezequiel Angiono

For any Lie groupoid we construct an analytic index morphism taking values in a modified $K-theory$ group which involves the convolution algebra of compactly supported smooth functions over the groupoid. The construction is performed by…

K-Theory and Homology · Mathematics 2008-03-17 Paulo Carrillo Rouse

We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…

Formal Languages and Automata Theory · Computer Science 2016-06-29 Julien Cassaigne , Gabriele Fici , Marinella Sciortino , Luca Q. Zamboni