中文
相关论文

相关论文: A Pseduo-Twin Primes Theorem

200 篇论文

In 1991 Effros and Ruan conjectured that a certain Grothendieck-type inequality for a bilinear form on C$^*$-algebras holds if (and only if) the bilinear form is jointly completely bounded. In 2002 Pisier and Shlyakhtenko proved that this…

算子代数 · 数学 2015-05-13 Uffe Haagerup , Magdalena Musat

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

组合数学 · 数学 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

数论 · 数学 2015-02-27 Thomas Reuss

We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…

数论 · 数学 2007-05-23 Graham Everest , Igor E Shparlinski

We prove a two-dimensional $\mathbb F_p$-Selberg integral formula, in which the two-dimensional $\mathbb F_p$-Selberg integral $\bar S(a,b,c;l_1,l_2)$ depends on positive integer parameters $a,b,c$, $l_1,l_2$ and is an element of the finite…

代数几何 · 数学 2024-09-16 Alexander Varchenko

For a set of primes $\mathcal{P}$, let $\Psi(x, \mathcal{P})$ be the number of positive integers $n \leq x$ all of whose prime factors lie in $\mathcal{P}$. In this paper we classify the sets of primes $\mathcal{P}$ such that $\Psi(x,…

数论 · 数学 2015-09-09 Kaisa Matomäki , Xuancheng Shao

Let $n$ be a positive integer, $p$ be an odd prime and integers $a,b \not= 0$ with $gcd(a,b)=1$, $p \nmid ab$, and $p|(a^n \pm b^n)$, we prove the identity $$\nu_p(a^n \pm b^n)-\nu_p(n)=\nu_p(a^{p-1}-b^{p-1}).$$ An unintended interesting…

数论 · 数学 2021-12-09 Kok Seng Chua

We introduce a novel sieve for prime numbers based on detecting topological obstructions in a M\"obius-transformed rational metric space. Unlike traditional sieves which rely on divisibility, our method identifies primes as those numbers…

综合数学 · 数学 2025-07-24 Paul Alexander Bilokon

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

数论 · 数学 2017-11-07 Xianzu Lin

Let c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x^1/2 and ab is less than n^c. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce…

数论 · 数学 2020-11-24 Roger Baker , Glyn Harman

We introduce the N\'eron-Severi Lie algebra of a Soergel module and we determine it for a large class of Schubert varieties. This is achieved by investigating which Soergel modules admit a tensor decomposition. We also use the…

表示论 · 数学 2017-01-06 Leonardo Patimo

Let $\mathfrak{g}$ be a vector space and $[,],[,]'$ be a pair of Lie brackets on $\mathfrak{g}$. By definition they are compatible if $[,]+[,]'$ is again a Lie bracket. Such pairs play important role in bihamiltonian and $r$-matrix…

微分几何 · 数学 2012-08-09 Andriy Panasyuk

Machine learning algorithms may have disparate impacts on protected groups. To address this, we develop methods for Bayes-optimal fair classification, aiming to minimize classification error subject to given group fairness constraints. We…

机器学习 · 统计学 2025-08-28 Xianli Zeng , Kevin Jiang , Guang Cheng , Edgar Dobriban

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

数论 · 数学 2022-11-22 Matteo Bordignon , Ethan Simpson Lee

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of $q$-ary $\overline{2}$-separable codes that improves recent results of Wang for any $q\geq 13$. For the case $q=2$, we recover…

组合数学 · 数学 2021-06-25 Stefano Della Fiore , Marco Dalai

We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is…

数论 · 数学 2019-06-24 Jon S. Birdsey , Geza Schay

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 investigate splitting-type variational problems with some linear growth conditions. For balanced solutions of the associated Euler-Lagrange equation we receive a result analogous to Bernstein's theorem on non-parametric minimal surfaces.…

偏微分方程分析 · 数学 2023-03-17 Michael Bildhauer , Bernhard Farquhar , Martin Fuchs

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

数论 · 数学 2025-06-02 Lasse Grimmelt , Jori Merikoski

This paper provides a commentary and guide to Appendix 8 of Laws Of Form, which is a chapter (appendix) on number theory in the book Laws of Form by Spencer-Brown. (Spencer-Brown,Laws Of Form,Revised Seventh English edition. Bohmeier…

数论 · 数学 2025-11-11 J. M. Flagg , Louis H. Kauffman , Divyamaan Sahoo