Related papers: The finite index basis property
Information, stored or transmitted in digital form, is often structured. Individual data records are usually represented as hierarchies of their elements. Together, records form larger structures. Information processing applications have to…
We provide a family of group measure space II_1 factors for which all finite index subfactors can be explicitly listed. In particular, the set of all indices of irreducible subfactors can be computed. Concrete examples show that this index…
We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…
A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…
We consider weighted tree automata over strong bimonoids (for short: wta). A wta $\mathcal{A}$ has the finite-image property if its recognized weighted tree language $[\![\mathcal{A}]\!]$ has finite image; moreover, $\mathcal{A}$ has the…
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently…
Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
A group G is (finitely) co-Hopfian if it does not contain any proper (finite-index) subgroups isomorphic to itself. We study finitely generated groups G that admit a descending chain of proper normal finite-index subgroups, each of which is…
We settle an old conjecture of Karrass and Solitar by proving that a finitely generated subgroup of a non-trivial free product $G = A\ast B$ has finite index if and only if it intersects non-trivially each non-trivial normal subgroup of…
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…
Let F be a relatively free algebra of infinite rank. We say that F has the SMALL INDEX PROPERTY if any subgroup of Gamma=Aut(F) of index at most rank(F) contains the pointwise stabilizer Gamma_(U) of a subset U of F of cardinality less than…
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
The main result concerns a bicategorical factorization system on the bicategory $\mathrm{Cat}$ of categories and functors. Each functor $A\xra{f} B$ factors up to isomorphism as $A\xra{j}E\xra{p}B$ where $j$ is what we call an ultimate…
We give a structural description of the normal subgroups of subgroups of finite index in branch groups in terms of rigid stabilizers. This gives further insight into the structure lattices of branch groups introduced by the second author.…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
We argue that simple dynamical systems are factors of finite automata, regarded as dynamical systems on discontinuum. We show that any homeomorphism of the real interval is of this class. An orientation preserving homeomorphism of the…
A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…