English
Related papers

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

200 papers

Let $f(n,v,e)$ denote the maximum number of edges in a $3$-uniform hypergraph not containing $e$ edges spanned by at most $v$ vertices. One of the most influential open problems in extremal combinatorics then asks, for a given number of…

Combinatorics · Mathematics 2022-06-10 David Conlon , Lior Gishboliner , Yevgeny Levanzov , Asaf Shapira

We investigate two-sided bounds for operator norms of random matrices with unhomogenous independent entries. We formulate a lower bound for Rademacher matrices and conjecture that it may be reversed up to a universal constant. We show that…

Probability · Mathematics 2024-05-24 Rafał Latała , Witold Świątkowski

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ is defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2017-05-16 Md Firoz Ali , A. Vasudevarao

In 1982, Nair proved the identity: ${\rm lcm}({k \choose 1}, 2{k \choose 2}, >..., k{k \choose k}) ={\rm lcm}(1, 2, ..., k), \forall k\in \mathbb{N}.$ Recently, Farhi proved a new identity: ${\rm lcm}({k \choose 0}, {k \choose 1}, >..., {k…

Number Theory · Mathematics 2009-07-21 Shaofang Hong

When studying the least common multiple of some finite sequences of integers, the first author introduced the interesting arithmetic functions $g_k$ $(k \in \mathbb{N})$, defined by $g_k(n) := \frac{n (n + 1) ... (n + k)}{\lcm(n, n + 1,…

Number Theory · Mathematics 2008-08-12 Bakir Farhi , Daniel Kane

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov

In this paper, we first prove that for any strong divisibility sequences $\boldsymbol{a} = \left(a_n\right)_{n\geq 1}$, we have the identity: $\mathrm{lcm} \left\lbrace \binom{n}{0}_{\bf{a}}, \binom{n}{1}_{\bf{a}},\dots,…

Number Theory · Mathematics 2020-04-13 Sid Ali Bousla , Bakir Farhi

The formula $\lim_{N\to\infty}\sum_{p<N,p,p+2 both prime} \log(p)\log(p+2) = C_2$ is tested on the computer up to $N=2^{40}\approx 1.1\times 10^{12}$ and very good agreement is found.

Number Theory · Mathematics 2007-05-23 Marek Wolf

Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…

General Mathematics · Mathematics 2024-10-15 Stijn Cambie

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Number Theory · Mathematics 2024-07-03 Cheuk Fung Lau

Multigraded Castelnuovo--Mumford regularity of a module $M$ over the total coordinate ring $S$ of a smooth projective toric variety $X$ is a region $\operatorname{reg} M \subset \operatorname{Pic} X$ invariant under translation by the nef…

Commutative Algebra · Mathematics 2025-03-03 Juliette Bruce , Lauren Cranton Heller , Mahrud Sayrafi

Let $f$ and $g$ be weakly holomorphic modular functions on $\Gamma_0(N)$ with the trivial character. For an integer $d$, let $\Tr_d(f)$ denote the modular trace of $f$ of index $d$. Let $r$ be a rational number equivalent to $i\infty$ under…

Number Theory · Mathematics 2018-09-24 Dohoon Choi , Subong Lim

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

Combinatorics · Mathematics 2018-09-13 Thao Do , Adam Sheffer

For $\alpha >0$, let $$\mathscr{A}=\{ a_1<a_2<a_3<\cdots\}$$ and $$\mathscr{L}=\{ \ell_1, \ell_2, \ell_3,\cdots\} \quad \text{(not~necessarily~different)}$$ be two sequences of positive integers with $\mathscr{A}(m)>(\log m)^\alpha $ for…

Number Theory · Mathematics 2023-04-14 Yong-Gao Chen , Yuchen Ding

We consider the generalized Thue-Morse sequences $(t_n^{(c)})_{n\ge 0}$ ($c \in [0,1)$ being a parameter) defined by $t_n^{(c)} = e^{2\pi i c s_2(n)}$, where $s_2(n)$ is the sum of digits of the binary expansion of $n$. For the polynomials…

Dynamical Systems · Mathematics 2022-12-27 Aihua Fan , Jörg Schmeling , Weixiao Shen

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

Metric Geometry · Mathematics 2024-01-26 Ansgar Freyer , Martin Henk

Littlewood investigated polynomials with coefficients in $\{-1,1\}$ (Littlewood polynomials), to see how small their ratio of norms $||f||_4/||f||_2$ on the unit circle can become as $deg(f)\to\infty$. A small limit is equivalent to slow…

Number Theory · Mathematics 2012-10-23 Daniel J. Katz

The Ciliberto-Di Gennaro conjecture predicts that a nodal hypersurface of degree $d\geq 3$ with at most $2(d-2)(d-1)$ nodes is either factorial, or contains a plane and has at least $(d-1)^2$ nodes, or contains a quadric surface and has…

Algebraic Geometry · Mathematics 2026-05-08 Remke Kloosterman

The lonely runner conjecture of Wills and Cusick asserts that if $n$ runners with distinct constant speeds run around a a circular unit length track, starting at a common time and place, then each runner will at some time be separated by a…

Combinatorics · Mathematics 2025-11-21 Benjamin Bedert

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

Number Theory · Mathematics 2016-08-03 Bjorn Poonen , Michael Stoll
‹ Prev 1 8 9 10 Next ›