Related papers: Divisors computing minimal log discrepancies on lc…

Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by…

Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial…

We propose a linear version of the weighted bounded negativity conjecture. It considers a smooth projective surface $X$ over an algebraically closed field of characteristic zero and predicts the existence of a common lower bound on…

Let $(X,L,V)$ be a triplet where $X$ is an irreducible smooth complex projective variety, $L$ is an ample and spanned line bundle on $X$ and $V\subseteq H^0(X,L)$ spans $L$. The discriminant locus $\Cal D(X,V) \subset |V|$ is the algebraic…

In this work, a graph partitioning problem in a fixed number of connected components is considered. Given an undirected graph with costs on the edges, the problem consists of partitioning the set of nodes into a fixed number of subsets with…

We study a family of semiample divisors on the moduli space $\bar{M}_{0,n}$ that come from the theory of conformal blocks for the Lie algebra $sl_n$ and level 1. The divisors we study are invariant under the action of $S_n$ on…

We study relative log canonical pairs with relatively trivial log canonical divisors. We fix such a pair $(X,\Delta)/Z$ and establish the minimal model theory for the pair $(X,\Delta)$ assuming the minimal model theory for all Kawamata log…

In this paper we shall introduce a simple, effective numerical method for finding differential operators for scalar and vector-valued functions on surfaces. The key idea of our algorithm is to develop an intrinsic and unified way to compute…

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a…

We treat threefolds with divisorial contractions whose exceptional divisors contract to compound Du Val points. We prove that general elements in their anticanonical systems around the exceptional divisors have at worst Du Val…

In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…

Let $X$ be a complete normal variety, $B$ an effective $\mathbb{R}$-divisor on $X$, and $D$ a Cartier divisor on $X$. Assume that the pair $(X, B)$ is log terminal. We consider the problem whether $H^0(X, D) \ne 0$ and obtain some results…

This paper is about interpolating minimal surfaces between two real analytic curves, a and b, each of which are simple real analytic curves, using the Bj\"{o}rling-Schwarz formula in the domain where it is valid, changing the normal…

The paper is concerned with estimating the number of integers smaller than $x$ whose largest prime divisor is smaller than $y$, denoted $\psi (x,y)$. Much of the related literature is concerned with approximating $\psi (x,y)$ by Dickman's…

The development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm that simulates stochastic flows on a network of sample…

We give an explicit description of the divisor class groups of rational trinomial varieties. As an application, we relate the iteration of Cox rings of any rational variety with torus action of complexity one to that of a Du Val surface.

We present conjectured candidates for the least perimeter partition of a disc into $N \le 10$ regions which take one of two possible areas. We assume that the optimal partition is connected, and therefore enumerate all three-connected…

We consider realistic, multi-parameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…