Related papers: Minimal log discrepancies on a fixed threefold
Analog error-correcting codes (Analog ECCs) for approximate vector-matrix multiplication have been extensively studied as means to achieve fault-tolerant in-memory computation. The theoretical foundations for such coding schemes,…
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…
Shokurov's ACC Conjecture says that the set of all log canonical thresholds on varieties of bounded dimension satisfies the Ascending Chain Condition. This conjecture was proved for log canonical thresholds on smooth varieties in [EM1].…
In this article we prove several important properties of 2^{k-p} minimum aberration (MA) designs with k>2, where n=2^{k-p} is the number of runs. We develop a simple method to build MA designs of resolution III. Furthermore, we introduce a…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…
We prove that the ascending chain condition (ACC) for log canonical (lc) thresholds in dimension $d$ and Special Termination in dimension $d$ imply the termination of any sequence of log flips starting with a $d$-dimensional lc pair of…
We generalize the formula for the log canonical threshold(LCT) of plane curves over the complex numbers to arbitrary characteristics. Our proof relies purely on valuation theory, instead of on the theory of $D$-modules.
In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…
We study the equivalence of approaching zero for two invariants of a singularity: the minimal log discrepancy and the log canonical threshold of the general hyperplane section.
We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…
The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…
We give a classification of the dual graphs of the exceptional divisors on the minimal resolutions of log canonical foliation singularities on surfaces. For an application, we show the set of foliated minimal log discrepancies for foliated…
In this paper, we prove the rational coefficient case of the global ACC for foliated threefolds. Specifically, we consider any lc foliated log Calabi-Yau triple $(X,\mathcal{F},B)$ of dimension $3$ whose coefficients belong to a set…
We initiate the study of the algorithmic problem of certifying lower bounds on the discrepancy of random matrices: given an input matrix $A \in \mathbb{R}^{m \times n}$, output a value that is a lower bound on $\mathsf{disc}(A) = \min_{x…
The LCS locus is an essential ingredient in the proof of fundamental results of Log Minimal Model Program, such as nonvanishing and base point freeness theorems. We prove in this paper that the LCS locus of a log canonical variety has…
We discuss upper and lower bounds for the size of gaps in the length spectrum of negatively curved manifolds. For manifolds with algebraic generators for the fundamental group, we establish the existence of exponential lower bounds for the…
We prove boundedness of rationally-connected threefolds in $\mathbb P^6$ under some extra-assumptions.
We show the validity of two special cases of the four-dimensional Minimal Model Program in characteristic $p>5$: for contractions to $\mathbb{Q}$-factorial fourfolds and in families over curves ("semi-stable mmp"). We also provide their…
We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…