English
Related papers

Related papers: The coset factorization of finite cyclic group

200 papers

In this paper, we study a conjecture of Gao and Wang concerning a proposed formula $K_1^*(G)$ for the maximal cross number $K_1(G)$ taken over all unique factorization indexed multisets over a given finite abelian group $G$. As a corollary…

Number Theory · Mathematics 2013-01-09 Daniel Kriz

R. Baer has proved that if the factor-group G/{\zeta}_{n}(G) of a group G by the member {\zeta}_{n}(G) of its upper central series is finite (here n is a positive integer) then the member {\gamma}_{n+1}(G) of the lower central series of G…

Group Theory · Mathematics 2011-11-02 L. A. Kurdachenko , J. Otal , I. YA. Subbotin

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

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 $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

Number Theory · Mathematics 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

Combinatorics · Mathematics 2015-01-28 D. S. Archdeacon , J. H. Dinitz , A. Mattern , D. R. Stinson

We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there…

Group Theory · Mathematics 2011-12-13 Shaofei Du , Gareth Jones , Jin Ho Kwak , Roman Nedela , Martin Skoviera

We consider a finiteness condition on centralizers in a group G, namely that |C_G (x) : <x>| is finite for every non-normal cyclic subgroup <x> of G. For periodic groups, this is the same as |C_G (x)| is finite for every non-normal cyclic…

Group Theory · Mathematics 2015-10-14 Gustavo A. Fernandez-Alcober , Leire Legarreta , Antonio Tortora , Maria Tota

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Group Theory · Mathematics 2025-10-22 Peter J. Cameron , Hiranya Kishore Dey

This paper introduces and develops a general framework for studying triple factorisations of the form $G=ABA$ of finite groups $G$, with $A$ and $B$ subgroups of $G$. We call such a factorisation nondegenerate if $G\neq AB$. Consideration…

Group Theory · Mathematics 2009-09-25 S. Hassan Alavi , Cheryl E. Praeger

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…

Group Theory · Mathematics 2018-02-23 Igor Lima , Martino Garonzi

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such…

Commutative Algebra · Mathematics 2014-07-15 Lance Bryant , James Hamblin

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Given a nonnegative integer $h$, the $h$-fold sumset $hA$ is the set of all sums of $h$ elements of $A$, and the restricted $h$-fold sumset $h^\wedge A$ is the set of all…

Number Theory · Mathematics 2025-08-19 Vivekanand Goswami , Raj Kumar Mistri

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Combinatorics · Mathematics 2024-02-07 Joel Brewster Lewis , Alejandro H. Morales

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

Group Theory · Mathematics 2020-03-16 Marius Tărnăuceanu

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

Exactly Solvable and Integrable Systems · Physics 2010-12-27 Hassan Sedaghat

We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation. The splitting is called {\it…

Combinatorics · Mathematics 2021-01-19 Pingzhi Yuan

This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…

Numerical Analysis · Mathematics 2023-08-30 Konstantin Usevich , Julien Flamant , Marianne Clausel , David Brie

A finite group is said to be $n$-cyclic if it contains $n$ cyclic subgroups. For a finite group $G$, the ratio of the number of cyclic subgroups to the number of subgroups is known as the cyclicity degree of the group $G$ and is denoted by…

Combinatorics · Mathematics 2026-03-11 Khyati Sharma , A. Satyanarayana Reddy