English
Related papers

Related papers: Generating Sequences of PSL(2,p)

200 papers

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…

Group Theory · Mathematics 2023-06-05 Eilidh McKemmie

We reprove and generalize a result of Moh which gives a lower bound on the minimal number of generators of an ideal in a power series ring in three variables x,y,z over a field k. As a consequence, in each characteristic of the field k, we…

Commutative Algebra · Mathematics 2026-02-24 Laura González , Francesc Planas-Vilanova

In this article new cases of the Inverse Galois Problem are established. The main result is that for a fixed integer n, there is a positive density set of primes p such that PSL_2(F_{p^n}) occurs as the Galois group of some finite extension…

Number Theory · Mathematics 2009-05-11 Luis Dieulefait , Gabor Wiese

This paper is focused on numerical semigroups and presents a simple construction, that we call dilatation, which, from a starting semigroup $S$, permits to get an infinite family of semigroups which share several properties with $S$. The…

Commutative Algebra · Mathematics 2017-10-23 Valentina Barucci , Francesco Strazzanti

Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1 \cdot \ldots \cdot u\_k$, with irreducibles…

Commutative Algebra · Mathematics 2019-03-26 Alfred Geroldinger , Wolfgang Schmid

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…

Number Theory · Mathematics 2019-07-09 Alfred Geroldinger , Qinghai Zhong

Let $p$ be a fixed prime. For a finite group generated by elements of order $p$, the $p$-width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ elements of order $p$. Let…

Group Theory · Mathematics 2017-12-11 Alexander J. Malcolm

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

Discrete Mathematics · Computer Science 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

Two elements in a group $G$ are said to $z$-equivalent or to be in the same $z$-class if their centralizers are conjugate in $G$. In \cite{kkj}, it was proved that a non-abelian $p$-group $G$ can have at most $\frac{p^k-1}{p-1} +1$ number…

Group Theory · Mathematics 2016-05-05 Shivam Arora , Krishnendu Gongopadhyay

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

Complex Variables · Mathematics 2020-07-16 L. Pardo-Simón , D. J. Sixsmith

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

Commutative Algebra · Mathematics 2011-06-15 Harlan Kadish

Let p be a prime number. We give the explicit structure of 2- nilpotent multiplier for each finite 2-generator p-group of class two. Moreover, 2-capable groups in that class are characterized.

Group Theory · Mathematics 2021-09-14 F. Johari , A. Kaheni

If $p$ is an odd prime, then we prove that $\e(H_2(G,\mathbb{Z})) \mid p\ \e(G)$ for $p$ groups of class 7. We prove the same for $p$ groups of class at most $p+1$ with $\e(Z(G))=p$. We also prove Schurs conjecture if $\e(G/Z(G))$ is $2,3$…

Group Theory · Mathematics 2020-06-30 A. E. Antony , V. Z. Thomas

For a finite group $G$, let $m_I(G)$ denote the largest possible cardinality of a minimal invariable generating set of $G$. We prove an upper and a lower bound for $m_I(S_n)$, which show in particular that $m_I(S_n)$ is asymptotic to $n/2$…

Group Theory · Mathematics 2020-12-17 Daniele Garzoni , Nick Gill

In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t,…

Combinatorics · Mathematics 2024-01-23 R. Julian R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

Representation Theory · Mathematics 2011-07-13 A. A. Lopatin

For a finite group $G$, the prime graph $\Gamma(G)$ (also known as Gruenberg-Kegel graph) is defined to be the graph where the vertices are the primes that divide $|G|$ such that two vertices $p$ and $q$ share an edge if and only if there…

Group Theory · Mathematics 2025-10-28 Thomas Michael Keller , Zachary Martin , Alexa Renner , Gabriel Roca , Eric Yu

Let $R$ be a ring generated by $l$ elements with stable range $r$. Assume that the group $EL_d(R)$ has Kazhdan constant $\epsilon_0>0$ for some $d > r $. We prove that there exist $\epsilon(\epsilon_0,l) >0$ and $k \in N$, s.t. for every $n…

Representation Theory · Mathematics 2007-09-19 Uzy Hadad

Let $G$ be a finitely generated group with a finite generating set $S$. For $g\in G$, let $l_S(g)$ be the length of the shortest word over $S$ representing $g$. The growth series of $G$ with respect to $S$ is the series $A(t) =…

Group Theory · Mathematics 2014-01-16 Yoshiyuki Nakagawa , Makoto Tamura , Yasushi Yamashita

For two families $\mathcal{A}, \mathcal{B} \subseteq \mathcal{P}([k])$, we write $\mathcal{A}\vdash\mathcal{B}$ if $A\not\supseteq B$ for each two sets $A \in \mathcal{A}$ and $B \in \mathcal{B}$. $\mathcal{A}$ and $\mathcal{B}$ are called…

Combinatorics · Mathematics 2025-08-08 Maximilian Krone