相关论文: Complexity of Shift Spaces on Semigroups

We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…

Assume $G$ is a group and $\mathcal{A}$ is an algebra of subsets of $G$ closed under left translation. We study various ways to understand the Ellis group of the $G$-flow $S(\mathcal{A})$ (the Stone space of $\mathcal{A}$), with particular…

Symbolic dynamical theory plays an important role in the research of amenability with a countable group. Motivated by the deep results of Dougall and Sharp, we study the group extensions for topologically mixing random shifts of finite…

In this paper, we investigate structural properties of finite groups that are detected by certain group invariants arising from Dijkgraaf--Witten theory, a topological quantum field theory, in one space and one time dimension. In this…

Let $G$ be a finite group and $H$ a subgroup of $G$. Each left transversal (with identity) of $H$ in $G$ has a left loop (left quasigroup with identity) structure induced by the binary operation of $G$. We say two left transversals are…

Given a homeomorphism $T \colon X \to X$ of a compact metric space $X$, the stabilized automorphism group $\textrm{Aut}^{\infty}(T)$ of the system $(X,T)$ is the group of self-homeomorphisms of $X$ which commute with some power of $T$. We…

In this paper, we focus on some properties, calculations and estimations of topological entropy for a nonautonomous dynamical system $(X,f_{0,\infty})$ generated by a sequence of continuous self-maps $f_{0,\infty}=\{f_n\}_{n=0}^{\infty}$ on…

Given a group \( G \), a field \( \kappa \), and a factor set \( \sigma \) arising from a partial projective \( \kappa \)-representation of \( G \). This leads to the construction of a topological partial dynamical system \( (\Omega_\sigma,…

Let $\mathbb{N}$ be a set of the natural numbers. Symmetric inverse semigroup $R_\infty$ is the semigroup of all infinite 0-1 matrices $[g_{ij}]$ with at most one 1 in each row and each column such that $g_{ii}=1$ on the complement of a…

We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…

A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…

We show that the sets of periods of multidimensional shifts of finite type (SFTs) are exactly the sets of integers of the complexity class $\NE$. We also show that the functions counting their number are the functions of #E. We also give…

Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…

We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…

We study the canonical complexifications of non-compact Riemannian symmetric spaces G/K by the Grauert tube construction. We determine the maximal such complexification, a domain already constructed in another context by Akhiezer and…

Let $\{T(t)\}_{t\geq0}$ be a $C_0$-semigroup on an infinite dimensional separable Hilbert space; a suitable definition of near $\{T(t)^*\}_{t\geq0}$ invariance of a subspace is presented in this paper. A series of prototypical examples for…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…

We characterize finite groups G generated by orthogonal transformations in a finite-dimensional Euclidean space V whose fixed point subspace has codimension one or two in terms of the corresponding quotient space V/G with its quotient…