Related papers: One-sided shift spaces over infinite alphabets
Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…
We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…
We show that morphisms from n A_infinity-algebras to a single one are maps over an operad module with n+1 commuting actions of the operad A_infinity, whose algebras are conventional A_infinity-algebras. Similar statement holds for homotopy…
We introduce a class of subshifts under the name of "standard one-counter shifts". The standard one-counter shifts are the Markov coded systems of certain Markov codes that belong to the family of one-counter languages. We study topological…
We investigate dynamical systems consisting of a locally compact Hausdorff space equipped with a partially defined local homeomorphism. Important examples of such systems include self-covering maps, one-sided shifts of finite type and, more…
A profinite group equipped with an expansive endomorphism is equivalent to a one-sided group shift. We show that these groups have a very restricted structure. More precisely, we show that any such group can be decomposed into a finite…
Every directed graph defines a Hilbert space and a family of weighted shifts that act on the space. We identify a natural notion of periodicity for such shifts and study their C*-algebras. We prove the algebras generated by all shifts of a…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
To every one-sided shift space $\mathsf{X}$ we associate a cover $\tilde{\mathsf{X}}$, a groupoid $\mathcal{G}_{\mathsf{X}}$ and a $\mathrm{C^*}$-algebra $\mathcal{O}_{\mathsf{X}}$. We characterize one-sided conjugacy, eventual conjugacy…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
Recently Ott, Tomforde and Willis proposed a new approach for one sided shift spaces over infinite alphabets. In this new approach the conjugacy classes of shifts of finite type, edge shifts, and M-step shifts are distinct and the authors…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
We carefully define and study C*-algebras over topological spaces, possibly non-Hausdorff, and review some relevant results from point-set topology along the way. We explain the triangulated category structure on the bivariant Kasparov…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
We introduce shift algebras as certain crossed product algebras based on general function spaces and study properties, as well as the classification, of a particular class of modules depending on a set of matrix parameters. It turns out…