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

Let $R$ be a polynomial ring over a field of characteristic zero and let $I \subset R$ be a graded ideal of height $N$ which is minimally generated by $N+1$ homogeneous polynomials. If $I=(f_1,...,f_{N+1})$ where $f_i$ has degree $d_i$ and…

For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\mathbb{N}$. Taking this a step further, it is natural to…

We prove that for polynomials $f, g, h \in \mathbb{Z}[x]$ satisfying $f = gh$ and $f(0) \neq 0$, the $\ell_2$-norm of the cofactor $h$ is bounded by $\|h\|_2 \leq \|f\|_1 \cdot\left( \widetilde{O}\left(\|g\|_0^3 \frac{\text{deg…

We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

We consider a problem of maximizing the product of the sizes of two uniform cross-$t$-intersecting families of sets. We show that the value of this maximum is at most polynomially larger (in the size of a ground set) than a quantity…

A thoroughly studied problem in Extremal Graph Theory is to find the best possible density condition in a host graph $G$ for guaranteeing the presence of a particular subgraph $H$ in $G$. One such classical result, due to Bollob\'{a}s and…

Erd\H{o}s and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at least 1/2log(n) vertices. The famous Erd\H{o}s-Hajnal…

The celebrated theorem of Ahlswede and Khachatrian determines the maximum size of a family of $k$-element subsets of an $n$-element set where the intersection of any two subsets has at least $r$ elements. This survey first gives a…

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…

In this paper, based on the known rigidity theorems of Newton maps ([DS], [RYZ]) and real polynomials ([KSS1], [CvS]), we prove the density of hyperbolicity in the family of real Newton maps of degree d>2 with all free critical points real.

Given a fixed graph $H$ and a constant $c \in [0,1]$, we can ask what graphs $G$ with edge density $c$ asymptotically maximize the homomorphism density of $H$ in $G$. For all $H$ for which this problem has been solved, the maximum is always…

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens…

Motzkin posed the problem of finding the maximal density $\mu(M)$ of sets of integers in which the differences given by a set $M$ do not occur. The problem is already settled when $|M|\leq 2$ and $M$ is a finite arithmetic progression. In…

We prove that the maximum size of a family of $k$-element subsets of the set $[n] = \{1, 2, \ldots, n\}$ which contains no singleton intersection is $\binom{n-2}{k-2}$ when $3k-3 \le n \le k^2-k+1$. This improves upon a recent result of…

In this paper, we consider the problem of determining the density of monic polynomials over $\mathbb{Z}_p$ with squarefree discriminant over various subsets of the set of monic polynomials over $\mathbb{Z}_p$ of fixed degree. We compute the…

We consider a Wigner-type ensemble, i.e. large hermitian $N\times N$ random matrices $H=H^*$ with centered independent entries and with a general matrix of variances $S_{xy}=\mathbb E|H_{xy}|^2$. The norm of $H$ is asymptotically given by…