English
Related papers

Related papers: Space functions of groups

200 papers

For a finitely generated lawless group $\Gamma$ and $n \in \mathbb{N}$, let $\mathcal{A}_{\Gamma} (n)$ be the minimal positive integer $M_n$ such that for all nontrivial reduced words $w$ of length at most $n$ in the free group of fixed…

Group Theory · Mathematics 2026-04-14 Henry Bradford , Jacob Willis

We construct examples of finitely presented simple groups whose Dehn functions are at least exponential. To the best of our knowledge, these are the first such examples known. Our examples arise from R\"over-Nekrashevych groups, using…

Group Theory · Mathematics 2024-07-12 Matthew C. B. Zaremsky

Whittaker functions are special functions that arise in $p$-adic number theory and representation theory. They may be defined on representations of reductive groups as well as their metaplectic covering groups: fascinatingly, many of their…

Number Theory · Mathematics 2023-01-06 Ilani Axelrod-Freed , Claire Frechette , Veronica Lang

We construct a finitely presented group $G$ with non-quadratic Dehn function $f$ majorizable by a quadratic function on arbitrary long intervals.

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii

We prove that there exists a positive, explicit function $F(k, E)$ such that, for any group $G$ admitting a $k$-acylindrical splitting and any generating set $S$ of $G$ with $\mathrm{Ent}(G,S)<E$, we have $|S| \leq F(k, E)$. We deduce…

Metric Geometry · Mathematics 2018-04-13 Filippo Cerocchi , Andrea Sambusetti

A set $X\subseteq\mathbb N$ is S-recognizable for an abstract numeration system S if the set $\rep_S(X)$ of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable set is always either…

Formal Languages and Automata Theory · Computer Science 2011-01-04 Emilie Charlier , Narad Rampersad

Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…

Representation Theory · Mathematics 2014-06-04 John D. Wiltshire-Gordon

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel

An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…

Group Theory · Mathematics 2007-05-23 Michael Larsen

If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…

Group Theory · Mathematics 2008-04-04 S. Liriano S. Majewicz

We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…

Group Theory · Mathematics 2026-02-02 Indira Chatterji , Martin Kassabov

We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…

Category Theory · Mathematics 2019-03-28 Clara Loeh

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

Group Theory · Mathematics 2009-09-14 Alexey Muranov

We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.

Group Theory · Mathematics 2012-05-10 Martin Kassabov , Nikolay Nikolov

In relation to Itzkowitz's problem, we show that a $\mathfrak c$-bounded $P$-group is balanced if and only if it is functionally balanced. We prove that for an arbitrary $P$-group, being functionally balanced is equivalent to being strongly…

General Topology · Mathematics 2017-07-31 Menachem Shlossberg

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

Computational Complexity · Computer Science 2010-04-08 Marc Thurley

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

Group Theory · Mathematics 2018-02-21 Géraud Sénizergues , Armin Weiß

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 prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

Group Theory · Mathematics 2021-03-19 Emmanuel Rauzy

Let S be a surface of genus g with n points removed, G a connected Lie group, and X(G) the moduli space of representations of the fundamental group of S into G. We compute the fundamental group of X(G) when n>0 and G is a real or complex…

Algebraic Geometry · Mathematics 2015-09-22 Indranil Biswas , Sean Lawton
‹ Prev 1 3 4 5 6 7 10 Next ›