Related papers: The Morphisms With Unstackable Image Words
We study the ring theoretical structures of mixable shuffle algebras and their associated free commutative Rota-Baxter algebras. For this study we utilize the connection of the mixable shuffle algebras with the overlapping shuffle algebra…
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic…
An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word. This…
Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…
We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant…
The ultraproduct construction is generalized to $p$-ultramean constructions ($1\leqslant p<\infty$) by replacing ultrafilters with finitely additive measures. These constructions correspond to the linear fragments $\mathscr L^p$ of…
We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…
We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…
We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
The nonlinear concepts of mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type…
We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…
We introduce the complete lifts of maps between (real and complex) Euclidean spaces and study their properties concerning holomorphicity, harmonicity and horizontal weakly conformality. As applications, we are able to use this concept to…
Relations between some kinds of formal and standard smoothness, for morphisms of schemes, are clarified in surprisingly simple and direct ways, bypassing much of the customarily employed machinery. Even the deep local-to-global property of…
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…
A Lie polynomial is an element of a free Lie algebra $\mathcal F_k$ on $k$-generators, which defines a Lie map on a given Lie algebra $L$, by substituting $k$-elements of $L$. Similar to word maps on groups and polynomial maps on algebras,…
An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…