中文
相关论文

相关论文: A Maximal Extension of the Best-Known Bounds for t…

200 篇论文

The statistics of low-lying zeros of quadratic Dirichlet L-functions were conjectured by Katz and Sarnak to be given by the scaling limit of eigenvalues from the unitary symplectic ensemble. The n-level densities were found to be in…

数论 · 数学 2013-05-07 Alexei Entin , Edva Roditty-Gershon , Zeev Rudnick

We show that, for $n$ large, there must exist at least \[\frac{n^t}{C^{(1+o(1))t^2}}\] monochromatic $K_t$s in any two-colouring of the edges of $K_n$, where $C \approx 2.18$ is an explicitly defined constant. The old lower bound, due to…

组合数学 · 数学 2007-12-03 David Conlon

Let $(A,\mathfrak{m})$ be a complete intersection of dimension $d \geq 1$ and codimension $c \geq 1$. Let $I$ be an $\mathfrak{m}$-primary ideal and let $M$ be a finitely generated $A$-module. For $i \geq 1$ let $\psi_i^I(M)$ be the degree…

交换代数 · 数学 2025-02-25 Tony J. Puthenpurakal

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

数论 · 数学 2025-06-27 Jean-Marc Deshouillers , Sunil Naik

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

代数几何 · 数学 2016-12-16 Pinaki Mondal

We prove that if $\Om \subseteq \R^2$ is bounded and $\R^2 \setminus \Om$ satisfies suitable structural assumptions (for example it has a countable number of connected components), then $W^{1,2}(\Om)$ is dense in $W^{1,p}(\Om)$ for every…

偏微分方程分析 · 数学 2007-05-23 Alessandro Giacomini , Paola Trebeschi

For any integer $n \geq 2$, let $(m_{1},\ldots,m_{n})$ be a strictly increasing $n$-tuple of positive integers. We show that any subset $A\subset [N]^n$ of density at least $(\log N)^{-c}$ contains a nontrivial configuration of the form…

数论 · 数学 2026-05-08 Jingwei Guo , Changxing Miao , Guoqing Zhan

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

数论 · 数学 2010-10-11 Matthew L. Smith

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

组合数学 · 数学 2024-09-30 Romain Bourneuf , Matija Bucić , Linda Cook , James Davies

The Ramsey number $r(H)$ of a graph $H$ is the minimum integer $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. While this definition only asks for a single monochromatic copy of…

组合数学 · 数学 2022-08-09 David Conlon , Jacob Fox , Benny Sudakov , Fan Wei

Let $f\in\mathbb{Z}[X]$ be quadratic or cubic polynomial. We prove that there exists an integer $G_f\geq 2$ such that for every integer $k\geq G_f$ one can find infinitely many integers $n\geq 0$ with the property that none of…

数论 · 数学 2017-08-24 Carlo Sanna , Márton Szikszai

The well-known Erd\H{o}s--Ko--Rado theorem states that for $n> 2k$, every intersecting family of $k$-sets of $[n]:=\{1,\ldots ,n\}$ has at most $ {n-1 \choose k-1}$ sets, and the extremal family consists of all $k$-sets containing a fixed…

组合数学 · 数学 2025-07-02 Yongjiang Wu , Yongtao Li , Lihua Feng , Jiuqiang Liu , Guihai Yu

Let $f: \mathbb{N} \to \mathbb{C}$ be a multiplicative function for which $$ \sum_{p : \, |f(p)| \neq 1} \frac{1}{p} = \infty. $$ We show under this condition alone that for any integer $h \neq 0$ the set $$ \{n \in \mathbb{N} : f(n) =…

数论 · 数学 2024-11-05 Alexander P. Mangerel

We determine, asymptotically, the number of quintic fields having bounded discriminant. Specifically, we prove that the asymptotic number of quintic fields having absolute discriminant at most X is a constant times X. In contrast with the…

数论 · 数学 2010-06-01 Manjul Bhargava

We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…

度量几何 · 数学 2022-09-13 Víctor Hugo Almendra-Hernández , Gergely Ambrus , Matthew Kendall

Given an $r$-uniform hypergraph $H$, the multicolor Ramsey number $r_k(H)$ is the minimum $n$ such that every $k$-coloring of the edges of the complete $r$-uniform hypergraph $K_n^r$ yields a monochromatic copy of $H$. We investigate…

组合数学 · 数学 2013-02-22 Maria Axenovich , Andras Gyarfas , Hong Liu , Dhruv Mubayi

Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in…

计算复杂性 · 计算机科学 2023-06-22 Srikanth Srinivasan

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

逻辑 · 数学 2025-04-29 Pablo Andújar Guerrero

Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…

组合数学 · 数学 2025-07-08 Ethan Ackelsberg

Let $p$ be a homogeneous polynomial of degree $n$ in $n$ variables, $p(z_1,...,z_n) = p(Z)$, $Z \in C^{n}$. We call such a polynomial $p$ {\bf H-Stable} if $p(z_1,...,z_n) \neq 0$ provided the real parts $Re(z_i) > 0, 1 \leq i \leq n$. This…

组合数学 · 数学 2008-05-14 Leonid Gurvits
‹ 上一页 1 8 9 10 下一页 ›