English
Related papers

Related papers: Small values of signed harmonic sums

200 papers

Let $n>1$ be an odd integer. For any primitive $n$-th root $\zeta$ of unity in the complex field. Via the Engenvector-eigenvalue Identity, we show that $$\sum_{\tau\in…

Combinatorics · Mathematics 2022-07-01 Han Wang , Zhi-Wei Sun

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

Number Theory · Mathematics 2011-09-23 Donald M. Davis

Let $r$ be a positive integer, and let $A$ be a nonempty finite set of at least two integers. We let $\tilde{C}_r(A)$ denote the {\em asymptotic $r$-covering number} of $A$, that is, the smallest integer value of $l$ for which, for all…

Number Theory · Mathematics 2016-03-22 Bela Bajnok

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…

Logic · Mathematics 2019-08-15 Vera Fischer , Diego A. Mejía

An exact formula \[ B(n) = \frac{n}{2}(\lfloor \lg n \rfloor + 1) - \sum _{k=0} ^{\lfloor \lg n \rfloor} 2^k Zigzag(\frac{n}{2^{k+1}}), \] where \[ Zigzag (x) = \min (x - \lfloor x \rfloor, \lceil x \rceil - x), \] for the minimal number $…

Discrete Mathematics · Computer Science 2017-03-07 Marek A. Suchenek

In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer $n$, we find the minimum number of squares of integers except for $n$ whose sums represent all positive integers that are represented…

Number Theory · Mathematics 2025-04-07 Wonjun Chae , Yun-seong Ji , Kisuk Kim , Kyoungmin Kim , Byeong-Kweon Oh , Jongheun Yoon

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

Number Theory · Mathematics 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

We prove that $$ \sum_{p \leq x} \frac{1}{\tau(p-1)} \asymp \frac{x}{(\log x)^{3/2}}, \quad \quad \sum_{n \leq x} \frac{1}{\tau(n^2+1)} \asymp \frac{x}{(\log x)^{1/2}}, $$ where $\tau(n)=\sum_{d|n}1$ is the number of divisors of $n$, and…

Number Theory · Mathematics 2023-04-12 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Sergei V. Konyagin

For $n\in \mathbb{N}$ let $S_n$ be the smallest number $S>0$ satisfying the inequality $$ \int_K f \le S \cdot |K|^{\frac 1n} \cdot \max_{\xi\in S^{n-1}} \int_{K\cap \xi^\bot} f $$ for all centrally-symmetric convex bodies $K$ in…

Metric Geometry · Mathematics 2017-08-24 Bo'az Klartag , Alexander Koldobsky

Let $A,B\subseteq \mathbb Z_n\setminus\{0\}$. A sequence $S=(x_1,\ldots, x_k)$ in $\mathbb Z_n$ is called an $(A,B)$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ and $b_1,\ldots,b_k\in B$ such that…

Number Theory · Mathematics 2026-03-10 Krishnendu Paul , Shameek Paul

An elementary application of Fatou's lemma gives a strengthened version of the monotone convergence theorem. We call this the convergence from below theorem. We make the case that this result should be better known, and deserves a place in…

Functional Analysis · Mathematics 2014-12-25 J. F. Feinstein

Let ${\mathfrak S}_n$ denote the symmetric group with $n$ letters, and $g(n)$ the maximal order of an element of ${\mathfrak S}_n$. If the standard factorization of $M$ into primes is $M=q_1^{\al_1}q_2^{\al_2}... q_k^{\al_k}$, we define…

Number Theory · Mathematics 2008-12-18 Marc Deleglise , Jean-Louis Nicolas , Paul Zimmermann

Let $\mathcal{A}=\{a_{n}\}_{n=1}^{\infty}$ and $\mathcal{B}=\{b_{n}\}_{n=1}^{\infty}$ be two sequences of positive integers (not necessarily distinct). Under some restrictions on $\mathcal{A}$ and $\mathcal{B}$, we obtain a lower bound for…

Number Theory · Mathematics 2026-01-22 Artyom Radomskii

We give a constant factor polynomial time pseudo-approximation algorithm for min-sum clustering with or without outliers. The algorithm is allowed to exclude an arbitrarily small constant fraction of the points. For instance, we show how to…

Data Structures and Algorithms · Computer Science 2020-11-25 Sandip Banerjee , Rafail Ostrovsky , Yuval Rabani

We consider minimizing harmonic maps $u$ from $\Omega \subset \mathbb{R}^n$ into a closed Riemannian manifold $\mathcal{N}$ and prove: (1) an extension to $n \geq 4$ of Almgren and Lieb's linear law. That is, if the fundamental group of the…

Analysis of PDEs · Mathematics 2021-02-15 Katarzyna Mazowiecka , Michał Miśkiewicz , Armin Schikorra

Let $\mathbb C$ be the complex plane, $E$ be a measurable subset in a segment $[0, R]$ of the positive semiaxis $\mathbb R^+$, $u\not\equiv -\infty$ be a subharmonic function on $\mathbb C$. The main result of this article is an upper…

Complex Variables · Mathematics 2019-11-07 Liliia Gabdrakhmanova , Bulat Khabibullin

The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…

Combinatorics · Mathematics 2025-08-26 Noga Alon , Matija Bucić , Lior Gishboliner

We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…

Number Theory · Mathematics 2026-05-21 Melia Haase , Nicolas Nagel

Let $\lambda$ the Barban--Vehov weights, defined in $(1)$. Let $X\ge z_1\ge100$ and $z_2=z_1^\tau$ for some $\tau>1$. We prove that \begin{equation*} \sum_{n\le X}\frac{1}{n}\Bigl(\sum_{\substack{d|n}}\lambda_d\Bigr)^2 \le f(\tau)\frac{\log…

Number Theory · Mathematics 2025-12-15 Olivier Ramaré , Sebastian Zuniga Alterman

For the partial sums $(S_n)$ of independent random variables we define a stochastic process $s_n(t):=(1/d_n)\sum_{k \le [nt]} ({S_k}/{k}-\mu)$ and prove that $$(1/{\log N})\sum_{n\le N}(1/n)\mathbf {I}\left\{s_n(t)\le x\right\} \to…

Probability · Mathematics 2015-05-21 Khurelbaatar Gonchigdanzan , Kamil Marcin Kosiński
‹ Prev 1 8 9 10 Next ›