Related papers: A note on log canonical thresholds

We show that the optimal upper bound for the anticanonical degrees of non-Gorenstein $\mathbb{Q}$-factorial canonical Fano threefolds with Picard number one is 200/3.

We prove that for any $\epsilon>0$ and any trigonometric polynomial $f$ with frequencies in the set $\{n^3: N \leq n\leq N+N^{2/3-\epsilon}\}$, one has $$ \|f\|_4 \ll \epsilon^{-1/4}\|f\|_2 $$ with implied constant being absolute. We also…

We prove optimal quantitative estimates on the first-order correctors on supercritical percolation clusters: we show that they are bounded in $d\geq 3$ and have logarithmic growth in $d = 2$, in the sense of stretched exponential moments.…

Given two 3-uniform hypergraphs F and G, we say that G has an F-covering if we can cover V(G) by copies of F. The minimum codegree of G is the largest integer d such that every pair of vertices from V(G) is contained in at least d triples…

We prove the $W\mathcal{O}$-rationality of klt threefolds and the rational chain connectedness of klt Fano threefolds over a perfect field of characteristic $p>5$. As a consequence, any klt Fano threefold over a finite field has a rational…

We show that every limit of log canonical thresholds of n-variable functions is also a log canonical threshold of an (n-1)-variable function.

We completely prove the ACC for minimal log discrepancies on smooth threefolds. It implies on smooth threefolds the ACC for a-lc thresholds, the uniform m-adic semi-continuity of minimal log discrepancies and the boundedness of the log…

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $\Delta$-system} if the intersection of any two sets from the collection has the same size. Erd\H{o}s and Szemer\'{e}di asked about the size of the largest family…

We study Q-Fano threefolds of large Fano index. In particular, we prove that the maximum of Fano index is attained for the weighted projective space P(3,4,5,7).

We show that some properties of log canonical centers of a log canonical pair (X,D) also hold for certain subvarieties that are close to being a log canonical center. As a consequence, we obtain that if one works with deformations of pairs…

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

The main result in this paper concerns a new five-variable expander. It is proven that for any finite set of real numbers $A$, $$|\{(a_1+a_2+a_3+a_4)^2+\log a_5 :a_1,a_2,a_3,a_4,a_5 \in A \}| \gg \frac{|A|^2}{\log |A|}.$$ This bound is…

We characterize the ideals $I$ of $\mathcal O_n$ of finite colength whose integral closure is equal to the integral closure of an ideal generated by pure monomials. This characterization, which is motivated by an inequality proven by…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

We prove a conjecture due to V.V. Shokurov on the boundedness of $\epsilon$-log canonical complements on surfaces. As an application we give a new proof to the boundedness of weak log Fano surfaces.

We formulate a conjecture on the number of integral points of bounded height on log Fano varieties in analogy with Manin's conjecture on the number of rational points of bounded height on Fano varieties. We also give a prediction for the…

We give a value for the $F$-pure threshold at the maximal homogeneous ideal $\mathfrak{m}$ of the symmetric determinantal ring over a field of prime characteristic. The answer is characteristic independent, so we immediately get the log…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

In this paper we present a randomized algorithm for computing the collection of maximal layers for a point set in $E^{k}$ ($k = f(n)$). The input to our algorithm is a point set $P = \{p_1,...,p_n\}$ with $p_i \in E^{k}$. The proposed…

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…