中文
相关论文

相关论文: Product of difference sets of set of primes

200 篇论文

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

数论 · 数学 2021-09-23 Lucile Devin , Xianchang Meng

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

数论 · 数学 2016-12-30 Javier Cilleruelo , Melvyn B. Nathanson

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

数论 · 数学 2013-01-08 William D. Banks , Greg Martin

Let $\mathcal{P}({\bf N})$ be the power set of $\bf N$. An upper density (on $\bf N$) is a non\-decreasing and subadditive function $\mu^\ast: \mathcal{P}({\bf N})\to\bf R$ such that $\mu^\ast({\bf N}) = 1$ and $\mu^\ast(k \cdot X + h) =…

经典分析与常微分方程 · 数学 2018-05-15 Paolo Leonetti , Salvatore Tringali

We compare the size of the difference set $A-A$ to that of the set $kA$ of $k$-fold sums. We show the existence of sets such that $|kA| < |A-A|^{a_k}$ with $a_k<1$.

数论 · 数学 2016-01-19 Imre Z. Ruzsa

Green showed that, conditional on GRH, a subset $A \subseteq [N]$ with $\mid A \mid \gg_{\epsilon} N^{\frac{11}{12}+\epsilon}$ must contain two elements whose difference is $p-1$ for $p$ a prime. We prove an analogous unconditional result…

数论 · 数学 2025-11-03 Aleksandra Kowalska

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

度量几何 · 数学 2022-03-23 Brett Leroux , Luis Rademacher

We study the number of $k$-element sets $A \subset \{1,\ldots,N\}$ with $|A + A| \leq K|A|$ for some (fixed) $K > 0$. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a…

组合数学 · 数学 2014-02-05 Ben Green , Robert Morris

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

数论 · 数学 2011-01-26 Zhi-Wei Sun , Wei Zhang

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

综合数学 · 数学 2018-02-08 Richard Williamson

A graph $G$ is a $k$-prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the product of at most $k$ primes. A graph has prime product…

组合数学 · 数学 2016-07-19 Joshua D. Laison , Yumi Li , Jeffrey Schreiner-McGraw , Colin Starr

Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degree at most k, then F is locally k-wide. Bounds on the size of…

组合数学 · 数学 2016-09-06 Emanuel Knill

Let g be a complex finite-dimensional simple Lie algebra. Given a positive integer k and a dominant weight \lambda, we define a preorder on the set $P(\lambda, k)$ of k-tuples of dominant weights which add up to \lambda. Let $P(\lambda,…

表示论 · 数学 2016-01-20 Vyjayanthi Chari , Ghislain Fourier , Daisuke Sagaki

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

逻辑 · 数学 2023-11-03 Uri Andrews , Gabriel Conant , Isaac Goldbring

Let $pod_{\ell}(n)$ be the number of $\ell$-regular partitions of $n$ with distinct odd parts. In this article, prove that for any positive integer $k$, the set of non-negative integers $n$ for which $pod_{\ell}(n)\equiv 0 \pmod{p^{k}}$ has…

数论 · 数学 2021-09-22 Chiranjit Ray

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

数论 · 数学 2019-06-19 Sílvia Casacuberta

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we…

数论 · 数学 2021-03-30 Ilya D. Shkredov

Let $\mathcal{P}$ be the set of primes and $\mathbb{N}$ the set of positive integers. Let also $r_1,...,r_t$ be positive real numbers and $R_2(r_1,...,r_t)$ the set of odd integers which can be represented as $$ p+2^{\lfloor…

数论 · 数学 2024-12-17 Yuchen Ding , Wenguang Zhai

We study a pinned variant of Bourgain's theorem, concerning the occurrence of affine copies of $k$-point patterns in $\mathbb{R}^d$. Focusing on the case $k=2$, which corresponds to pinned distances, we show that the classical conclusion…

经典分析与常微分方程 · 数学 2025-09-03 Chenjian Wang

In this paper we prove that the weighted linear combination of products of the k-subsets of an n-set of positive real numbers with weight being the harmonic mean of their reciprocal sets is less than or equal to uniformly weighted sum of…

综合数学 · 数学 2021-05-28 C. P. Anil Kumar