English
Related papers

Related papers: Random primes in arithmetic progressions

200 papers

We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it…

Combinatorics · Mathematics 2021-12-17 Ivan Mogilnykh

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

Commutative Algebra · Mathematics 2025-06-18 Martin Kreuzer , Florian Walsh

Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…

Mathematical Software · Computer Science 2009-10-14 Ruslan Sharipov

We propose a class of generating functions denoted by $\textrm{RGF}_p(x)$, which is related to the Sylvester denumerant for the quotients of numerical semigroups. Using MacMahon's partition analysis, we can obtain $\textrm{RGF}_p(x)$ by…

Combinatorics · Mathematics 2024-11-27 Feihu Liu

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

General Mathematics · Mathematics 2025-09-30 N. A. Carella

Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…

Number Theory · Mathematics 2014-10-21 Guillermo Garcia-Perez , M. Angeles Serrano , Marian Boguna

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

Number Theory · Mathematics 2007-05-23 Joseph Cohen

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…

Number Theory · Mathematics 2025-08-13 Pietro Sgobba

For an odd prime p, we determine a minimal set of topological generators of the pro-p Iwahori subgroup of a split reductive group G over Z\_p. In the simple adjoint case and for any sufficiently large regular prime p, we also construct…

Number Theory · Mathematics 2018-01-12 Christophe Cornut , Jishnu Ray

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

Quantum Algebra · Mathematics 2007-05-23 Hans Plesner Jakobsen , Søren Jøndrup

In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously…

General Mathematics · Mathematics 2017-09-29 Gavriel Yarmish , Joshua Yarmish , Jason Yarmish

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

Logic in Computer Science · Computer Science 2019-01-18 Ziyuan Gao , Sanjay Jain , Bakhadyr Khoussainov , Wei Li , Alexander Melnikov , Karen Seidel , Frank Stephan

In many data analysis pipelines, a basic and time-consuming process is to produce join results and feed them into downstream tasks. Numerous enumeration algorithms have been developed for this purpose. To be a statistically meaningful…

Databases · Computer Science 2025-07-02 Pengyu Chen , Zizheng Guo , Jianwei Yang , Dongjing Miao

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

Probability · Mathematics 2022-09-07 Jimmy He , Huy Tuan Pham , Max Wenqiang Xu

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

Number Theory · Mathematics 2016-11-21 Mei-Chu Chang

In this short note we prove that, if $p$ is an odd prime dividing the order of a sporadic simple group, then with the exception of four groups for $p=3$, all sporadic simple groups are generated by an involution and an element of order $p$.

Group Theory · Mathematics 2015-07-08 David A. Craven

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

Group Theory · Mathematics 2022-02-23 Heiko Dietrich , Bettina Eick , Xueyu Pan

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

Group Theory · Mathematics 2016-11-21 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

Number Theory · Mathematics 2009-08-20 Douglas S. Stones