Related papers: Generating Product Systems

We prove that if an ergodic action of a countable group on a probability space admits a generating partition having finite Shannon entropy then it admits a finite generating partition.

The Krieger generator theorem says that every invertible ergodic measure-preserving system with finite measure-theoretic entropy can be embedded into a full shift with strictly greater topological entropy. We extend Krieger's theorem to…

For an ergodic probability-measure-preserving action $G \curvearrowright (X, \mu)$ of a countable group $G$, we define the Rokhlin entropy $h_G^{\mathrm{Rok}}(X, \mu)$ to be the infimum of the Shannon entropies of countable generating…

A rather general ergodic type scheme is presented on arbitrary sets X, as they are generated by arbitrary mappings T : X \longrightarrow X. The structures considered on X are given by suitable subsets of the set of all of its finite…

This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

Any discrete quantum process is represented by a sequence of quantum channels. We consider ergodic quantum processes obtained by a map that takes the points along the trajectory of a discrete ergodic dynamical system to the space of quantum…

All crossed products of two cyclic groups are explicitly described using generators and relations. A necessary and sufficient condition for an extension of a group by a group to be a cyclic group is given.

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

We obtain a Poisson Limit for return times to small sets for product systems. Only one factor is required to be hyperbolic while the second factor is only required to satisfy polynomial deviation bounds for ergodic sums. In particular, the…

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

For a given ergodic measure preserving transformation T of a standard measure space each finite labelled partition defines an ergodic stationary process. There is a complete metric on the space of partitions which is separable. Various…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…

We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…

In this paper it is proved that if a minimal system has the property that its sequence entropy is uniformly bounded for all sequences, then it has only finitely many ergodic measures and is an almost finite to one extension of its maximal…