Related papers: The large sieve with power moduli for $\mathbb{Z}[…

We study a generalization of the classical Marcinkiewicz-Zygmund inequalities. We relate this problem to the sampling sequences in the Paley-Wiener space and by using this analogy we give sharp necessary and sufficient computable conditions…

Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…

We consider the problem of sums of dilates in groups of prime order. We show that given $A\subset \Z{p}$ of sufficiently small density then $$\big| \lambda_{1}A+\lambda_{2}A+...+ \lambda_{k}A \big|…

The $P = W$ conjecture identifies the perverse filtration of the Hitchin system on the cohomology of the moduli space of Higgs bundles with the weight filtration of the corresponding character variety. In this paper, we introduce an…

We prove the modularity of a positive proportion of abelian surfaces over $\mathbf{Q}$. More precisely, we prove the modularity of abelian surfaces which are ordinary at $3$ and are $3$-distinguished, subject to some assumptions on the…

In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for…

In this paper we propose a method for proving some exponential inequalities based on power series expansion and analysis of derivations of the corresponding functions. Our approach provides a simple proof and generates a new class of…

We employ a generalised version of Heath-Brown's square sieve in order to establish an asymptotic estimate of the number of solutions $a, b \in \mathbb N$ to the equations $a+b=n$ and $a-b=n$, where $a$ is $k$-free and $b$ is $l$-free. This…

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…

A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses…

All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…

In this paper, we will introduce an extension to the Collatz's conjecture. This conjecture may be seen as a general conjecture that unifies the Collatz one together with many other similar conjectures. For instance, we propose our new…

We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…

We introduce the notion of generalized Weyl modules for twisted current algebras. We study their representation-theoretic and combinatorial properties and connection to the theory of nonsymmetric Macdonald polynomials. As an application we…

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

The reproducibility crisis has led to an increasing number of replication studies being conducted. Sample sizes for replication studies are often calculated using conditional power based on the effect estimate from the original study.…

In a previous paper with Kashyap we generalized the theory of $W^*$-modules to the setting of modules over nonselfadjoint dual operator algebras, obtaining the class of weak*-rigged modules. The present paper and its contemporaneous…

We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…

The Schulze method is a voting rule widely used in practice and enjoys many positive axiomatic properties. While it is computable in polynomial time, its straight-forward implementation does not scale well for large elections. In this…

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding M\"obius prime-function, which in the limit of infinitely large primes becomes identical to the original M\"obius function.…