Related papers: Computations of Mather Minimal Log Discrepancies
We present an algorithm for creating contiguous cartograms using meshes. We use numerical optimization to minimize cartographic error and distortion by transforming the mesh vertices. The vertices can either be optimized in the plane or…
We study derivations and differential forms on the arithmetic jet spaces of smooth schemes, relative to several primes. As applications we give a new interpretation of arithmetic Laplacians and we discuss the de Rham cohomology of some…
We briefly summarize theoretical methods for carrying out QCD calculations to next-to-leading order in perturbation theory. In particular, we describe a new general algorithm that can be used for computing arbitrary jet cross sections in…
Measurements of the substructure of top-quark jets are presented, using 140 fb$^{-1}$ of 13 TeV $pp$ collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-$k_{t}$ algorithm with a radius…
We give a method of counting the number of curves with a given type of singularity in a suitably ample linear series on a smooth surface using punctual Hilbert schemes. The types of singulaties for which our methods suffice include the…
In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
We study the problem of maximizing information divergence from a new perspective using logarithmic Voronoi polytopes. We show that for linear models, the maximum is always achieved at the boundary of the probability simplex. For toric…
We compute the rational homology of the moduli stack $\mathcal{M}$ of objects in the derived category of certain smooth complex projective varieties $X$ including toric varieties, flag varieties, curves, surfaces, and some 3- and 4-folds.…
In this work, a 2D contour generation algorithm is proposed for irregular regions. The contour of the physical domain is approximated by mesh segments using the known coordinates of the contour. For this purpose, the algorithm uses a…
We compute the critical surface for the existence of invariant tori of a family of Hamiltonian systems with two and three degrees of freedom. We use and compare two methods to compute the critical surfaces: renormalization-group…
The purpose of this article is to give an overview of the construction of moduli spaces of curves from the viewpoint of the log minimal model program for M_g by providing an update of recent developments and discussing future problems. This…
This is a note on calculating intersection numbers on moduli spaces of curves. A codimension 3 relation among tautological classes on the moduli space of genus 4 curves is given.
Orthogonal Fractional Factorial Designs and in particular Orthogonal Arrays are frequently used in many fields of application, including medicine, engineering and agriculture. In this paper we present a methodology and an algorithm to find…
We discuss the minimal model program for b-log varieties, which is a pair of a variety and a b-divisor, as a natural generalization of the minimal model program for ordinary log varieties. We show that the main theorems of the log MMP work…
Optimal experimental designs are probability measures with finite support enjoying an optimality property for the computation of least squares estimators. We present an algorithm for computing optimal designs on finite sets based on the…
Sparse grids are tailored to the approximation of smooth high-dimensional functions. On a $d$-dimensional tensor product space, the number of grid points is $N = \mathcal O(h^{-1} |\log h|^{d-1})$, where $h$ is a mesh parameter. The…
This work demonstrates algorithms to accurately compute solutions to thermal radiation transport problems using a reduced floating-point precision implementation of the Implicit Monte Carlo method. Several techniques falling into the…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
We generalize the rationality theorem of the accumulation points of log canonical thresholds which was proved by Hacon, M\textsuperscript{c}Kernan, and Xu. Further, we apply the rationality to the ACC problem on the minimal log…
We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…