Related papers: Pattern Complexity of Aperiodic Substitutive Subsh…
We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…
We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given…
Recently, alternating transition systems are adopted to describe control systems with disturbances and their finite abstract systems. In order to capture the equivalence relation between these systems, a notion of alternating approximate…
In this paper we study the maximal pattern complexity of infinite words up to Abelian equivalence. We compute a lower bound for the Abelian maximal pattern complexity of infinite words which are both recurrent and aperiodic by projection.…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
Periodic and semi periodic patterns are very common in nature. In this paper we introduce a topological toolbox aiming in detecting and quantifying periodicity. The presented technique is of a general nature and may be employed wherever…
We study a one-dimensional lattice model subject to non-Hermitian quasiperiodic potentials. Firstly, we strictly demonstrate that there exists an interesting dual mapping relation between $|a|<1$ and $|a|>1$ with regard to the potential…
Classical results on aperiodic tilings are rather complicated and not widely understood. Below, an alternative approach is discussed in hope to provide additional intuition not apparent in classical works.
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…
We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…
We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer $r \geq 5$, we give exponential improvements for the best asymptotic upper bounds for this invariant under the…
The computational cost of micromechanics for heterogeneous materials can be reduced in certain cases where symmetric boundary conditions are applicable. We derived an eighth symmetric formulation of the Generalized Method of Cells for…
We study the stability and stabilizability of a continuous-time switched control system that consists of the time-invariant $n$-dimensional subsystems \dot{x}=A_ix+B_i(x)u\quad (x\in\mathbb{R}^n, t\in\mathbb{R}_+ \textrm{and}…
We consider minimal, aperiodic symbolic subshifts and show how to characterize the combinatorial property of bounded powers by means of a metric property. For this purpose we construct a family of graphs which all approximate the subshift…
We address the problems in applying cycle expansions to bound chaotic systems, caused by e.g. intermittency and incompleteness of the symbolic dynamics. We discuss zeta functions associated with weighted evolution operators and in…
Approximate pattern matching is a natural and well-studied problem on strings: Given a text $T$, a pattern $P$, and a threshold $k$, find (the starting positions of) all substrings of $T$ that are at distance at most $k$ from $P$. We…
This paper mathematically studies membranes and filaments adhering to periodic patterned substrates in a one-dimensional model. The problem is formulated by the minimizing problem of an elastic energy with a contact potential on graph…
We consider the structure of Pisot substitution tiling spaces, in particular, the structure of those spaces for which the translation action does not have pure discrete spectrum. Such a space is always a measurable m-to-one cover of an…
An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…
A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…