Related papers: Recognizability in S-adic shifts

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program…

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the…

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

The two main theorems proved here are as follows: If $A$ is a finite dimensional algebra over an algebraically closed field, the identity component of the algebraic group of outer automorphisms of $A$ is invariant under derived equivalence.…

Krebs et al. (2007) gave a characterization of the complexity class TC0 as the class of languages recognized by a certain class of typed monoids. The notion of typed monoid was introduced to extend methods of algebraic automata theory to…

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…

The purpose of this paper is to define some notions of movability for morphisms of inverse systems which extend the movability properties of inverse systems and which are compatible with the equivalence relations which define pro-morphisms…

We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. For integers $n>k>0 $, the shift graph $G(n,k)$ is the graph whose vertex set…

In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…

We give a notion of Scott rank for separable metric structures based on the definability of the (metric closures of) automorphism orbits in continuous infinitary logic. This is a continuous analogue of work of Montalb\'an for countable…

The celebrated Borel--Tits theorem provides a classification of abstract isomorphisms between (simple) isotropic groups over fields, showing that such isomorphisms arise from field isomorphisms and group-scheme isomorphisms. In this work,…

P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…

Countable Markov shifts, denoted by $\Sigma_A$ for a 0-1 infinite matrix $A$, are central objects in symbolic dynamics and ergodic theory. R. Exel and M. Laca introduced the corresponding operator algebras, a generalization of the…

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

According to the relative Langlands functoriality conjecture, an admissible morphism between the $L$-groups of spherical varieties should induce a functorial transfer of the corresponding local and global automorphic spectra. Via the…