Related papers: Divisors computing minimal log discrepancies on lc…

In this note, we will show that delta invariant of a log Fano pair can be approximated by lc places of complements of plt type if it is no greater than one. Give a log Fano pair with delta invariant no greater than one, under the assumption…

We study positivity properties of the moduli (b-)divisor associated to a relative log pair $(X,B)/Y$ with relatively trivial log canonical class.

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two…

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…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

The Kullback-Leibler (KL) divergence is a foundational measure for comparing probability distributions. Yet in multivariate settings, its single value often obscures the underlying reasons for divergence, conflating mismatches in individual…

This talk discusses recent progress in some topics relevant for deep inelastic scattering at small x. We discuss first differences and similarities between conventional collinear factorization and the dipole picture of deep inelastic…

Let $S$ be a del Pezzo surface with at worse Du Val singularities of degree $\ge 3$. We construct an $H$-polar cylinder for any ample $\mathbb{Q}$-divisor $H$ on $S$.

The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…

We show the termination of any log-minimal model program for a pair $(X,\Delta)$ of a symplectic manifold $X$ and an effective $\mathbb R$-divisor $\Delta$.

In this paper, a simple proof of the divergence theorem is given by using the Dirac operator and noncommutative residues. Then we extend the divergence theorem to compact manifolds with boundary by the noncommutative residue of the…

Given a variety $Y$ with a rectangular Lefschetz decomposition of its derived category, we consider a degree $n$ cyclic cover $X \to Y$ ramified over a divisor $Z \subset Y$. We construct semiorthogonal decompositions of $\mathrm{D^b}(X)$…

By exploiting the property that the RBM log-likelihood function is the difference of convex functions, we formulate a stochastic variant of the difference of convex functions (DC) programming to minimize the negative log-likelihood.…

We exhibit an algorithm that, given input a curve $X$ over a number field, computes as output the minimal degree of a Belyi map $X \to \mathbb{P}^1$.

Suppose D is an effective divisor on a smooth projective algebraic variety X. For each point x of X we associate a numberical invariant called the moving Seshadri constant of D at x which is a numerical measure of positivity of the divisor…

Let $(X, \Delta)$ be a four-dimensional log variety that is projective over the field of complex numbers. Assume that $(X, \Delta)$ is not Kawamata log terminal (klt) but divisorial log terminal (dlt). First we introduce the notion of "log…

We consider a version of the Lipman-Zariski conjecture for logarithmic vector fields and logarithmic $1$-forms on pairs. Let $(X,D)$ be a pair consisting of a normal complex variety $X$ and an effective Weil divisor $D$ such that the sheaf…

A subset $B$ of an Abelian group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=a-b$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is…

Sorting and separation of microparticles is a challenging problem of interdisciplinary nature. Existing technologies can differentiate microparticles by their bulk properties, such as size, density, electric polarizability, etc. The next…

For a graph $G$ and a constant $\alpha>0$, we denote by $C_{\alpha}(G)$ the minimum order of a subgraph $H\subseteq G$ with $d(H)\ge \alpha d(G)$. Liu and Montgomery conjectured that every graph $G$ contains $K_{\Omega(t)}$ as a subdivision…