Related papers: Injective envelopes of transition systems and Ferr…
We investigate inflection structure of a synthetic language using Latin as an example. We construct a bipartite graph in which one group of vertices correspond to dictionary headwords and the other group to inflected forms encountered in a…
An injective word over a finite alphabet $V$ is a sequence $w=v_1v_2\cdots v_t$ of distinct elements of $V$. The set $\mathrm{inj}(V)$ of injective words on $V$ is partially ordered by inclusion. A complex of injective words is the order…
Let $S$ be a finite alphabet. An injective word over $S$ is a word over $S$ such that each letter in $S$ appears at most once in the word. We study Boolean cell complexes of injective words over $S$ and their commutation classes. This…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…
We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A…
Based on the two-dimensional lattice fermion model, we discuss transitions between different pairing states. Each phase is labeled by an integer which is a topological invariant and characterized by vortices of the Bloch wavefunction. The…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
Let $W$ be an infinite word over finite alphabet $A$. We get combinatorial criteria of existence of interval exchange transformations that generate the word W.
Let $f:S\rightarrow R$ be a ring extension. We introduce and study the properties of $(R, S)_\star$-injective modules and the existences of $(R, S)_\star$-injective envelopes. Besides, we show that every $R$-module has an $(R, S)$-injective…
Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to…
We consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…
We consider an integrable system in five unknowns having three quartics invariants. We show that the complex affine variety defined by putting these invariants equal to generic constants, completes into an abelian surface; the jacobian of a…
This paper deals with an extension of the classical concept of shift space, which corresponds to any shift-invariant closed subset of the Cartesian product of a particular finite set (alphabet) endowed with the prodiscrete topology. In such…
We propose an algorithmic test to check whether a two-input system is linearizable by an endogenous dynamic feedback with a dimension of at most two. This test furthermore provides a procedure for systematically deriving flat outputs for…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
We establish a duality between injective envelopes and flat covers over a commutative Noetherian ring. One case of this duality states that a morphism is an injective envelope, if and only if its Matlis dual is a flat cover. We also show…
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.