Related papers: Lyndon word decompositions and pseudo orbits on q-…
In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known…
In this paper we initiate a new approach to studying approximations by rational points to points on smooth submanifolds of $\mathbb{R}^n$. Our main result is a convergence Khintchine type theorem for arbitrary nondegenerate submanifolds of…
We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter [Algorithmica 1995] and, using arguments based on Lyndon words, derive a more general variant which considers three overlapping squares which do not necessarily share a…
The main theme of the paper is the dynamics of Hamiltonian diffeomorphisms of ${\mathbb C}{\mathbb P}^n$ with the minimal possible number of periodic points (equal to $n+1$ by Arnold's conjecture), called here Hamiltonian pseudo-rotations.…
We compute the motivic nearby cycles of functions obtained by composition with a polynomial which is non-degenerate with respect to its Newton polyhedron. Our result involves new convolution operators and generalized nearby cycles.
The soft theorem states that scattering amplitude in gauge theory with a soft gauge-boson emission can be factorized into a hard scattering amplitude and a soft factor. In this paper, we present calculations of the soft factor for processes…
We define a q-deformation of the Dirac operator, inspired by the one dimensional q-derivative. This implies a q-deformation of the partial derivatives. By taking the square of this Dirac operator we find a q-deformation of the Laplace…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
In 1857 Sylvester established an elegant theory that certain counting functions (which he termed denumerants) are quasi-polynomials by decomposing them into periodic and non-periodic parts. Each component of the decomposition, called a…
Given a pseudoword over suitable pseudovarieties, we associate to it a labeled linear order determined by the factorizations of the pseudoword. We show that, in the case of the pseudovariety of aperiodic finite semigroups, the pseudoword…
We propose a novel approach to learn word embeddings based on an extended version of the distributional hypothesis. Our model derives word embedding vectors using the etymological composition of words, rather than the context in which they…
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the \emph{well distributed occurrences} (WELLDOC)…
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…
We have examined the deformation of a generic non-Abelian gauge theory obtained by replacing its Lie group by the corresponding quantum group. This deformed gauge theory has more degrees of freedom than the theory from which it is derived.…
We discuss a consequence of Green and Tao's factorisation theorem for polynomial orbits on nilmanifolds, adjusted to the requirements of certain arithmetic applications. More precisely, we prove a generalisation of Theorem 16.4, Acta Arith.…
Let $\A$ be a finite non-empty set and $\preceq $ a total order on $\A^\nats$ verifying the following lexicographic like condition: For each $n\in \nats$ and $u, v\in \A^n,$ if $u^\omega \prec v^\omega$ then $ux\prec vy$ for all $x, y \in…
We develop chiral perturbation theory for baryons in quenched QCD. Quenching (the elimination of diagrams containing virtual quark loops) is achieved by extending the Lagrangian method of Bernard and Golterman, and is implemented in a…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…