Related papers: On semi-open codes and bi-continuing almost everyw…
We address the question of when a covering of the boundary of a surface can be extended to a covering of the surface (equivalently: when is there a branched cover with a prescribed monodromy). If such an extension is possible, when can the…
In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…
For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…
Several coupled maps models are sketched and reviewed in this short communication. First, a discrete logistic type model that was proposed for the symbiotic interaction of two species. Second, a model of many of these symbiotic species…
We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category…
We give sufficient conditions for a shift space $(\Sigma,\sigma)$ to be intrinsically ergodic, along with sufficient conditions for every subshift factor of $\Sigma$ to be intrinsically ergodic. As an application, we show that every…
The Fischer, Krieger, and fiber product covers of sofic beta-shifts are constructed and used to show that every strictly sofic beta-shift is $2$-sofic. Flow invariants based on the covers are computed, and shown to only depend on an single…
When a dynamical system contains several different modes of oscillations it may behave in a variety of ways: If the modes oscillate at their own individual frequencies, it exhibits quasiperiodic behavior; when the modes lock to one another…
In this note we introduce the concept of a quasi-finite complex. Next, we show that for a given countable and locally finite CW complex L the following conditions are equivalent: (i) L is quasi-finite. (ii) There exists a [L]-invertible…
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…
A multidimensional sofic shift is called countably covered if it has an SFT cover containing only countably many configurations. In contrast to the one-dimensional setting, not all countable sofic shifts are countably covered. We…
We treat synchronization for iterated function systems generated by diffeomorphisms on compact manifolds. Synchronization here means the convergence of orbits starting at different initial conditions when iterated by the same sequence of…
If a compact closed category has finite products or finite coproducts then it in fact has finite biproducts, and so is semi-additive.
Let $ X_{\beta}$ be a sofic $ \beta $-shift for $ \beta \in (1, 2] $. We show that there is an $ S $-gap shift $ X(S) $ such that $ X_{\beta} $ and $ X(S) $ are right-resolving almost conjugate. Conversely, a condition on $ S \subseteq…
Let S be the spectrum of a discrete valuation ring with function field K. Let X be a scheme over S. We will say that X is semi-factorial over S if each invertible sheaf on the generic fiber X_K can be extended to an invertible sheaf on X.…
In this paper, we show that if $k\geq (\nu+2)/4$, where $\nu$ denotes the order of a graph, a non-bipartite graph $G$ is $k$-extendable if and only if it is $2k$-factor-critical. If $k\geq (\nu-3)/4$, a graph $G$ is $k\ 1/2$-extendable if…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…