English
Related papers

Related papers: On generalisations of conciseness

200 papers

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

Group Theory · Mathematics 2011-02-08 Volker Diekert , Alexei Myasnikov

Let A be a quasi-finite R-algebra (i.e., a direct limit of module finite algebras) with identity. Let I_i, i=0,...,m, be two-sided ideals of A, \GL_n(A,I_i) the principal congruence subgroup of level I_i in GL_n(A) and E_n(A,I_i) be the…

Rings and Algebras · Mathematics 2011-07-18 R. Hazrat , Z. Zhang

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

Group Theory · Mathematics 2018-11-28 Martin R Bridson , Dessislava H Kochloukova

Given a faithful finite-dimensional representation $V$ of a finite group $G$ over any field $\mathbb{F}$, we show that any irreducible ${\mathbb{F}}G$-module $W$ appears, as a submodule or a quotient, in $\mathrm{Sym}^m(V)$ for some integer…

Representation Theory · Mathematics 2023-03-29 János Kollár , Pham Huu Tiep

We show that for any finite group $G$ and for any $d$ there exists a word $w\in F_{d}$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot…

Group Theory · Mathematics 2007-05-23 Miklos Abert

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

Combinatorics · Mathematics 2025-03-27 Carmelo Cisto , Francesco Navarra

Various kinds of infinitary operations satisfying forms of associativity have been considered in the literature by various authors, including A. Tarski, C. Karp, J. H. Conway, D. Krob, N. Bedon, and C. Rispal. Applications include the…

Group Theory · Mathematics 2026-05-28 Paolo Lipparini

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

For semigroup $S$, a commutative congruence $\sigma_{orient}$ on $S$ and a subsemigroup Orientable($S$) of $S$ were introduced in "Two cancellative commutative congruences and group diagrams", Semigroup Forum (2011) 82: 338-353. Here we…

Group Theory · Mathematics 2022-11-10 Paul A Cummings , Brian Ortega

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

Combinatorics · Mathematics 2015-11-30 Philippe Nadeau

M.R.Jones and J.Wiegold in [3] have shown that if $G$ is a finite group with a subgroup $H$ of finite index $n$, then the $n$-th power of Schur multiplier of $G$, $M(G)^n$, is isomorphic to a subgroup of $M(H)$. In this paper we prove a…

Group Theory · Mathematics 2011-04-05 Mohammad Reza Rajabzadeh Moghaddam , Behrooz Mashayekhy , Saeed Kayvanfar

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

Group Theory · Mathematics 2013-12-19 Michael Larsen , Pham Huu Tiep

In this paper, we consider some generalized commutator equations in a finite group and show that the number of solutions of such equations are characters of that group. We also obtain explicit formula for this character, considering the…

Group Theory · Mathematics 2016-05-05 Sunil Kumar Prajapati , Rajat Kanti Nath

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…

Formal Languages and Automata Theory · Computer Science 2013-01-11 Ali Akhavi , Ines Klimann , Sylvain Lombardy , Jean Mairesse , Matthieu Picantin

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Group Theory · Mathematics 2017-05-25 Nikolay Nikolov , Jakob Schneider , Andreas Thom

Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite…

Discrete Mathematics · Computer Science 2011-08-19 Francine Blanchet-Sadri , Aleksandar Chakarov , Lucas Manuelli , Jarett Schwartz , Slater Stich

Given a group $G$ and elements $x_1,x_2,\dots, x_\ell\in G$, the commutator of the form $[x_1,x_2,\dots, x_\ell]$ is called a commutator of length $\ell$. The present paper deals with groups having only finitely many commutators of length…

Group Theory · Mathematics 2025-04-15 Iker de las Heras , Federico Di Concilio , Pavel Shumyatsky

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…

Group Theory · Mathematics 2021-02-16 Marius Tărnăuceanu

Let $P(G)$ denotes the set of sizes of fibers of non-trivial commutators of the commutator word map. Here, we prove that $|P(G)|=1$, for any finite group $G$ of nilpotency class $3$ with exactlly two conjugacy class sizes. We also show that…

Group Theory · Mathematics 2018-09-25 Tushar Kanta Naik

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc
‹ Prev 1 3 4 5 6 7 10 Next ›