English
Related papers

Related papers: A note on exponential-M\"{o}bius sums over $\mathb…

200 papers

Let $X \in \{0,\ldots,n \}$ be a random variable, with mean $\mu$ and standard deviation $\sigma$ and let \[f_X(z) = \sum_{k} \mathbb{P}(X = k) z^k, \] be its probability generating function. Pemantle conjectured that if $\sigma$ is large…

Probability · Mathematics 2019-08-29 Marcus Michelen , Julian Sahasrabudhe

In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169…

Combinatorics · Mathematics 2007-05-23 Chunhui Lai

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

Number Theory · Mathematics 2025-06-02 Lasse Grimmelt , Jori Merikoski

Assuming the Riemann Hypothesis, we provide explicit upper bounds for moduli of $S(t)$, $S_1(t)$, and $\zeta\left(1/2+\mathrm{i}t\right)$ while comparing them with recently proven unconditional ones. As a corollary we obtain a conditional…

Number Theory · Mathematics 2021-10-14 Aleksander Simonič

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2 + it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/(2\pi))$ with $\Delta^*(x) = -…

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić

We improve on previous upper bounds for the $q$th norm of the partial sums of the Riemann zeta function on the half line when $0<q\leqslant 1$. In particular, we show that the 1-norm is bounded above by $(\log N)^{1/4}(\log\log N)^{1/4}$.

Number Theory · Mathematics 2017-03-28 Winston Heap

Let $\Delta(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $\Delta(d,n)$ established by Kalai and Kleitman in 1992. This yields…

Optimization and Control · Mathematics 2016-04-18 Shinji Mizuno , Noriyoshi Sukegawa

In this note we provide a new, algebraic proof of the excessive Laurent phenomenon for mutations of potentials (in the sense of [Galkin S., Usnich A., Preprint IPMU 10-0100, 2010]) by introducing to this theory the analogue of the upper…

Representation Theory · Mathematics 2013-01-23 John Alexander Cruz Morales , Sergey Galkin

In 2023, G\"unt\"urk and Thao proved that the sequence $(x^{(n)})_{n\in\mathbb{N}}$ generated by random (relaxed) projections drawn from a finite collection of innately regular closed subspaces in a real Hilbert space satisfies…

Optimization and Control · Mathematics 2026-01-13 Heinz H. Bauschke , Tran Thanh Tung

We prove that for sets $A, B, C \subset \mathbb{F}_p$ with $|A|=|B|=|C| \leq \sqrt{p}$ and a fixed $0 \neq d \in \mathbb{F}_p$ holds $$ \max(|AB|, |(A+d)C|) \gg|A|^{1+1/26}. $$ In particular, $$ |A(A+1)| \gg |A|^{1 + 1/26} $$ and $$…

Number Theory · Mathematics 2015-07-21 Dmitrii Zhelezov

In 1914, Hardy proved that infinitely many non-trivial zeros of the Riemann zeta function lie on the critical line using the transformation formula of the Jacobi theta function. Recently the first author obtained an integral representation…

Number Theory · Mathematics 2017-12-25 Atul Dixit , Rahul Kumar , Bibekananda Maji , Alexandru Zaharescu

Answering a question of Jiang and Polyanskii as well as Jiang, Tidor, Yao, Zhang, and Zhao, we show the existence of infinitely many angles $\theta$ for which the maximum number of lines in $\mathbb R^n$ meeting at the origin with pairwise…

Combinatorics · Mathematics 2023-02-24 Carl Schildkraut

We give an upper bound for the exponential $\sum_{m=1}^M \exp( 2i\pi f (m))$ in terms of $M$ and $\lambda$, where $\lambda$ is a small positive number which denotes the size of the fourth derivative of the real valued function $f$. The…

Number Theory · Mathematics 2023-07-10 O Robert , P Sargos

We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximating a problem beyond a certain threshold requires…

Computational Complexity · Computer Science 2024-02-23 Ali Çivril

Let $f$ be a real polynomial with irrational leading co-efficient. In this article, we derive distribution of $f(n)$ modulo one for all $n$ with at least three divisors and also we study distribution of $f(n)$ for all square-free $n$ with…

Number Theory · Mathematics 2024-08-06 Nilanjan Bag , Dwaipayan Mazumder

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…

Combinatorics · Mathematics 2019-08-30 Yen-chi Roger Lin , Wei-Hsuan Yu

Let $S(\sigma,t)=\frac{1}{\pi}\arg\zeta(\sigma+it)$ be the argument of the Riemann zeta function at the point $\sigma+it$ of the critical strip. For $n\geq 1$ and $t>0$ we define $$ S_{n}(\sigma,t) = \int_0^t S_{n-1}(\sigma,\tau)\,d\tau\, +…

Number Theory · Mathematics 2018-08-01 Andrés Chirre

The Tur\'an number $\text{ex}(n,H)$ of a graph $H$ is the maximal number of edges in an $H$-free graph on $n$ vertices. In $1983$ Chung and Erd\H{o}s asked which graphs $H$ with $e$ edges minimize $\text{ex}(n,H)$. They resolved this…

Combinatorics · Mathematics 2023-06-22 Matija Bucić , Nemanja Draganić , Benny Sudakov

We shall study non-linear extremal problems in Bergman space $\mathcal{A}^2(\mathbb{D})$. We show the existence of the solution and that the extremal functions are bounded. Further, we shall discuss special cases for polynomials,…

Complex Variables · Mathematics 2015-07-24 Pritha Chakraborty , Alexander Solynin

Let $A$ be a finite subset of an abelian group $G$, and suppose that $|A+A|\leq K|A|$. We show that for any $\epsilon>0$, there exists a constant $C_\epsilon$ such that $A$ can be covered by at most $\exp(C_\epsilon \log(2K)^{1+\epsilon})$…

Number Theory · Mathematics 2026-03-02 Rushil Raghavan
‹ Prev 1 8 9 10 Next ›