Related papers: Strongly transitive multiple trees
We determine the geometric structure of a minimal projective threefold having two `independent and commutative' automorphisms of positive topological entropy, and generalize this result to higher-dimensional smooth minimal pairs (X, G). As…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…
We prove that the automorphism group $\mathrm{Aut}(X)$ of an affine spherical variety $X$ acts transitively on the set of smooth points $X^{reg}.$ If every invertible regular function on $X$ is constant, we prove that $X$ is flexible, i.e.,…
We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are…
We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…
We give some basic properties of strongly topologically transitive, supermixing, and hypermixing maps on general topological spaces. Then we present some other results for which our mappings need to be continuous.
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this final paper, we give…
This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…
We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
This paper further develops the theory of arbitrary semigroups acting on trees via elliptic mappings. A key tool is the Lyndon-Chiswell length function L for the semigroup S which allows one to construct a tree T and an action of S on T via…
A group action is said to be highly-transitive if it is $k$-transitive for every $k \ge 1$. The main result of this thesis is the following: Main Theorem: The fundamental group of a closed, orientable surface of genus > 1 admits a…
We present amalgamated free products satisfying coupling rigidity with respect to the automorphism group of the associated Bass-Serre tree. As an application, we obtain orbit equivalence rigidity for amalgamated free products of mapping…
We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…
Given a graph of groups $\mathcal{G} = (\Gamma, \{G_v\}, \{G_e\})$ with certain conditions on vertex groups and $G$ acts acylindrically on its Bass-Serre tree $T$. Let $H$ be a finitely generated subgroup of $G$. We prove the following…
We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.