English
Related papers

Related papers: Weakly branch actions: first-order theory, rigidit…

200 papers

Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…

Combinatorics · Mathematics 2017-05-30 David Conlon , Joonkyung Lee

We prove the first rigidity and classification theorems for crossed product von Neumann algebras given by actions of non-discrete, locally compact groups. We prove that for arbitrary free probability measure preserving actions of connected…

Operator Algebras · Mathematics 2018-07-20 Arnaud Brothier , Tobe Deprez , Stefaan Vaes

We use type I string models with supersymmetry broken by compactification (\`a la Scherk-Schwarz) in order to test the weak gravity conjecture in the presence of runaway potentials in a perturbative string theory setting. For a finite value…

High Energy Physics - Theory · Physics 2021-05-28 Quentin Bonnefoy , Emilian Dudas , Severin Lüst

This article is dedicated to the study of asymptotically rigid mapping class groups of infinitely-punctured surfaces obtained by thickening planar trees. Such groups include the braided Ptolemy-Thompson groups $T^\sharp,T^\ast$ introduced…

Group Theory · Mathematics 2022-08-17 Anthony Genevois , Anne Lonjou , Christian Urech

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

Group Theory · Mathematics 2017-05-23 A. R. Moghaddamfar , S. Rahbariyan , W. J. Shi

An infinite dimensional notion of asymptotic structure is considered. This notion is developed in terms of trees and branches on Banach spaces. Every countably infinite countably branching tree $\mathcal T$ of a certain type on a space X is…

Functional Analysis · Mathematics 2007-05-23 Edward Odell , Thomas Schlumprecht

Let A be a locally compact group topologically generated by d elements and let k>d. Consider the action, by pre-composition, of Aut(F_k) on the set of marked, k-generated, dense subgroups D_{k,A} := {h:F_k --> A | h(F_k) is dense in A}. We…

Group Theory · Mathematics 2009-02-24 Yair Glasner

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

Group Theory · Mathematics 2025-11-20 Alex Margolis , Sam Shepherd , Emily Stark , Daniel Woodhouse

Let $p$ be a prime, $D$ a finite dimensional noncommutative division $\mathbb{Q}_p$-algebra, and $SL_1(D)$ the group of elements of $D$ of reduced norm $1$. When the center of $D$ is $\mathbb{Q}_p$, we prove that no open subgroup of…

Group Theory · Mathematics 2023-11-22 Francesco Noseda , Ilir Snopce

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

Geometric Topology · Mathematics 2015-01-05 Joseph Maher , Giulio Tiozzo

We study the Fibered Isomorphism conjecture of Farrell and Jones for groups acting on trees. We show that under certain conditions the conjecture is true for groups acting on trees when the stabilizers satisfy the conjecture. These…

K-Theory and Homology · Mathematics 2013-08-16 S. K. Roushon

We explore the structure of the p-adic automorphism group Gamma of the infinite rooted regular tree. We determine the asymptotic order of a typical element, answering an old question of Turan. We initiate the study of a general dimension…

Group Theory · Mathematics 2011-11-10 Miklos Abert , Balint Virag

The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…

Statistics Theory · Mathematics 2026-05-12 Yang Xiang , Kevin McGoff , Andrew B. Nobel

We investigate the asymptotic Tower Weak Gravity Conjecture in weak coupling limits of open string theories with minimal supersymmetry in four dimensions, focusing for definiteness on gauge theories realized on 7-branes in F-theory.…

High Energy Physics - Theory · Physics 2022-11-11 Cesar Fierro Cota , Alessandro Mininno , Timo Weigand , Max Wiesner

We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…

Logic · Mathematics 2023-02-14 Samuel Braunfeld , Anuj Dawar , Ioannis Eleftheriadis , Aris Papadopoulos

We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…

Group Theory · Mathematics 2017-05-18 Kai-Uwe Bux , Ralf Köhl , Stefan Witzel

In this paper we introduce a general notion of weak extension property for embeddings induced by a group actions. As an example, for the group H(M, m) of measure-preserving homeomorphisms of a noncompact manifold M, we deduce weak type…

Geometric Topology · Mathematics 2009-04-09 Tatsuhiko Yagasaki

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

Combinatorics · Mathematics 2010-04-27 Russell Lyons

We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…

Discrete Mathematics · Computer Science 2020-07-16 Jaroslav Nesetril , Patrice Ossona de Mendez , Michal Pilipczuk , Roman Rabinovich , Sebastian Siebertz

We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…

Logic in Computer Science · Computer Science 2022-01-27 Jan Dreier , Jakub Gajarský , Sandra Kiefer , Michał Pilipczuk , Szymon Toruńczyk