Related papers: A remark on weighted average multiplicities in pri…

We consider multiple and set-indexed sums of random vectors taking values in Euclidean space of growing dimension. It is shown that, when viewed as finite metric spaces, the sets of values of such sums converge in probability. The limit is…

We investigate sums of mixed powers involving two squares and three biquadrates. In particular, subject to the truth of the Generalised Riemann Hypothesis and the Elliott-Halberstam Conjecture, we show that all large natural numbers n with…

Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…

In this paper, we study the probability that some weighted partial sums of a random multiplicative function $f$ are positive. Applying the characteristic decomposition, we obtain that if $S$ is a non-empty subset of the multiplicative…

Hyperuniform particle arrangements are characterized by a local number variance that grows more slowly than the volume of the observation window. We generalize this concept to describe particle systems in which particles carry weights:…

We study the fair allocation of indivisible chores among agents with asymmetric weights. Among the various fairness notions, weighted maximin share (WMMS) stands out as particularly compelling. However, whether WMMS admits a constant-factor…

We evaluate multiple polylogarithm values at sixth roots of unity up to weight six, i.e. of the form $G(a_1,\ldots,a_w;1)$ where the indices $a_i$ are equal to zero or a sixth root of unity, with $a_1\neq 1$. For $w\leq 6$, we present bases…

In this article, we study the convergence behaviour of the classical generalized Max Product exponential sampling series in the weighted space of log-uniformly continuous and bounded functions. We derive basic convergence results for both…

We prove that the condition \begin{equation} \sum_{n=1}^\infty\frac{1}{nw(n)}<\infty \end{equation} is necessary for an increasing sequence of numbers $w(n)$ to be an almost everywhere unconditional convergence Weyl multiplier for the…

The frequentist method of simulated minimum distance (SMD) is widely used in economics to estimate complex models with an intractable likelihood. In other disciplines, a Bayesian approach known as Approximate Bayesian Computation (ABC) is…

For a natural number $m$, generalized $m$-gonal numbers are defined by the formula $p_m(x)=\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in \mathbb Z$. In this paper, we determine a criterion on $a,b,c,m$ for which the weighted ternary sum…

Weighted model counting (WMC) is the task of computing the weighted sum of all satisfying assignments (i.e., models) of a propositional formula. Similarly, weighted model sampling (WMS) aims to randomly generate models with probability…

A constant weight binary code consists of $n$-bit binary codewords, each with exactly $w$ bits equal to 1, such that any two codewords are at least Hamming distance $d$ apart. $A(n,d,w)$ is the maximum size of a constant weight binary code…

We determine the Waring rank of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups.

In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…

Let $A$ be an algebra over any field. We do not assume that $A$ has an identity. The \emph{multiplier algebra} $M(A)$ is a unital algebra associated to $A$. If we require the product in $A$ to be non-degenerate (as a bilinear form), the…

Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the…

Approximate Bayesian Computation (ABC) is a popular computational method for likelihood-free Bayesian inference. The term "likelihood-free" refers to problems where the likelihood is intractable to compute or estimate directly, but where it…

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…