中文
相关论文

相关论文: G\'al-type GCD sums beyond the critical line

200 篇论文

Suppose that $\{a_j\}\in \ell^1$, and suppose that for any sequence $(t_n)$ of integers there exits a constant $C_1>0$ such that $$\sharp\left\{k\in\mathbb{Z}:\sup_{n\geq 1}\left|\sum_{i\in \mathcal{B}_n-t_n}…

经典分析与常微分方程 · 数学 2022-08-04 Sakin Demir

The least $k$ admitting a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ of a graph $G=(V,E)$ without isolated edges such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$ for every $uv\in E$ is denoted by $\chi'_{\Sigma}(G)$. It has been…

组合数学 · 数学 2019-01-08 Jakub Przybyło

We study the entire function zeta(n,s) which is the sum of l to the power -s, where l runs over the positive eigenvalues of the Laplacian of the circular graph C(n) with n vertices. We prove that the roots of zeta(n,s) converge for n to…

谱理论 · 数学 2013-12-17 Oliver Knill

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…

组合数学 · 数学 2026-03-31 Varun Sivashankar

As well known, the important hypothesis formulated by B.G. RIEMANN in 1859 states that all non-trivial zeroes of the Zeta function $Z(s)=\sum_{n=1}^{\infty } n^{-s}$ should fall on the Critical Line (C.L.) $Re(s)=\frac{1}{2}$.\\ Although…

综合数学 · 数学 2019-02-19 Michele Fanelli , Alberto Fanelli

Sums of the form $\sum_{n\le x}E^k(n) (k\in{\bf N}$ fixed) are investigated, where $$ E(T) = \int_0^T|\zeta(1/2+it)|^2 dt - T\Bigl(\log {T\over2\pi} + 2\gamma -1\Bigr)$$ is the error term in the mean square formula for $|\zeta(1/2+it)|$.…

数论 · 数学 2008-11-06 Yann Bugeaud , Aleksandar Ivić

A function $F:\mathbb{F}_{2}^{n}\to \mathbb{F}_{2}^{m}$ is called $k$th-order sum-free if the sum of its values over any $k$-dimensional affine subspace of $\mathbb{F}_2^n$ is non-zero. Carlet recently introduced this notion and constructed…

信息论 · 计算机科学 2026-05-25 Philipp Heering , Christian Kaspers , Vladislav Taranchuk

A {\it fractional matching} of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ so that $\sum_{e \in \Gamma(v)} f(e) \le 1$ for each $v\in V(G)$, where $\Gamma(v)$ is the set of edges incident to $v$. The {\it fractional…

组合数学 · 数学 2016-03-10 Suil O

In a recent work, Gun and co-workers have proposed that $\,\sum_{n=-\infty}^{\infty}{(n+\alpha)^{-k}}\,$ is a transcendental number for all integer $\,k$, $k > 1$, and $\,\alpha \in \mathbb{Q} \backslash \mathbb{Z}$. Here in this work, this…

数论 · 数学 2017-09-13 F. M. S. Lima

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1^2+\cdots+ n_k^2\le x} F(n_1,\ldots,n_k)$, taken over the $k$-dimensional spherical region $\{(n_1,\ldots,n_k)\in {\Bbb Z}^k: n_1^2+\cdots+ n_k^2\le x\}$, where $F:{\Bbb…

数论 · 数学 2024-01-04 Randell Heyman , László Tóth

In recent years the question of maximizing GCD sums regained interest due to its firm link with large values of $L$-functions. In the present paper we initiate the study of minimizing for positive weights~$w$ of normalized $L^1$- norm the…

数论 · 数学 2019-07-02 Régis de la Bretèche , Marc Munsch

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

数论 · 数学 2026-02-04 Christopher Atherfold

A graph is diameter-$k$-critical if its diameter equals $k$ and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical graph $G$ of order $n$, $e(G) \leq \lfloor…

组合数学 · 数学 2024-09-27 Xiaolin Wang , Yanbo Zhang , Xiutao Zhu

The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…

综合数学 · 数学 2016-05-25 Jeonwon Kim

Consider the approximation $\tilde{Z}_N(s) = \sum_{n=1}^N n^{-s} + \chi(s) \sum_{n=1}^N n^{1-s}$ of the Riemann zeta function $\zeta(s)$, where $\chi(s)$ is the ratio of the gamma functions. This arise from the approximate functional…

数论 · 数学 2024-12-20 Arindam Roy , Kevin You

Let $R^{\frac{1}{2}}$ be a large integer, and $\omega$ be a nonnegative weight in the $R$-ball $B_R=[0,R]^2$ such that $\omega(B_R)\le R$. For any complex sequence $\{a_n\}$, define the quadratic exponential sum \[…

经典分析与常微分方程 · 数学 2025-11-04 Xuerui Yang

Inspired by a question asked on the list {\tt mathfun}, we revisit {\em Kempner-like series}, i.e., harmonic sums $\sum' 1/n$ where the integers $n$ in the summation have ``restricted'' digits. First we give a short proof that $\lim_{k \to…

数论 · 数学 2024-03-25 Jean-Paul Allouche , Claude Morin

Let $\alpha \in (1/2,1)$ be fixed. We prove that $$ \max_{0 \leq t \leq T} |\zeta(\alpha+it)| \geq \exp\left(\frac{c_\alpha (\log T)^{1-\alpha}}{(\log \log T)^\alpha}\right) $$ for all sufficiently large $T$, where we can choose $c_\alpha =…

数论 · 数学 2015-09-01 Christoph Aistleitner

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

数论 · 数学 2024-05-02 Alexander P. Mangerel , Yichen You

The fractional matching number of a graph G, is the maximum size of a fractional matching of G. The following sharp lower bounds for a graph G of order n are proved, and all extremal graphs are characterized in this paper. (1)The sum of the…

组合数学 · 数学 2021-05-31 Ting Yang , Xiying Yuan