中文
相关论文

相关论文: Boyd's conjecture

200 篇论文

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

数论 · 数学 2024-03-21 Akos Borsanyi

A number of the form $x(x+1)/2$ where $x$ is an integer is called a triangular number. Suppose, $N(a_1,\cdots,a_k;n)$ and $T(a_1,\cdots,a_k;n)$ denote the number of ways $n$ can be expressed as $\sum_{i=1}^k a_ix_i^2$ and $\sum_{i=1}^k…

数论 · 数学 2021-10-12 Srilakshmi Krishnamoorthy , Abinash Sarma

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…

数值分析 · 数学 2024-11-26 Prashant Batra

We prove a new bound on the average sensitivity of polynomial threshold functions. In particular we show that a polynomial threshold function of degree $d$ in at most $n$ variables has average sensitivity at most…

组合数学 · 数学 2012-10-05 Daniel M. Kane

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

复变函数 · 数学 2024-03-22 Marko Slapar

We have known that most sequences in $\mathcal{M}=\{1,2,\dots, M\}$ with length $n$ will miss $Me^{-\lambda}$ of the total numbers of $\{1,2,\dots,M\}$ as the ratio $n/M$ tends to $\lambda$. Now we consider a more general case where the…

数论 · 数学 2020-11-17 Cristian Cobeli , Alexandru Zaharescu

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

计算复杂性 · 计算机科学 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

We combine transcendental methods and the modular approaches to the $ABC$ conjecture to show that the largest prime factor of $n^2+1$ is at least of size $(\log_2 n)^2/\log_3n$ where $\log_k$ is the $k$-th iterate of the logarithm. This…

数论 · 数学 2023-12-07 Hector Pasten

For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…

数论 · 数学 2019-01-01 Douglas Bowman , James Mc Laughlin

We obtain general criteria for giving a lower bound on the degree of numbers of the form $\prod_{n=1}^\infty \left(1+\frac{b_n}{\alpha_n}\right)$ or of the form $\prod_{m=1}^\infty \left(1+ \sum_{n=1}^\infty…

数论 · 数学 2025-02-06 Simon Kristensen , Mathias Løkkegaard Laursen

We obtain improved Fourier restriction estimate for the truncated cone using the method of polynomial partitioning in dimension $n\geq 3$, which in particular solves the cone restriction conjecture for $n=5$, and recovers the sharp range…

经典分析与常微分方程 · 数学 2021-01-07 Yumeng Ou , Hong Wang

In this paper, we show that the treewidth of the $n \times n$ toroidal grid is $2n-1$ for all $n \ge 5$. This closes the gap between the previously known upper bound of $2n-1$ (Ellis and Warren, DAM 2008) and the lower bound of $2n-2$…

组合数学 · 数学 2026-05-21 Tatsuya Gima , Hiraku Morimoto , Yuto Okada , Yota Otachi

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree…

经典分析与常微分方程 · 数学 2020-01-06 Patrick Kidger

The Slope Conjecture relates the degree of the colored Jones polynomial to the boundary slopes of a knot. We verify the Slope Conjecture and the Strong Slope Conjecture for Montesinos knots $M(\frac{1}{r},\frac{1}{s-\frac{1}{u}},\frac{1}{t}…

几何拓扑 · 数学 2017-10-20 Xudong Leng , Zhiqing Yang , Ximin Liu

Let $f\in\Bbb F_q[X_1,\dots,X_n]$ with $\deg f=d>0$ and let $Z(f)=\{(x_1,\dots,x_n)\in \Bbb F_q^n: f(x_1,\dots,x_n)=0\}$. Ax's theorem states that $|Z(f)|\equiv 0\pmod {q^{\lceil n/d\rceil-1}}$, that is, $\nu_p(|Z(f)|)\ge m(\lceil…

数论 · 数学 2015-12-17 Xiang-dong Hou

For $k\mid n$ let $Comb_{n,k}$ denote the tree consisting of an $(n/k)$-vertex path with disjoint $k$-vertex paths beginning at each of its vertices. An old conjecture says that for any $k=k(n)$ the threshold for the random graph $G(n,p)$…

组合数学 · 数学 2014-01-14 Jeff Kahn , Eyal Lubetzky , Nicholas Wormald

We study the distributions of the splitting primes in certain families of number fields. The first and main example is the family Pn,N of integer polynomials monic of degree n with height less or equal then N, and then let N go to infinity.…

数论 · 数学 2024-09-10 Ilaria Viglino

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

经典分析与常微分方程 · 数学 2009-12-30 Chun-Yen Shen

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

环与代数 · 数学 2020-11-30 Erhard Aichinger

We established the rate of convergence in the central limit theorem for stopped sums of a class of martingale difference sequences.

概率论 · 数学 2015-06-26 Lahcen Ouchti