English
Related papers

Related papers: Upper bounds on cyclotomic numbers

200 papers

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev

The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $\alpha>2^{-1/3}$ there exists an integer $\Delta_{\alpha}$…

Combinatorics · Mathematics 2022-05-24 Lefteris Kirousis , John Livieratos

We compute the Z-rank of the subgroup of elements of the multiplicative group of a number field K that are norms from every finite level of the cyclotomic Z{\ell}-extension of K. Thus we compare its {\ell}-adification with the group of…

Number Theory · Mathematics 2017-02-17 Jean-François Jaulent

Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…

Combinatorics · Mathematics 2018-12-31 Gábor Hegedüs

New criteria are established for upper bounds on the number of limit cycles of periodic Abel differential equations having two periodic invariant curves, one of them bounded. The criteria are applied to obtain upper bounds of either zero or…

Classical Analysis and ODEs · Mathematics 2020-07-06 José Luis Bravo Trinidad , Luis Ángel Calderón Pérez , Manuel Fernández García-Hierro

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

Number Theory · Mathematics 2007-05-23 Andrew Granville , Kannan Soundararajan

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

Optimization and Control · Mathematics 2022-11-24 Divya Padmanabhan , Selin Damla Ahipasaoglu , Arjun Ramachandra , Karthik Natarajan

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

We use the Weil bound of multiplicative character sums together with some recent results of N. Boston and R. Jones, to show that the critical orbit of quadratic polynomials over a finite field of $q$ elements is of length $O(q^{3/4})$,…

Number Theory · Mathematics 2009-09-28 Alina Ostafe , Igor E. Shparlinski

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Commutative Algebra · Mathematics 2021-08-31 Wei Li , Alexey Ovchinnikov , Gleb Pogudin , Thomas Scanlon

The concept of spectral radius order plays an crucial role in the breakthrough work on equiangular lines due to Jiang, Tidor, Yao, Zhang, and Zhao [Ann. of Math. (2) 194 (2021), no. 3, 729-743]. However, it is difficult to calculate the…

Combinatorics · Mathematics 2025-08-26 Yanlong Ding , Chuanyuan Ge , Shiping Liu

Let $r(k)$ denote the maximum number of edges in a $k$-uniform intersecting family with covering number $k$. Erd\H{o}s and Lov\'asz proved that $ \lfloor k! (e-1) \rfloor \leq r(k) \leq k^k.$ Frankl, Ota, and Tokushige improved the lower…

Combinatorics · Mathematics 2016-04-19 Andrii Arman , Troy Retter

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

Numerical Analysis · Mathematics 2024-11-26 Prashant Batra

In the paper we obtain the asymtotic number of integral quadratic polynomials with bounded heights and discriminants as the upper bound of heights tends to infinity.

Number Theory · Mathematics 2013-08-12 F. Götze , D. Kaliada , M. Korolev

We associate some (old) convergent series related to definite integrals with the cyclotomic equation $x^m-1= 0$, for several natural numbers $m$; for example, for $m = 3$, $x^3-1 = (x-1)(1+x+x^2)$, leads to $\int_0^1dx\frac{1}{(1+x+x^2)} =…

Number Theory · Mathematics 2015-01-23 Luis J. Boya , Cristian Rivera

In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we…

Number Theory · Mathematics 2014-10-21 Arturas Dubickas , Min Sha , Igor E. Shparlinski

Let $N_n(X)$ denote the number of degree $n$ number fields with discriminant bounded by $X$. In this note, we improve the best known upper bounds on $N_n(X)$, finding that $N_n(X) = O(X^{ c (\log n)^2})$ for an explicit constant $c$.

Number Theory · Mathematics 2020-06-24 Robert J. Lemke Oliver , Frank Thorne

Fix a subset $I\subseteq \mathbb R_{>0}$ such that $\gamma=\inf\{ \sum_{i}n_ib_i-1>0 \mid n_i\in \mathbb Z_{\geq 0}, b_i\in I \}>0$. We give a explicit upper bound $\ell(\gamma)\in O(1/\gamma^2)$ as $\gamma\to 0$, such that for any smooth…

Algebraic Geometry · Mathematics 2023-07-31 Bingyi Chen

In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…

Number Theory · Mathematics 2020-06-01 Long Li , Su-Dan Wang

Let $E_1, \ldots, E_s $ be $s$, not necessary distinct, elliptic curves over $\mathbb{Q}$. We give upper bounds on the frequency of $s$-tuples of points in $E_1(\mathbb{Q})\times \ldots \times E_s(\mathbb{Q})$ whose denominators or…

Number Theory · Mathematics 2025-12-23 Attila Bérczes , Subham Bhakta , Lajos Hajdu , Alina Ostafe , Igor E. Shparlinski