Related papers: On some sums involving the integral part function

Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote…

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

Let $f$ be a non-CM Hecke eigencusp form of level 1 and fixed weight, and let $\{\lambda_f(n)\}_n$ be its sequence of normalized Fourier coefficients. We show that if $K/ \mathbb{Q}$ is any number field, and $\mathcal{N}_K$ denotes the…

We establish a principal value integral formula, for the residue of the largest non-trivial candidate pole of the real or complex local zeta function associated to an analytic germ f, which is non-degenerate with respect to its Newton…

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

A well-studied statistic of an integer partition is the size of its Durfee square. In particular, the number $D_k (n)$ of partitions of $n$ with Durfee square of fixed size $k$ has a well-known simple rational generating function. We study…

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Let n and k be positive integers with and k < n. Then of course SU(k,1) is contained into SU(n,1). Moreover, which is less clear - but proved by Khoroshkin -, the representation theory of SU(k,1) at the generalized infinitesimal character…

We introduce a class of integral theorems based on cyclic functions and Riemann sums approximating integrals. The Fourier integral theorem, derived as a combination of a transform and inverse transform, arises as a special case. The…

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

Let $\lambda$ denote the Liouville function. We show that as $X \rightarrow \infty$, $$ \int_{X}^{2X} \sup_{\alpha} \left | \sum_{x < n \leq x + H} \lambda(n) e(-\alpha n) \right | dx = o ( X H) $$ for all $H \geq X^{\theta}$ with $\theta >…

In this paper, we evaluate asymptotically a smoothed version of the sum \[ \displaystyle \sideset{}{^*}\sum_{d \leq X} \left( \sum_{n \leq Y} \lambda_f(n)\Big(\frac{8d}{n}\Big)\right)^2, \] where $\Big ( \frac{8d}{\cdot}\Big )$ is the…

Let $f(n)$ denote the maximum sum of the side lengths of $n$ non-overlapping squares packed inside a unit square. We prove that $f(n^2+1) = n$ for all positive integers $n$ if and only if the sum $\sum_{k\geq 1}(f(k^2+1)-k)$ converges. We…

For each prime $\ell$, let $|\cdot|_\ell$ be an extension to $\bar \Q$ of the usual $\ell$-adic absolute value on $\Q$. Suppose $g(z) = \sum_{n=0}^\infty c(n)q^n \in M_{k+\half}(N)$ is an eigenform whose Fourier coefficients are algebraic…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…

We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers…

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…