English
Related papers

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

200 papers

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the…

Group Theory · Mathematics 2022-10-10 Gili Golan

Let $\mathcal{G}$ be a properly face 2-coloured (say black and white) \break piecewise-linear triangulation of the sphere with vertex set $V$. Consider the abelian group $\mathcal{A}_W$ generated by the set $V$, with relations $r+c+s=0$ for…

Combinatorics · Mathematics 2016-01-21 Thomas A. McCourt

We present a theoretical and computational framework to compute the symmetry number of a flexible sphere cluster in $\mathbb{R}^3$, using a definition of symmetry that arises naturally when calculating the equilibrium probability of a…

Mathematical Physics · Physics 2019-03-27 Emilio Zappa , Miranda Holmes-Cerfon

Let $G$ be a group acting properly by isometries and with a strongly contracting element on a geodesic metric space. Let $N$ be an infinite normal subgroup of $G$, and let $\delta_N$ and $\delta_G$ be the growth rates of $N$ and $G$ with…

Group Theory · Mathematics 2020-06-10 Goulnara N. Arzhantseva , Christopher H. Cashen

We study the LEF growth function of a finitely generated LEF group $\Gamma$, which measures the orders of finite groups admitting local embeddings of balls in a word metric on $\Gamma$. We prove that any sufficiently smooth increasing…

Group Theory · Mathematics 2022-01-14 Henry Bradford

Let STS(n) denote the number of Steiner triple systems on n vertices, and let F(n) denote the number of 1-factorizations of the complete graph on n vertices. We prove the following upper bound. STS(n) <= ((1 + o(1)) (n/e^2))^(n^2/6) F(n) <=…

Combinatorics · Mathematics 2011-10-13 Nathan Linial , Zur Luria

We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], for the special case when the feasible set is the unit (hyper)sphere. The…

Optimization and Control · Mathematics 2019-04-19 Etienne de Klerk , Monique Laurent

For a fully irreducible automorphism \phi of the free group F_k we compute the asymptotics of the intersection number n \mapsto i(T,T'\phi^n) for trees T,T' in Outer space. We also obtain qualitative information about the geometry of the…

Group Theory · Mathematics 2014-02-26 Jason Behrstock , Mladen Bestvina , Matt Clay

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Combinatorics · Mathematics 2025-11-19 Mariah Moschetti , Christopher O'Neill

In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…

Computational Geometry · Computer Science 2016-07-21 Haitao Wang

Let F be the Thompson's group. We study the structure of F-limit groups. Consider a sequence of groups marked by three elements, each isomorphic to F. Assume that the this sequence is convergent in the space of marked groups. We prove that…

Group Theory · Mathematics 2010-03-09 Roland Zarzycki

We study the number of elements $x$ and $y$ of a finite group $G$ such that $x \otimes y= 1_{_{G \otimes G}}$ in the nonabelian tensor square $G \otimes G$ of $G$. This number, divided by $|G|^2$, is called the tensor degree of $G$ and has…

Group Theory · Mathematics 2017-02-07 Peyman Niroomand , Francesco G. Russo

Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…

Algebraic Topology · Mathematics 2017-10-24 Parth Sarin

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which…

Geometric Topology · Mathematics 2007-05-23 Joan S. Birman , Ki Hyoung Ko , Sang Jin Lee

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

Number Theory · Mathematics 2024-03-29 Vefa Goksel , Giacomo Micheli

This note records some observations concerning geodesic growth functions. If a nilpotent group is not virtually cyclic then it has exponential geodesic growth with respect to all finite generating sets. On the other hand, if a finitely…

Group Theory · Mathematics 2012-05-16 Martin Bridson , Jose Burillo , Murray Elder , Zoran Sunic

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

Number Theory · Mathematics 2014-09-05 Eda Cesaratto , Guillermo Matera , Mariana Pérez

Suppose that we are given independent, identically distributed samples $x_l$ from a mixture $\mu$ of no more than $k$ of $d$-dimensional spherical gaussian distributions $\mu_i$ with variance $1$, such that the minimum $\ell_2$ distance…

Data Structures and Algorithms · Computer Science 2025-09-10 Somnath Chakraborty , Hariharan Narayanan

We prove a bound for the geodesic diameter of a subset of the unit ball in $\mathbb{R}^n$ described by a fixed number of quadratic equations and inequalities, which is polynomial in $n$, whereas the known bound for general degree is…

Algebraic Geometry · Mathematics 2012-09-27 Michel Coste , Seydou Moussa

A new formalism is presented for analytically obtaining the probability density function, \( P_{n}(s) \), for the distance between two random points in an \( n \)-dimensional sphere of radius \( R \). Our formalism allows \( P_{n}(s) \) to…

Mathematical Physics · Physics 2007-05-23 Shu-Ju Tu , Ephraim Fischbach
‹ Prev 1 4 5 6 7 8 10 Next ›