English
Related papers

Related papers: Uniform Diameter Bounds in Branch Groups

200 papers

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

Combinatorics · Mathematics 2024-10-02 So Hirata

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

Group Theory · Mathematics 2018-06-05 Luke Morgan , Cheryl E. Praeger , Kyle Rosa

Let $G$ be a branch group acting by automorphisms on a rooted tree $T$. Stabilizers of infinite rays in $T$ are examples of weakly maximal subgroups of $G$ (subgroups that are maximal among subgroups of infinite index), but in general they…

Group Theory · Mathematics 2024-03-20 Paul-Henry Leemann

In this paper we provide a classification theorem for 1-dimensional boundaries of groups with isolated flats. Given a group $\Gamma$ acting geometrically on a $CAT(0)$ space $X$ with isolated flats and 1-dimensional boundary, we show that…

Group Theory · Mathematics 2018-06-27 Matthew Haulmark

Discontinuous Galerkin (DG) methods offer an enormous flexibility regarding local grid refinement and variation of polynomial degrees for a variety of different problem classes. With a focus on diffusion problems, we consider DG…

Numerical Analysis · Mathematics 2013-01-01 Kolja Brix , Claudio Canuto , Wolfgang Dahmen

We study the breaking of a supersymmetric SO(10) GUT in 6 dimensions by orbifold compactification. In 4 dimensions we obtain a N=1 supersymmetric theory with the standard model gauge group enlarged by an additional U(1) symmetry. The…

High Energy Physics - Phenomenology · Physics 2014-11-17 T. Asaka , W. Buchmüller , L. Covi

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…

Representation Theory · Mathematics 2024-03-15 Michael Larsen , Pham Huu Tiep

In this paper a quantum analog of the $*$-algebra of regular functions on the Shilov boundary $S(\mathbb D)$ of bounded symmetric domain $\mathbb D$ is constructed. The algebras of regular functions on $S(\mathbb D)$ are described in terms…

Quantum Algebra · Mathematics 2007-05-23 Olga Bershtein

We prove the existence of a limiting distribution for the appropriately rescaled diameters of random undirected Cayley graphs of finite nilpotent groups of bounded rank and nilpotency class, thus extending a result of Shapira and Zuck which…

Combinatorics · Mathematics 2020-02-27 Daniel El-Baz , Carlo Pagano

We construct a Gelfand-Zeitlin system on a one-parameter family of $G_2$ coadjoint orbits that are multiplicity-free Hamiltonian $SU(3)$-spaces. Using this system we prove a lower bound for the Gromov width of these orbits. This lower bound…

Symplectic Geometry · Mathematics 2022-11-03 Jeremy Lane

We prove a theorem describing the limiting fine-scale statistics of orbits of a point in hyperbolic space under the action of a discrete subgroup. Similar results have been proved only in the lattice case, with two recent infinite-volume…

Dynamical Systems · Mathematics 2023-06-22 Christopher Lutsko

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

Information Theory · Computer Science 2023-03-22 Cornelia Ott , Sven Puchinger , Martin Bossert

Based on the convergence of their infinitesimal generators in the mixed topology, we provide a stability result for strongly continuous convex monotone semigroups on spaces of continuous functions. In contrast to previous results, we do not…

Analysis of PDEs · Mathematics 2026-05-19 Jonas Blessing , Michael Kupper , Max Nendel

Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the…

Differential Geometry · Mathematics 2008-11-13 Siddartha Gadgil , Harish Seshadri

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Group Theory · Mathematics 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

We develop new sub-optimality bounds for gradient descent (GD) that depend on the conditioning of the objective along the path of optimization rather than on global, worst-case constants. Key to our proofs is directional smoothness, a…

Machine Learning · Computer Science 2025-01-15 Aaron Mishkin , Ahmed Khaled , Yuanhao Wang , Aaron Defazio , Robert M. Gower

Let $k$ be a perfect field. Assume that the characteristic of $k$ satisfies certain tameness assumptions \eqref{tameness}. Let $\mathcal O_{_n} := k\llbracket z_{_1}, \ldots, z_{_n}\rrbracket$ and set $K_{_n} := \text{Fract}~\cO_{_n}$. Let…

Algebraic Geometry · Mathematics 2026-05-27 Vikraman Balaji , Yashonidhi Pandey

Using the Moore--Penrose pseudoinverse, this work generalizes the gradient approximation technique called centred simplex gradient to allow sample sets containing any number of points. This approximation technique is called the…

Numerical Analysis · Mathematics 2020-06-02 Warren Hare , Gabriel Jarry--Bolduc , Chayne Planiden