中文
相关论文

相关论文: On the number of cyclic transitive subgroups of a …

200 篇论文

Given two positive integers n and c, we determine an upper bound, as a function of n and c, for the maximum order of a finite nilpotent transitive group of degree n and nilpotency class at most c.

群论 · 数学 2014-05-23 Eleonora Crestani , Pablo Spiga

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

信息论 · 计算机科学 2010-02-15 Kenza Guenda

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

群论 · 数学 2026-04-10 Angsuman Das , Hiranya Kishore Dey , Khyati Sharma

We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H|^{3/2}$. In particular, a transitive permutation group of…

群论 · 数学 2019-07-22 Andrea Lucchini , Mariapia Moscatiello , Pablo Spiga

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

群论 · 数学 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

In this paper we introduce and study the concept of cyclic subgroup commutativity degree of a finite group $G$. This quantity measures the probability of two random cyclic subgroups of $G$ commuting. Explicit formulas are obtained for some…

群论 · 数学 2016-09-05 Marius Tarnauceanu , Mihai-Silviu Lazorec

We present a characterization of finite permutation groups which contain a transitive dihedral subgroup.

组合数学 · 数学 2021-01-13 Shu Jiao Song

We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.

群论 · 数学 2015-06-16 Gareth M. Tracey

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

群论 · 数学 2025-08-07 Andrea Lucchini

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

群论 · 数学 2023-09-20 Anton A. Baykalov , Alice Devillers , Cheryl E. Praeger

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…

群论 · 数学 2026-04-28 Angsuman Das , Khyati Sharma

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

群论 · 数学 2012-11-08 László Tóth

In this note, we study the finite groups with the number of cylic subgroups no greater than 6.

群论 · 数学 2016-06-09 Wei Zhou

The purpose of this paper is to prove that if $G$ is a transitive permutation group of degree $n\geq 2$, then $G$ can be generated by $\lfloor cn/\sqrt{\log{n}}\rfloor$ elements, where $c:=\sqrt{3}/2$. Owing to the transitive group…

群论 · 数学 2021-02-22 Gareth Tracey

In this note, we classify all finite groups having exactly 6, 7 or 8 cyclic subgroups. This gives a partial answer to the open problem posed by Tarnauceanu (Amer. Math. Monthly, 122 (2015), 275-276). As a consequence of our results, we also…

群论 · 数学 2018-05-08 Hemant Kalra

We define a translation based cipher over an arbitrary finite field, and study the permutation group generated by the round functions of such a cipher. We show that under certain cryptographic assumptions this group is primitive. Moreover,…

群论 · 数学 2016-11-11 R. Aragona , A. Caranti , F. Dalla Volta , M. Sala

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

几何拓扑 · 数学 2019-12-12 Alice Chudnovsky , Kevin Kordek , Qiao Li , Caleb Partin

In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…

群论 · 数学 2017-02-07 Marius Tărnăuceanu , Mihai-Silviu Lazorec

We study the number of cylic subgroups in finite groups and get that $G$ has $|G|-3$ cyclic subgroups if and only if $G \cong D_{10}$ or $Q_8$.

群论 · 数学 2016-05-03 Wei Zhou

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

群论 · 数学 2018-02-23 Igor Lima , Martino Garonzi
‹ 上一页 1 2 3 10 下一页 ›