Related papers: Theorems on twin primes-dual case
In this paper, we establish theorems of Bombieri-Vinogradov type and Barban-Davenport-Halberstam type for sparse sets of moduli. As an application, we prove that there exist infinitely many primes of the form $p=am^2+1$ such that $a\leq…
We use double categories to obtain a single theorem characterizing certain exponentiable morphisms of small categories, topological spaces, locales, and posets.
Selberg identified the "parity" barrior, that sieves alone cannot distinguish between integers having an even or odd number of factors. We give here a short and self-contained demonstration of parity breaking using bilinear forms, modeled…
We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.
We exploit a new theory of duality transformations to construct dual representations of models incompatible with traditional duality transformations. Hence we obtain a solution to the long-standing problem of non-Abelian dualities that…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
A natural question about Dedekind sums is to find conditions on the integers $a_1, a_2$, and $b$ such that $s(a_1,b) = s(a_2, b)$. We prove that if the former equality holds then $ b \ | \ (a_1a_2-1)(a_1-a_2)$. Surprisingly, to the best of…
In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…
This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t))…
As a corollary to the recent extraordinary theorem of Maynard and Tao, we re-prove, in a stronger form, a result of Shiu concerning "strings" of consecutive, congruent primes.
A description of dual non-Abelian duality is given, based on the notion of the Drinfeld double. The presentation basically follows the original paper \cite{KS2}, written in collaboration with P. \v Severa, but here the emphasis is put on…
We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…
This note is a sequel to Shu-Xue-Yao's paper \cite{BYY} where the author studied the so-called enhanced groups and related dualities for type $A$. In this note, we continue to investigate the enhanced dualities for classical groups of type…
We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…
We consider a real random variable X represented through a random pair of real random variables (R,T) and a deterministic function u as X=Ru(T). Under some additional assumptions, we prove a limit theorem for (R,T) given X>x, as x tends to…
This paper is a continuation of Arai's paper on derivability conditions for Rosser provability predicates. We investigate the limitations of the second incompleteness theorem by constructing three different Rosser provability predicates…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…