English
Related papers

Related papers: On Primitive Covering Numbers

200 papers

A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…

Number Theory · Mathematics 2025-03-25 Marco Aymone , Ana Paula Chaves , Maria Eduarda Ramos

A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…

Information Theory · Computer Science 2020-08-11 Aditya Potukuchi , Yihan Zhang

This note studies various ways of measuring the complexity of primitive solutions to the equation $A \,+\, B\, + \,C = 0$ and conjectures relating them. We define the insulator $\mathcal I(A,B,C)$ of a primitive solution as the smallest…

Number Theory · Mathematics 2014-01-27 James E. Weigandt

A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is…

Information Theory · Computer Science 2016-05-19 Arkady D'yachkov , Ilya Vorobyev , Nikita Polianskii , Vladislav Shchukin

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Logic in Computer Science · Computer Science 2022-05-25 Ruben Gamboa , Woodrow Gamboa

A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…

Number Theory · Mathematics 2022-04-26 P. -Y. Bienvenu

An element w of the extension E of degree n over the finite field F=GF(q) is called free over F if {w, w^q,...,w^{q^{n-1}}} is a (normal) basis of E/F. The Primitive Normal Basis Theorem, first established in full by Lenstra and Schoof…

Number Theory · Mathematics 2008-10-16 Stephen D. Cohen , Sophie Huczynska

A primitive multiple scheme is a complex Cohen-Macaulay scheme $Y$ such that the associated reduced scheme $X=Y_{red}$ is smooth, irreducible, and that $Y$ can be locally embedded in a smooth variety of dimension $\dim(X)+1$. If $n$ is the…

Algebraic Geometry · Mathematics 2023-06-29 Jean--Marc Drézet

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

Number Theory · Mathematics 2025-02-11 Joshua Zelinsky

A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…

Number Theory · Mathematics 2007-05-23 Simon Davis

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the…

We give several new moduli interpretations of the fibers of certain Shimura varieties over several prime numbers. As a consequence (of our theorem 9.1) one obtains that for every prescribed odd prime characteristic $p$ every bounded…

Algebraic Geometry · Mathematics 2022-07-19 Oliver Bültel

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…

Group Theory · Mathematics 2014-09-09 Luise-Charlotte Kappe , Daniela Nikolova-Popova , Eric Swartz

Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…

General Mathematics · Mathematics 2014-05-14 Zhang Baoshan

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Number Theory · Mathematics 2026-03-03 Tigran Hakobyan

Let $O_L$ be the ring of integers of a number field $L$. Write $q = e^{2 \pi i z}$, and suppose that $$f(z) = \sum_{n \gg - \infty}^{\infty} a_f(n) q^n \in M_{k}^{!}(\operatorname{SL}_2(\mathbb{Z})) \cap O_L[[q]]$$ is a weakly holomorphic…

Number Theory · Mathematics 2021-01-19 Spencer Dembner , Vanshika Jain

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

Number Theory · Mathematics 2019-11-13 Pieter Moree , Min Sha

For positive integers $a$ and $b$, we let $[U_n]$ be the Lucas sequence of the first kind defined by \[U_0=0,\quad U_1=1\quad \mbox{and} \quad U_n=aU_{n-1}+bU_{n-2} \quad \mbox{ for $n\ge 2$},\] and let $\pi(m):=\pi_{(a,b)}(m)$ be the…

Number Theory · Mathematics 2023-02-21 Lenny Jones

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev