English
Related papers

Related papers: Strongly transitive multiple trees

200 papers

We obtain a criterion for the automorphism group of an affine toric variety to be connected in combinatorial terms and in terms of the divisor class group of the variety. The component group of the automorphism group of a non-degenerate…

Algebraic Geometry · Mathematics 2025-03-25 Veronika Kikteva

We show that if the automorphism group of a projective variety is torsion, then it is finite. Motivated by Lang's conjecture on rational points of hyperbolic varieties, we use this to prove that a projective variety with only finitely many…

Algebraic Geometry · Mathematics 2020-06-23 Ariyan Javanpeykar

We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…

Logic in Computer Science · Computer Science 2025-02-24 Achim Blumensath

Let $A$ be an abelian variety over an algebraically closed field. We show that $A$ is the automorphism group scheme of some smooth projective variety if and only if $A$ has only finitely many automorphisms as an algebraic group. This…

Algebraic Geometry · Mathematics 2021-05-24 Jérémy Blanc , Michel Brion

It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity, replacing them with a much broader condition…

Probability · Mathematics 2010-04-27 Russell Lyons , Benjamin J. Morris , Oded Schramm

In this article we study the transitivity of the group of automorphisms of real algebraic surfaces. We characterize real algebraic surfaces with very transitive automorphism groups. We give applications to the classification of real…

Algebraic Geometry · Mathematics 2019-02-20 Jérémy Blanc , Frédéric Mangolte

Considering the wired uniform spanning forest on a nonunimodular transitive graph, we show that almost surely each tree of the wired uniform spanning forest is light. More generally we study the tilted volumes for the trees in the wired…

Probability · Mathematics 2020-12-04 Pengfei Tang

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

Group Theory · Mathematics 2016-05-23 Susan Hermiller , Conchita Martínez-Pérez

We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…

Group Theory · Mathematics 2023-05-29 Pierre-Emmanuel Caprace , Martin Kassabov

We prove that, for the free algebra over a sufficiently rich operad, a large subgroup of its group of tame automorphisms has Kazhdan's property (T). We deduce that there exists a group with property (T) that maps onto large powers of…

Group Theory · Mathematics 2023-08-29 Laurent Bartholdi , Martin Kassabov

Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct…

Probability · Mathematics 2007-05-23 Robin Pemantle , Yuval Peres

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann

We show that the union of two or more independent uniform spanning forests (USF) on $\mathbb{Z}^d$ with $d\geq 3$ almost surely forms a connected transient graph. In fact, this also holds when taking the union of a deterministic everywhere…

Probability · Mathematics 2023-11-16 Eleanor Archer , Asaf Nachmias , Matan Shalev , Pengfei Tang

We prove that all groups of exponential growth support non-constant positive harmonic functions. In fact, out results hold in the more general case of strongly connected, finitely supported Markov chains invariant under some transitive…

Probability · Mathematics 2018-05-22 Gideon Amir , Gady Kozma

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…

Logic · Mathematics 2008-02-03 Shmuel Lifsches , Saharon Shelah

This is an addendum to arXiv: 0810.5376. We show, using our methods and an auxiliary result of Bestvina-Bromberg-Fujiwara, that a finitely generated group with infinitely many pairwise non-conjugate homomorphisms to a mapping class group…

Group Theory · Mathematics 2010-09-16 Jason Behrstock , Cornelia Drutu , Mark Sapir

We prove that an irreducible lattice acting on a product of two or more locally finite, biregular trees is finitely generated.

Group Theory · Mathematics 2010-08-17 Anne Thomas , Kevin Wortman

We continue our study of residual properties of mapping tori of free group endomorphisms. In this paper, we prove that each of these groups are virtually residually (finite $p$)-groups for all but finitely many primes$p$. The method…

Group Theory · Mathematics 2008-10-03 Alexander Borisov , Mark Sapir

We prove that if $G$ is a group of automorphisms of a regular locally finite building which is closed in the compact-open topology and acts Weyl transitively on the building, then $G$ admits just one Hausdorff locally compact…

Group Theory · Mathematics 2014-11-06 Rupert McCallum

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Combinatorics · Mathematics 2022-12-01 K. V. Chelpanov