Related papers: Weak abelian periodicity of infinite words
We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…
We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…
The weak noise limit of dissipative dynamical systems is often the most fascinating one. In such a case fluctuations can interact with a rich complexity frequently hidden in deterministic systems to give rise of completely new phenomena…
This paper discusses the existence of a sufficient condition for an operator to be weakly hypercyclic. We establish a weak hypercyclicity criterion, and thereupon we can answer questions 5.3 and 5.8 posed by Chan and Sanders in 2004.…
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the…
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…
It is known that weak l-sequential supercyclicity implies weak quasistability, and it is still unknown weather weak l-sequential supercyclicity implies weak stability, much less whether weak supercyclicity implies weak stability (although…
Monotonicity with respect to all arguments is fundamental to the definition of aggregation functions. It is also a limiting property that results in many important non-monotonic averaging functions being excluded from the theoretical…
Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…
In order to prove weak convergence of the periodic multiplicative Selmer algorithm we ensure that the periodicity matrix is positive and establish a relation between its entries and eigenvalues. Since we can imply that the limit of these…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…
In this paper, we study weakly nonlinear boundary value problems on infinite intervals. For such problems, we provide criteria for the existence of solutions as well as a qualitative description of the behavior of solutions depending on a…
We say a subset $C$ of an abelian group $G$ \textit{arises as a minimal additive complement} if there is some other subset $W$ of $G$ such that $C+W=\{c+w:c\in C,\ w\in W\}=G$ and such that there is no proper subset $C'\supset C$ such that…
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…
We investigate weak recognizability of deterministic languages of infinite trees. We prove that for deterministic languages the Borel hierarchy and the weak index hierarchy coincide. Furthermore, we propose a procedure computing for a…
We study the diffraction and dynamical properties of translation bounded weakly almost periodic measures. We prove that the dynamical hull of a weakly almost periodic measure is a weakly almost periodic dynamical system with unique minimal…
We consider metric versions of weak soficity, LEF and residual finiteness. The main results of the paper extend Glebsky and Rivera's characterization of weak soficity to the case of normally finitely generated groups with word metrics.…
Prefix normal words are binary words that have no factor with more $1$s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipt\'ak, DLT 2011]. In this paper, we study infinite prefix normal words…
We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…