English
Related papers

Related papers: On a cyclic structure of generators modulo primes

200 papers

Let G be a group of the form G_1* ... *G_n, the free product of n subgroups, and let M be a ZG-module of the form $\bigoplus_{i=1}^n M_i \otimes_{\mathbb{Z}G_i} \mathbb{Z}G$. We shall give formulae in various situations for $d_{ZG}(M)$, the…

Group Theory · Mathematics 2007-12-26 Karl W. Gruenberg , Peter A. Linnell

Let p be an odd prime. Let K_p = \Q(zeta_p) be the p-cyclotomic field. We apply a Kummer and Stickelberger relation of K_p to some singular not primary numbers A of K_p connected to p-class group of K_p and prove they verify the congruence…

Number Theory · Mathematics 2007-05-23 Roland Queme

According to the Ringel-Green Theorem([G],[R1]), the generic composition algebra of the Hall algebra provides a realization of the positive part of the quantum group. Furthermore, its Drinfeld double can be identified with the whole quantum…

Representation Theory · Mathematics 2009-04-25 Yong Jiang , Jie Sheng , Jie Xiao

We study `good elements' in finite $2n$-dimensional classical groups $G$: namely $t$ is a `good element' if $o(t)$ is divisible by a primitive prime divisor of $q^n-1$ for the relevant field order $q$, and $t$ fixes pointwise an $n$-space.…

Group Theory · Mathematics 2014-05-09 Cheryl E. Praeger , Ákos Seress , Şükrü Yalçinkaya

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

Combinatorics · Mathematics 2014-09-09 Jiangtao Peng , Fang Sun

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

Combinatorics · Mathematics 2025-04-02 Ramesh Prasad Panda

In the ElGamal signature and encryption schemes, an element $x$ of the underlying group $G = \mathbb{Z}_p^\times = \{1, \ldots, p-1 \}$ for a prime $p$ is also considered as an exponent, for example in $g^x$, where $g$ is a generator of G.…

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

Number Theory · Mathematics 2021-01-25 Zachary Hoelscher , Eyvindur Ari Palsson

Given a collection $\{ G_i\}_{i=1}^d$ of finite groups and a ring $R$, we define a subring of the ring $M_n(R)$ ($n = \sum_{i=1}^d|G_i|)$ that encompasses all the individual group rings $R[G_i]$ along the diagonal blocks as $G_i$-circulant…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Representation Theory · Mathematics 2024-11-20 Rebecca Bourn , William Q. Erickson , Jeb F. Willenbring

Given $g\ge 1$, the number $n(g)$ of numerical semigroups $S \subset \N$ of genus $|\N \setminus S|$ equal to $g$ is the subject of challenging conjectures of Bras-Amor\'os. In this paper, we focus on the counting function $n(g,2)$ of…

Combinatorics · Mathematics 2012-09-17 Shalom Eliahou , Jorge Ramirez Alfonsin

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

Number Theory · Mathematics 2018-03-02 Gianluca Amato , Maximilian F. Hasler , Giuseppe Melfi , Maurizio Parton

If we want to represent integers in base $m$, we need a set $A$ of digits, which needs to be a complete set of residues modulo $m$. When adding two integers with last digits $a_1, a_2 \in A$, we find the unique $a \in A$ such that $a_1 +…

Number Theory · Mathematics 2015-07-01 Francesco Monopoli , Imre Z. Ruzsa

Generating random and pseudorandom numbers with a deterministic system is a long-standing challenge in theoretical research and engineering applications. Several pseudorandom number generators based on the inversive congruential method have…

Discrete Mathematics · Computer Science 2024-01-17 Xiaoxiong Lu , Chengqing Li , Bo Zhou

We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…

Group Theory · Mathematics 2024-06-13 Diego García-Lucas , Ángel del Río

We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in ${\cal D}(n,p)$ for nearly optimal $p$ (up to a $\log ^cn$ factor). In particular, we show that given $t = (1-o(1))np$ Hamilton cycles $C_1,\ldots ,C_{t}$,…

Combinatorics · Mathematics 2016-03-14 Asaf Ferber , Eoin Long

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

Group Theory · Mathematics 2020-09-17 Zhongbi Wang , Heng Lv , Yanxiong Yan , Guiyun Chen

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

Group Theory · Mathematics 2022-01-04 Chris Florez , Jonathan Higgins , Kyle Huang , Thomas Michael Keller , Dawei Shen , Yong Yang

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

Rings and Algebras · Mathematics 2019-09-16 Sebastian Kreinecker

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Combinatorics · Mathematics 2025-04-29 Ramesh Prasad Panda , Papi Ray