English
Related papers

Related papers: On the average value of the minimal Hamming multip…

200 papers

A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…

Number Theory · Mathematics 2025-07-08 Judy Ann Donato

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

Number Theory · Mathematics 2024-06-07 Ofir Gorodetsky , Mo Dick Wong

In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…

Information Theory · Computer Science 2021-06-08 Fei Li

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

We develop some of the basic theory for the obstacle problem on Riemannian Manifolds, and we use it to establish a mean value theorem. Our mean value theorem works for a very wide class of Riemannian manifolds and has no weights at all…

Differential Geometry · Mathematics 2017-04-26 Brian Benson , Ivan Blank , Jeremy LeCrone

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

We prove a pointwise convergence result for additive ergodic averages associated with certain multiplicative actions of the Gaussian integers. We derive several applications in dynamics and number theory, including: (i) Wirsing's theorem…

Dynamical Systems · Mathematics 2024-03-07 Sebastián Donoso , Anh N. Le , Joel Moreira , Wenbo Sun

A celebrated result of Hal\'asz describes the asymptotic behavior of the arithmetic mean of an arbitrary multiplicative function with values on the unit disc. We extend this result to multilinear averages of multiplicative functions…

Number Theory · Mathematics 2016-06-01 Nikos Frantzikinakis , Bernard Host

We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in the…

Logic · Mathematics 2009-02-03 Antonin Kucera , Theodore A. Slaman

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

Number Theory · Mathematics 2010-03-02 Gautami Bhowmik , Jan-Christoph Schlage-Puchta

Let $T$ be a power bounded Hilbert space operator without unimodular eigenvalues. We show that the subsequential ergodic averages $N^{-1}\sum_{n=1}^N T^{a_n}$ converge in the strong operator topology for a wide range of sequences $(a_n)$,…

Functional Analysis · Mathematics 2020-08-19 Tanja Eisner , Vladimir Müller

We introduce the new notion of a conjugate weight function and provide a detailed study of this operation and its properties. Then we apply this knowledge to study classes of ultradifferentiable functions defined in terms of fast growing…

Functional Analysis · Mathematics 2026-03-31 Gerhard Schindl

We extend a lower bound of Munshi on sums over divisors of a number $n$ which are less than a fixed power of $n$ from the squarefree case to the general case. In the process we prove a lower bound on the entropy of a geometric distribution…

Number Theory · Mathematics 2018-06-05 Zarathustra Brady

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

Number Theory · Mathematics 2018-12-27 Jean-Marie De Koninck , Patrick Letendre

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

Number Theory · Mathematics 2016-07-27 Titus Hilberdink , László Tóth

For a family of weight functions invariant under a finite reflection group, the boundedness of a maximal function on the unit sphere is established and used to prove a multiplier theorem for the orthogonal expansions with respect to the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Feng Dai , Yuan Xu

We establish lower bounds for all weighted even moments of primes up to $X$ in intervals which are in agreement with a conjecture of Montgomery and Soundararajan. Our bounds hold unconditionally for an unbounded set of values of $X$, and…

Number Theory · Mathematics 2020-09-15 Régis de la Bretèche , Daniel Fiorilli

Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…

Information Theory · Computer Science 2015-02-04 Olav Geil , Stefano Martin , Ryutaroh Matsumoto , Diego Ruano , Yuan Luo

We present the extensions of the Siegel integral formula ([10]), which counts the vectors of the random lattice, to the context of counting its sublattices and flags. Perhaps surprisingly, it turns out that many quantities of interest…

Number Theory · Mathematics 2022-03-24 Seungki Kim

For a set $A$ of $n$ people and a set $B$ of $m$ items, with each person having a preference list that ranks all items from most wanted to least wanted, we consider the problem of matching every person with a unique item. A matching $M$ is…

Discrete Mathematics · Computer Science 2016-10-04 Suthee Ruangwises , Osamu Watanabe