English
Related papers

Related papers: An improved bound on the least common multiple of …

200 papers

Let $f(N)$ denote the least integer $k$ such that, if $G$ is an abelian group of order $N$ and $A \subseteq G$ is a uniformly random $k$-element subset, then with probability at least $\tfrac12$ the subset-sum set $\{ \sum_{x \in S} x : S…

Combinatorics · Mathematics 2026-03-20 Jie Ma , Quanyu Tang

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

Number Theory · Mathematics 2025-08-13 Dinis Vitorino , Ingrid Vukusic

Deriving sharp and computable upper bounds of the Lipschitz constant of deep neural networks is crucial to formally guarantee the robustness of neural-network based models. We analyse three existing upper bounds written for the $l^2$ norm.…

Machine Learning · Computer Science 2024-10-29 Moreno Pintore , Bruno Després

Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $a$ and $b$ be integers with $a\ge 1$ and $a+b\ge 1$. In this paper, we prove that $\log {\rm lcm}_{mn<i\le ln}\{ai+b\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$.

Number Theory · Mathematics 2013-04-26 Guoyou Qian , Shaofang Hong

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Logic in Computer Science · Computer Science 2018-10-11 Ruben Gamboa , John Cowles

Let $\mathbb{N}$ be the set of natural numbers and $\mathcal{S}_r=\big\{1^r, 2^r, 3^r,\cdots\big\}$ the set of $r$-th powers, where $r\ge 2$ is a natural number. Let $\mathcal{W}_r$ be an additive complement of $\mathcal{S}_r$ and $$…

Number Theory · Mathematics 2026-05-19 Yuchen Ding , Csaba Sándor , Zihan Zhang

Let $F\in\mathbb{Z}[x,y]$ be some polynomial of degree 2. In this paper we find the asymptotic behaviour of the least common multiple of the values of $F$ up to $N$. More precisely, we consider $\psi_F(N) =…

Number Theory · Mathematics 2023-07-13 Noam Kimmel

An upper bound on the ergodic capacity of {\bf MIMO} channels was introduced recently in arXiv:0903.1952. This upper bound amounts to the maximization on the simplex of some multilinear polynomial $p(\lambda_1,...,\lambda_n)$ with…

Information Theory · Computer Science 2009-11-05 Leonid Gurvits

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

Number Theory · Mathematics 2026-03-09 Jake Chinis , Besfort Shala

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental result in graph theory, that states that there is some function $f: Z^+\rightarrow Z^+$, such that for all integers $g>0$, every graph of treewidth at least…

Discrete Mathematics · Computer Science 2016-02-09 Julia Chuzhoy

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

Commutative Algebra · Mathematics 2026-04-22 Ben Blum-Smith , Sylvan Crane , Karla Guzman , Alexis Menenses , Maxine Song-Hurewitz

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

Number Theory · Mathematics 2023-07-21 Mayank Pandey , Maksym Radziwiłł

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

Number Theory · Mathematics 2011-08-26 Michael Coons

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

Number Theory · Mathematics 2024-04-23 Shunsuke Usuki

In this paper we prove that there exists a constant $C$ such that, if $S,\Sigma$ are subsets of $\R^d$ of finite measure, then for every function $f\in L^2(\R^d)$, $$\int_{\R^d}|f(x)|^2 dx \leq C e^{C \min(|S||\Sigma|, |S|^{1/d}w(\Sigma),…

Classical Analysis and ODEs · Mathematics 2007-07-11 Philippe Jaming

We prove that $\mathrm{deg}(f) \leq \widetilde{O}(\mathrm{rdeg}(f)^3)$ for every Boolean function $f$, where $\mathrm{deg}(f)$ is the degree of $f$ and $\mathrm{rdeg}(f)$ is the rational degree of $f$. This resolves the second of the three…

Computational Complexity · Computer Science 2026-04-09 Robin Kothari , Matt Kovacs-Deak , Daochen Wang , Rain Zimin Yang

We consider the class of stable solutions to semilinear equations $-\Delta u=f(u)$ in a bounded smooth domain of $\mathbb{R}^n$. Since 2010 an interior a priori $L^\infty$ bound for stable solutions is known to hold in dimensions $n \leq 4$…

Analysis of PDEs · Mathematics 2019-11-07 Xavier Cabre

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…

Number Theory · Mathematics 2016-02-08 Adam J. Harper , Kannan Soundararajan

The irregularity strength of a graph $G$, $s(G)$, is the least $k$ admitting a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ assuring distinct weighted degrees of all vertices, or equivalently the least possible maximal edge multiplicity…

Combinatorics · Mathematics 2019-12-18 Jakub Przybyło
‹ Prev 1 3 4 5 6 7 10 Next ›