English
Related papers

Related papers: Erd\H{o}s inequality for primitive sets

200 papers

With $\Fq$ the finite field of $q$ elements, we investigate the following question. If $\gamma$ generates $\Fqn$ over $\Fq$ and $\beta$ is a non-zero element of $\Fqn$, is there always an $a \in \Fq$ such that $\beta(\gamma + a)$ is a…

Number Theory · Mathematics 2018-12-11 Geoff Bailey , Stephen D. Cohen , Nicole Sutherland , Tim Trudgian

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

Number Theory · Mathematics 2019-03-29 Christian Axler

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Number Theory · Mathematics 2021-03-19 Sándor Z. Kiss , Csaba Sándor

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Group Theory · Mathematics 2020-09-01 Timothy C. Burness , Adam R. Thomas

A finite separable extension $E$ of a field $F$ is called primitive if there are no intermediate extensions. It is called solvable if the group $\mathrm{Gal}(\hat E|F)$ of automorphisms of its galoisian closure $\hat E$ over $F$ is…

Number Theory · Mathematics 2017-02-14 Chandan Singh Dalawat

A nonnegative matrix $A$ is said to be {\it primitive} if for some positive integer $m$, entries in $A^m$ are positive, notationally represented as $A^m>0.$ The smallest such $m$ is called the {\it exponent} of $A$, denoted $exp(A).$ For…

Combinatorics · Mathematics 2019-03-26 Monimala Nej , A. Satyanarayana Reddy

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

Logic · Mathematics 2018-05-23 Damir D. Dzhafarov , Joseph R. Mileti

In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].

Combinatorics · Mathematics 2016-11-25 Pingzhi Yuany , Zilong He , Lihua You

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Number Theory · Mathematics 2019-02-20 Eric Naslund

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements and $r$ be a positive divisor of $q^n-1$. An element $\alpha \in \mathbb{F}_{q^n}^*$ is called $r$-primitive if its multiplicative order is $(q^n-1)/r$. Also, $\alpha \in…

Number Theory · Mathematics 2022-10-24 Josimar J. R. Aguirre , Victor G. L. Neumann

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Number Theory · Mathematics 2023-03-13 Eric Naslund

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Number Theory · Mathematics 2018-04-13 Romeo Meštrović

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

Number Theory · Mathematics 2025-04-16 Genheng Zhao

If $G$ is a group of permutations of a set $\Omega$ and $\alpha \in \Omega$, then the {\em $\alpha$-suborbits} of $G$ are the orbits of the stabilizer $G_\alpha$ on $\Omega$. The cardinality of an $\alpha$-suborbit is called a {\em…

Group Theory · Mathematics 2012-01-05 Simon M. Smith

In this paper, the notion of a uniformly distributed systems of elements on the variety of metabelian Lie algebras is introduced. This notion is analogous to one of a measure preserving systems of elements on group varieties. As the main…

Rings and Algebras · Mathematics 2014-04-16 Evgeny Poroshenko , Evgeniy Timoshenko

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

Combinatorics · Mathematics 2020-04-24 Simone Costa , Marco Antonio Pellegrini

Erd\H{o}s asked whether there are infinitely many finite sets of distinct primes $p_1<\cdots<p_k$ and positive integers $m$ such that \begin{equation}\label{eq:erdos-original} \frac1{p_1}+\cdots+\frac1{p_k}=1-\frac1m. \end{equation} This is…

Number Theory · Mathematics 2026-05-22 Han Wang

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. Furthermore, let $\mid A(n)\mid$ denote the cardinality of the set $A(n)=A\cap [n]$. The limit…

Combinatorics · Mathematics 2022-06-28 Ljuben Mutafchiev

Dirichlet's proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Euler's earlier work on the…

History and Overview · Mathematics 2014-11-25 Peter Gustav Lejeune Dirichlet

We prove that every group ring of a non-abelian locally free group which is the union of an ascending sequence of free groups is primitive. In particular, every group ring of a countable non-abelian locally free group is primitive. In…

Rings and Algebras · Mathematics 2010-10-26 Tsunekazu Nishinaka