相关论文: Upper bound of discrepancies of divisors computing…

We study a divisor computing the minimal log discrepancy on a smooth surface. Such a divisor is obtained by a weighted blow-up. There exists an example of a pair such that any divisor computing the minimal log discrepancy computes no log…

We prove that the first gap of $\mathbb R$-complementary thresholds of surfaces is $\frac{1}{13}$. More precisely, the largest $\mathbb R$-complementary threshold for surfaces that is strictly less than $1$ is $\frac{12}{13}$. This result…

Let $\Gamma$ be a finite set, and $X\ni x$ a fixed klt germ. For any lc germ $(X\ni x,B:=\sum_{i} b_iB_i)$ such that $b_i\in \Gamma$, Nakamura's conjecture, which is equivalent to the ACC conjecture for minimal log discrepancies for fixed…

Let $(X\ni x,B)$ be an lc surface germ. If $X\ni x$ is klt, we show that there exists a divisor computing the minimal log discrepancy of $(X\ni x,B)$ that is a Koll\'ar component of $X\ni x$. If $B\not=0$ or $X\ni x$ is not Du Val, we show…

On smooth threefolds, the ACC for minimal log discrepancies is equivalent to the boundedness of the log discrepancy of some divisor which computes the minimal log discrepancy. We reduce it to the case when the boundary is the product of a…

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

We show the existence of prime divisors computing minimal log discrepancies in positive characteristic except for a special case. Moreover we prove the lower semicontinuity of minimal log discrepancies for smooth varieties in positive…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

In Part I we construct the upper bound, in the spirit of $\Gamma$- $\limsup$, achieved by multidimensional profiles, for some general classes of singular perturbation problems, with or without the prescribed differential constraint, taking…

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…

An equivalence graph is a disjoint union of cliques, and the equivalence number $\mathit{eq}(G)$ of a graph $G$ is the minimum number of equivalence subgraphs needed to cover the edges of $G$. We consider the equivalence number of a line…

A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

Let $p$ be a prime number and let $G$ be a graph on $n$ vertices and $m$ edges. The zero-sum Ramsey number of $G$ over $\mathbb{Z}_p$, denoted by $R(G, \mathbb{Z}_p)$, is the minimum $\ell\in \mathbb{N}$ such that for any edge-coloring…

We show several variants of concentration inequalities on the sphere stated as subgaussian estimates with optimal constants. For a Lipschitz function, we give one-sided and two-sided bounds for deviation from the median as well as from the…

The positive discrepancy of a graph $G$ of edge density $p=e(G)/\binom{v(G)}{2}$ is defined as $$\mbox{disc}^{+}(G)=\max_{U\subset V(G)}e(G[U])-p\binom{|U|}{2}.$$ In 1993, Alon proved (using the equivalent terminology of minimum bisections)…

We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…