Related papers: Burrows-Wheeler transformations and de Bruijn word…
Continuous word representations learned separately on distinct languages can be aligned so that their words become comparable in a common space. Existing works typically solve a least-square regression problem to learn a rotation aligning a…
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian…
Certain criteria are demonstrated for a spatial derivation of a von Neumann algebra to generate a one-parameter semigroup of endomorphisms of that algebra. These are then used to establish a converse to recent results of Borchers and of…
A de Bruijn torus is the two dimensional generalization of a de Bruijn sequence. While some methods exist to generate these tori, only a few methods of construction are known. We present a novel method to generate de Bruijn tori with…
Why do some languages like Czech permit free word order, while others like English do not? We address this question by pretraining transformer language models on a spectrum of synthetic word-order variants of natural languages. We observe…
Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…
We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…
Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of…
We develop a general theory of intertwined diffusion processes of any dimension. Our main result gives an SDE construction of intertwinings of diffusion processes and shows that they correspond to nonnegative solutions of hyperbolic partial…
In this paper we introduce a particular semigroup transform $\mathcal{A}$ that fixes the invariants involved in Wilf's conjecture, except the embedding dimension. It also allows one to arrange the set of not ordinary and not irreducible…
We discuss several PT-symmetric deformations of superderivatives. Based on these various possibilities, we propose new families of complex PT-symmetric deformations of the supersymmetric Korteweg-de Vries equation. Some of these new models…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
There is a well-known combinatorial definition, based on ordered set partitions, of the semigroup of faces of the braid arrangement. We generalize this definition to obtain a semigroup Sigma_n^G associated with G wr S_n, the wreath product…
We generalize Axel Thue's familiar definition of overlaps in words, and show that there are no infinite words containing split occurrences of these generalized overlaps. Along the way we prove a useful theorem about repeated disjoint…
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…
Word ordering is a constrained language generation task taking unordered words as input. Existing work uses linear models and neural networks for the task, yet pre-trained language models have not been studied in word ordering, let alone…
One delivers here the extended Bernoulli and Taylor formula of a new sort with the rest term of the Cauchy type recently derived by the author in the case of the so called $\psi$-difference calculus which constitutes the representative for…
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…
We construct unital extensions of the higher order peak algebras defined by Krob and the third author in [Ann. Comb. 9 (2005), 411--430.], and show that they can be obtained as homomorphic images of certain subalgebras of the…