Related papers: On equivalent conjectures for minimal log discrepa…
Let $X$ be a smooth hypersurface of degree $n\geq 3$ in $\mathbb{P}^n$. We prove that the log canonical threshold of $H\in|-K_X|$ is at least $\frac{n-1}{n}$. Under the assumption of the Log minimal model program, we also prove that a…
We formulate a conjecture on the behavior of the minimal free resolutions of sets of general points on arbitrary varieties embedded by complete linear series, in analogy with the well-known Minimal Resolution Conjecture for points in…
Given a local field $F$ of positive characteristic, an $F$-analytic manifold $X$ and an analytic function $f:X\rightarrow F$, the $F$-analytic log-canonical threshold $\mathrm{lct}_{F}(f;x_{0})$ is the supremum over the values $s\geq0$ such…
Recent study in K-stability suggests that klt singularities whose local volumes are bounded away from zero should be bounded up to special degeneration. We show that this is true in dimension three, or when the minimal log discrepancies of…
We consider analog error-correcting codes (analog ECCs) that are designed to correct/detect outlying errors arising in analog implementations of vector-matrix multiplication. The error-correction/detection capability of an analog ECC can be…
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and important special case, planar graph isomorphism,…
We consider the problem of optimality, in a minimax sense, and adaptivity to the margin and to regularity in binary classification. We prove an oracle inequality, under the margin assumption (low noise condition), satisfied by an…
Hassett and Keel predicted that there is a descending sequence of critical $\alpha$ values where the log canonical model for the moduli space of stable curves with respect to $\alpha \delta$ changes. We derive a conjectural formula for the…
We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…
Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
Linear algebra expressions, which play a central role in countless scientific computations, are often computed via a sequence of calls to existing libraries of building blocks (such as those provided by BLAS and LAPACK). A sequence…
We treat two different topics on the log minimal model program, especially for four-dimensional log canonical pairs. (a) Finite generation of the log canonical ring in dimension four. (b) Abundance theorem for irregular fourfolds. We obtain…
Given any asymptotically flat 3-manifold $(M,g)$ with smooth, non-empty, compact boundary $\Sigma$, the conformal conjecture states that for every $\delta>0$, there exists a metric $g' = u^4 g$, with $u$ a harmonic function, such that the…
Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…
We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency $d^{-o_d(1)}$. When the dimension is large enough, our lower bound is tighter than the previous…
In this note, we give a bound for the Castelnuovo-Mumford regularity of a homogeneous ideal $I$ in terms of the degrees of its generators. We assume that $I$ defines a local complete intersection with log canonical singularities.
Evaluation of the marginal likelihood plays an important role in model selection problems. The widely applicable Bayesian information criterion (WBIC) and singular Bayesian information criterion (sBIC) give approximations to the log…
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…