相关论文: A Conjecture on Primes and a Step towards Justific…

We continue our recent work on averages for ternary additive problems with powers of prime numbers.

We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…

We will prove the Brannan conjecture for particular values of the parameter. The basic tool of the study is an integral representation published in a recent work [3].

Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…

We introduce a new method in the attempt to prove the Jacobian conjecture. In the complex dimension 2 case, we apply this method to prove some new results related the Jacobian conjecture.

We present a deterministic relationship between relative primes and twin primes in successively larger sequences of the natural numbers. This enables setting a finite lower limit on the occurrence of actual twin primes in an unbounded…

In this work, we discuss a number game that develops in a manner similar to that on which Gilbreath's conjecture on iterated absolute differences between consecutive primes is formulated. In our case the action occurs at the exponent level…

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

In this note, we generalize an ancient Greek inequality about the sequence of primes to the cases of arithmetic progressions even multivariable polynomials with integral coefficients. We also refine Bouniakowsky's conjecture [16] and…

Recently, Moret\'o and Rizo proposed a conjecture, known as the Picky Conjecture, proposing new character correspondences extending the McKay Conjecture. We prove the Picky Conjecture for all quasi-simple groups of Lie type for non-defining…

We resolve the function field analogue of the conjecture concerning distribution of twin primes in arithmetic progression.

A conjecture concerning some pairs of interfering estimates for some integrals is formulated in three equivalent versions. Its importance for the the Paley problem for plurisubharmonic functions and for certain classes of extremal problems…

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…

Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.

A new explicit formula is proved for the contribution of the major arcs in the Goldbach and Generalized Twin Prime Problem, in which the level of the major arcs can be chosen very high. This will have many applications in the approximations…

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…

We develop a theory of modulus triples, for future motivic applications.

Subset models provide a new semantics for justifcation logic. The main idea of subset models is that evidence terms are interpreted as sets of possible worlds. A term then justifies a formula if that formula is true in each world of the…

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…