English
Related papers

Related papers: Dedekind Sums with Even Denominators

200 papers

We prove new explicit conditional bounds for the residue at $s=1$ of the Dedekind zeta-function associated to a number field. Our bounds are concrete and all constants are presented with explicit numerical values.

Number Theory · Mathematics 2026-03-11 Stephan Ramon Garcia , Loïc Grenié , Ethan Simpson Lee , Giuseppe Molteni

Let f(z) = sum_n a(n) n^{(k-1)/2} e(nz) be a cusp form for Gamma_0(N), character chi and weight k geq 4. Let q(x) = x^2 + sx + t be a polynomial with integral coefficients. It is shown that sum_{n \leq X} a(q(n)) = cX + O(X^{6/7+eps}) for…

Number Theory · Mathematics 2008-04-01 Valentin Blomer

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

By considering a limiting form of the q-Dixon_4\phi_3 summation, we prove a weighted partition theorem involving odd parts differing by >= 4. A two parameter refinement of this theorem is then deduced from a quartic reformulation of…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

For each $s\in \mathbb R$ and $n\in \mathbb N$, let $\sigma_s(n) = \sum_{d\mid n}d^s$. In this article, we give a comparison between $\sigma_s(an+b)$ and $\sigma_s(cn+d)$ where $a$, $b$, $c$, $d$, $s$ are fixed, the vectors $(a,b)$ and…

Number Theory · Mathematics 2021-10-04 Prapanpong Pongsriiam

We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…

Combinatorics · Mathematics 2016-02-24 Jan de Gier , Michael Wheeler

Let $X$ be a convex curve in the plane (say, the unit circle), and let $\mathcal S$ be a family of planar convex bodies, such that every two of them meet at a point of $X$. Then $\mathcal S$ has a transversal $N\subset\mathbb R^2$ of size…

Computational Geometry · Computer Science 2015-09-08 Sathish Govindarajan , Gabriel Nivasch

Let $n \ge 2$ be a natural number, $M$ a real $n \times n$ matrix, $s$ the sum of the entries of $M$ and $q$ the sum of their squares. With $\alpha := s/n$ and $\beta := q/n$, Gasper's determinant bound says that $ |\det M| \le…

Combinatorics · Mathematics 2018-04-10 Markus Sigg

We establish a coboundary condition for a sequence of ergodic sums (i.e.~Birkhoff partial sums) to be almost surely uniformly distributed mod $1$. Applications are given when the sequence is generated by a Gibbs-Markov map. In particular,…

Dynamical Systems · Mathematics 2025-03-03 Albert M. Fisher , Xuan Zhang

Let $\mathfrak{B}$ denote the collection of odd primitive Gaussian integers and $n\mapsto b(n)$ denote the characteristic function of elements of $\mathfrak{B}$. We prove that the exponential sum $ S(\alpha; N)=\sum_{n\le…

Number Theory · Mathematics 2026-04-13 E. Malavika , Olivier Ramaré

We prove the following result: Let B be a smooth, irreducible, quasi-projective variety over the complex numbers and assume that B has a projective compactification \bar{B} such that \bar{B} - B is of codimension at least two in \bar{B}.…

Algebraic Geometry · Mathematics 2007-05-23 Najmuddin Fakhruddin

A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…

Group Theory · Mathematics 2024-05-24 James Howie

Let $k$ be a global field, let $A$ be a Dedekind domain with $\text{Quot}(A) = k$, and let $K$ be a finitely generated field. Using a unified approach for both elliptic curves and Drinfeld modules $M$ defined over $K$ and having a trivial…

Number Theory · Mathematics 2020-02-21 Alina Carmen Cojocaru , Nathan Jones

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…

Number Theory · Mathematics 2025-12-16 E. Kowalski , Ph. Michel , W. Sawin

In the present paper, the fundamental aim is to consider a p-adic continuous function for an odd prime to inside a p-adic q-analogue of the higher order modified Dedekind-type sums related to q-Genocchi polynomials with weight alpha by…

General Mathematics · Mathematics 2013-10-03 Serkan Araci , Erdoğan Şen , Mehmet Acikgoz

We examine exponential sums of the form $\sum_{n \le X} w(n) e^{2\pi i\alpha n^k}$, for $k=1,2$, where $\alpha$ satisfies a generalized Diophantine approximation and where $w$ are different arithmetic functions that might be multiplicative,…

Number Theory · Mathematics 2024-12-31 Anji Dong , Nicolas Robles , Alexandru Zaharescu , Dirk Zeindler

For a wide range of $x$ and $y$ we show that ${\Cal S}(x,y)$, the set of integers below $x$ composed only of prime factors below $y$, is equidistributed in the reduced residue classes $\pmod q$ for all $q<y^{4\sqrt{e}-\epsilon}$. This…

Number Theory · Mathematics 2007-07-04 K. Soundararajan

In this paper we mainly study sums of four rational squares with certain restrictions. Let $\mathbb Q_{\ge0}$ be the set of nonnegative rational numbers. We establish the following four-square theorem for rational numbers: For any…

Number Theory · Mathematics 2022-01-26 Zhi-Wei Sun

A subset $\mathcal{A}\subseteq\mathbb{Z}$ is called $s$-almost square universal if every sufficiently large positive integer can be written as a sum of at most $s$ squares of integers from $\mathcal{A}$. In this article, we study the…

Number Theory · Mathematics 2026-02-17 Daejun Kim

A code $C \colon \{0,1\}^k \to \{0,1\}^n$ is a $q$-query locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \in \{0,1\}^k$ with good confidence by querying a corrupted string $\tilde{x}$ of the…

Computational Complexity · Computer Science 2025-08-26 Oliver Janzer , Peter Manohar