Related papers: Burrows-Wheeler transformations and de Bruijn word…
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…
Nielsen transformations form the basis of a simple and widely used procedure for solving word equations. We make progress on the problem of determining when this procedure terminates in the presence of length constraints. To do this, we…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
In this note, we describe an interpretation of the (continuous) Fourier transform from the perspective of the Chinese Remainder Theorem. Some related issues, including a new derivation of Poisson summation formula, are discussed.
Human language can be described as a complex network of linked words. In such a treatment, each distinct word in language is a vertex of this web, and neighboring words in sentences are connected by edges. It was recently found (Ferrer and…
We introduce a new family of temporal logics designed to finely balance the trade-off between expressivity and complexity. Their key feature is the possibility of defining operators of a new kind that we call transformation operators. Some…
Let $\mathcal A\subseteq \mat$ be a unital $*$-subalgebra of the algebra $\mat$ of all $n\times n$ complex matrices and let $B$ be an hermitian matrix. Let $\U_n(B)$ denote the unitary orbit of $B$ in $\mat$ and let $\mathcal E_\mathcal A$…
The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…
This paper is devoted to the proof of a structural theorem, concerning certain homomorphic images of Artin braid group on $n$ strands in finite symmetric groups. It is shown that any one of these permutation groups is an extension of the…
An m-endomorphism of a free semigroup is an endomorphism that sends every generator to a word of length at most m. Two m-endomorphisms are combinatorially equivalent if they are conjugate under an automorphism of the semigroup. In this…
Berget and Rhoades asked whether the permutation representation obtained by the action of $S_{n-1}$ on parking functions of length $n-1$ can be extended to a permutation action of $S_{n}$. We answer this question in the affirmative. We…
The concept of extended Hamiltonian systems allows the geometrical interpretation of several integrable and superintegrable systems with polynomial first integrals of degree depending on a rational parameter. Until now, the procedure of…
A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. Word-representable graphs generalize several important classes of graphs such…
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
Chiral fermions can be embedded into Souriau's massless spinning particle model by "enslaving" the spin, viewed as a gauge constraint. The latter is not invariant under Lorentz boosts; spin enslavement can be restored, however, by a…
We find the two-variables generating function for the statistic which counts the number of variations in a word bounded by $1$. Thus, we refine and extend previous results concerning staircase words, which are words in which the variation…
We consider the problem of extending an acyclic binary relation that is invariant under a given family of transformations into an invariant preference. We show that when a family of transformations is commutative, every acyclic invariant…
We investigate Moufang loops which can be written as the semidirect product of a loop and a group. We also examine a particular class of loop extensions which arise as a result of a finite cyclic group acting as a group of semiautomorphisms…
We investigate the question as to when the members of a finite regular semigroup may be permuted in such a way that each member is mapped to one of its inverses. In general this is not possible. However we reformulate the problem in terms…
The meaning of a sentence is a function of the relations that hold between its words. We instantiate this relational view of semantics in a series of neural models based on variants of relation networks (RNs) which represent a set of…