Related papers: Pattern Complexity of Aperiodic Substitutive Subsh…
Overlap coincidence is an equivalent criterion to pure discrete spectrum of the dynamics of self affine tilings. In the case of one dimension, strong coincidence on m letter irreducible substitution has been introduced in Dekking (1978) and…
Given an $\alpha > 1$ and a $\theta$ with unbounded continued fraction entries, we characterise new relations between Sturmian subshifts with slope $\theta$ with respect to (i) an $\alpha$-H\"oder regularity condition of a spectral metric,…
We consider contractive systems whose trajectories evolve on a compact and convex state-space. It is well-known that if the time-varying vector field of the system is periodic then the system admits a unique globally asymptotically stable…
Given a dynamic network, where edges appear and disappear over time, we are interested in finding sets of edges that have similar temporal behavior and form a dense subgraph. Formally, we define the problem as the enumeration of the maximal…
This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
Synchronization of chaotic units coupled by their time delayed variables are investigated analytically. A new type of cooperative behavior is found: sublattice synchronization. Although the units of one sublattice are not directly coupled…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…
We introduce a subclass of the commutative regular languages that is characterized by the property that the state set of the minimal deterministic automaton can be written as a certain Cartesian product. This class behaves much better with…
We prove structural stability under perturbations for a class of discrete-time dynamical systems near a non-hyperbolic fixed point. We reformulate the stability problem in terms of the well-posedness of an infinite-dimensional nonlinear…
Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets…
In this article we study networks of coupled dynamical systems with time-delayed connections. If two such networks hold different delays on the connections it is in general possible that they exhibit different dynamical behavior as well. We…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
A criterion for subnormality of unbounded composition operators in L2-spaces, written in terms of measurable families of probability measures satisfying the so-called consistency condition, is established. It becomes a new characterization…