English
Related papers

Related papers: Counting elements and geodesics in Thompson's grou…

200 papers

Let $s_n^\mathrm{ch}(\Gamma)$ denote the number of characteristic subgroups of index at most $n$ in a finitely generated group $\Gamma$. In response to a question of I. Rivin we show that if $\Gamma = F_r$ is the free group on $r \geq 2$…

Group Theory · Mathematics 2025-10-07 Liam Hanany , Alexander Lubotzky

We present two on-line algorithms for maintaining a topological order of a directed $n$-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles $m$ arc additions in $O(m^{3/2})$ time.…

Data Structures and Algorithms · Computer Science 2011-05-13 Bernhard Haeupler , Telikepalli Kavitha , Rogers Mathew , Siddhartha Sen , Robert Endre Tarjan

We consider the radius of gyration of a Gaussian topological polymer $G$ formed by subdividing a graph $G'$ of arbitrary topology (for instance, branched or multicyclic). We give a new exact formula for the expected radius of gyration and…

Statistical Mechanics · Physics 2025-10-09 Jason Cantarella , Tetsuo Deguchi , Clayton Shonkwiler , Erica Uehara

We use geometric techniques to investigate several examples of quasi-isometrically embedded subgroups of Thompson's group F. Many of these are explored using the metric properties of the shift map phi in F. These subgroups have simple…

Group Theory · Mathematics 2018-03-19 Sean Cleary , Jennifer Taback

Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…

Combinatorics · Mathematics 2020-11-18 Haiyan Chen , Bojan Mohar

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

Group Theory · Mathematics 2009-06-08 H. A. Helfgott

Let $f:S^2\to S^2$ be a continuous map such that $deg f = d, |d|>1$. Suppose $f$ has two attracting fixed points denoted $N$ and $S$ and let $A=S^2\setminus \{N,S\}$. Assume that if a loop $\gamma\subset f^{-1}(A)$ is homotopically trivial…

Dynamical Systems · Mathematics 2017-07-20 G. Honorato , J. Iglesias , A. Portela , A. Rovella , F. Valenzuela , J. Xavier

When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…

Computational Complexity · Computer Science 2025-10-14 Peter Bürgisser , Mahmut Levent Doğan , Visu Makam , Michael Walter , Avi Wigderson

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

Group Theory · Mathematics 2010-06-21 Frédérique Bassino , Cyril Nicaud , Pascal Weil

In 1980 Rostislav Grigorchuk constructed a group $G$ of intermediate growth, and later obtained the following estimates on its growth $\gamma$: $e^{\sqrt{n}}\precsim\gamma(n)\precsim e^{n^\beta},$ where $\beta=\log_{32}(31)\approx0.991$. He…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi

The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior…

Combinatorics · Mathematics 2020-08-18 Toufik Mansour , Reza Rastegar

The theta function of Lovasz is a graph parameter that can be computed up to arbitrary precision in polynomial time. It plays a key role in algorithms that approximate graph parameters such as maximum independent set, maximum clique and…

Data Structures and Algorithms · Computer Science 2025-06-04 Uriel Feige , Vadim Grinberg

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

Metric Geometry · Mathematics 2025-04-11 Marco Longinetti , Simone Naldi

We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…

Group Theory · Mathematics 2008-07-08 A. Myasnikov , V. Roman'kov , A. Ushakov , A. Vershik

We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…

Combinatorics · Mathematics 2018-07-24 Guillermo Matera , Mariana Pérez , Melina Privitelli

This paper presents algorithms for computing the length of a sum of squares and a Pythagoras element in a global field $K$ of characteristic different from $2$. In the first part of the paper, we present algorithms for computing the length…

Number Theory · Mathematics 2023-06-22 Mawunyo Kofi Darkey-Mensah , Beata Rothkegel

In this paper, we present a new record for the densest geodesic congruent ball packing configurations in $\mathbf{H}^2\!\times\!\mathbf{R}$ geometry, generated by screw motion groups. These groups are derived from the direct product of…

Metric Geometry · Mathematics 2025-06-16 Arnasli Yahya , Jenő Szirmai

The Bishop-Gromov theorem upperbounds the rate of growth of volume of geodesic balls in a space, in terms of the most negative component of the Ricci curvature. In this paper we prove a strengthening of the Bishop-Gromov bound for…

Differential Geometry · Mathematics 2022-09-21 Adam R. Brown , Michael H. Freedman

Let $\Gamma$ be a cocompact Fuchsian group, and $l$ a fixed closed geodesic. We study the counting of those images of $l$ that have a distance from $l$ less than or equal to $R$. We prove an $\Omega$-result for the error term in the…

Number Theory · Mathematics 2025-10-08 Marios Voskou

Let X be a group with identity e, let A be an infinite set of generators for X, and let (X,d_A) be the metric space with the word metric d_A induced by A. If the diameter of the space is infinite, then for every positive integer h there are…

Number Theory · Mathematics 2014-01-03 Melvyn B. Nathanson