中文
相关论文

相关论文: Factorizations of the Thompson-Higman groups, and …

200 篇论文

We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z <A>, with S = S_0 + S_1,…

形式语言与自动机理论 · 计算机科学 2015-03-20 Clelia De Felice

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

计算复杂性 · 计算机科学 2013-01-18 Vikraman Arvind

The c-dimension of a group G is the maximal length of a chain of nested centralizers in G. We prove that a locally finite group of finite c-dimension k has less than 5k nonabelian composition factors.

群论 · 数学 2018-10-30 Alexandr Buturlakin , Andrey V. Vasil'ev

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

群论 · 数学 2025-09-23 Francis Wagner

Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…

几何拓扑 · 数学 2014-11-11 Louis Funar , Christophe Kapoudjian

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…

组合数学 · 数学 2024-10-04 Christian Gaetz , Yibo Gao , Pakawut Jiradilok , Gleb Nenashev , Alexander Postnikov

Let $H$ be a Krull monoid with finite class group $G$ and suppose that every class contains a prime divisor. If an element $a \in H$ has a factorization $a=u_1 \cdot \ldots \cdot u_k$ into irreducible elements $u_1, \ldots, u_k \in H$, then…

数论 · 数学 2019-07-09 Alfred Geroldinger , Qinghai Zhong

We revisit our construction of the Thompson groups from the polycyclic inverse monoids in the light of new research. Specifically, we prove that the Thompson group $G_{n,1}$ is the group of units of a Boolean inverse monoid $C_{n}$ called…

群论 · 数学 2020-06-30 Mark V Lawson

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…

群论 · 数学 2010-03-09 Roland Zarzycki

In this note, we compute the {\Sigma}^1(G) invariant when 1 {\to} H {\to} G {\to} K {\to} 1 is a short exact sequence of finitely generated groups with K finite. As an application, we construct a group F semidirect Z_2 where F is the R.…

群论 · 数学 2011-12-22 Nic Koban , Peter Wong

We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…

组合数学 · 数学 2015-03-17 Alejandro H. Morales , Ekaterina A. Vassilieva

We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…

群论 · 数学 2018-03-19 Jose Burillo , Sean Cleary , Melanie Stein , Jennifer Taback

Let $G$ be a finitely generated infinite group and let $p > 1$. In this paper we make a connection between the first $L^p$-cohomology space of $G$ and $p$-harmonic functions on $G$. We also describe the elements in the first…

泛函分析 · 数学 2007-05-23 Michael J. Puls

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

群论 · 数学 2007-05-23 Miklos Abert , Laszlo Babai

Let T denote Thompson's group of piecewise 2-adic linear homeomorphisms of the circle. Ghys and Sergiescu showed that the rotation number of every element of T is rational, but their proof is very indirect. We give here a short, direct…

动力系统 · 数学 2007-06-13 Danny Calegari

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

Let G be an algebraic group defined over an algebraically closed field k of characteristic zero. We give a simple proof of the following result: if H^1(L, G) = {1} for some finitely generated field extension L/k of transcendence degree \ge…

代数几何 · 数学 2007-05-23 Zinovy Reichstein , Boris Youssin

The nonsoluble length $\lambda (G)$ of a finite group $G$ is defined as the number of nonsoluble factors in a shortest normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. The generalized…

群论 · 数学 2014-05-09 E. I. Khukhro , P. Shumyatsky

We enumerate Hurwitz orbits of shortest reflection factorizations of an arbitrary element in the infinite family $G(m, p, n)$ of complex reflection groups. As a consequence, we characterize the elements for which the action is transitive…

组合数学 · 数学 2022-06-17 Joel Brewster Lewis , Jiayuan Wang

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…

群论 · 数学 2024-05-08 Mihai-Silviu Lazorec