相关论文: Miura: Divisor Class Group Arithmetic

We present a new, fast, and easy to use tool for modelling light and radial velocity curves of close eclipsing binaries with built-in methods for solving an inverse problem. The main goal of ELISa (Eclipsing binary Learning and Interactive…

We describe new arithmetic invariants for pairs of torus orbits on groups isogenous to an inner form of $\mathbf{PGL}_n$ over a number field. These invariants are constructed by studying the double quotient of a linear algebraic group by a…

We study the following problem in computer vision from the perspective of algebraic geometry: Using $m$ pinhole cameras we take $m$ pictures of a line in $\mathbb P^3$. This produces $m$ lines in $\mathbb P^2$ and the question is which…

Integrated Gradients (IG) is a widely used algorithm for attributing the outputs of a deep neural network to its input features. Due to the absence of closed-form integrals for deep learning models, inaccurate Riemann Sum approximations are…

Integration by parts (IBP) has acquired a bad reputation. While it allows us to compute a wide variety of integrals when other methods fall short, its implementation is often seen as plodding and confusing. Readers familiar with tabular IBP…

Given a finitely presented Graded Commutative Differential Algebra (GCDA), we present a method to compute its minimal model, together with a map that is a quasi-isomorphism up to a given degree. The method works by adding generators one by…

Good semigroups form a class of submonoids of $\mathbb{N}^d$ containing the value semigroups of curve singularities. In this article, we describe a partition of the complements of good semigroup ideals, having as main application the…

Sometimes only some digits of a numerical product or some terms of a polynomial or series product are required. Frequently these constitute the most significant or least significant part of the value, for example when computing initial…

We compute a closed formula for the class of the closure of the locus of curves in $\overline{\mathcal{M}}_g$ that admit an abelian differential of signature $\kappa=(k_1,...,k_{g-2})$.

We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.

Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…

For $4 \nmid L$ and $g$ large, we calculate the integral Picard groups of the moduli spaces of curves and principally polarized abelian varieties with level $L$ structures. In particular, we determine the divisibility properties of the…

Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multiplication. Any subgroup of the class…

In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…

The goal of this paper is to produce a formula for the multiplier ideals of monomial space curves in the spirit of Howald's formula for the multiplier ideals of monomial ideals. This is achieved by constructing a toric blowup of affine…

A semi-implicit-explicit (semi-IMEX) Runge-Kutta (RK) method is proposed for the numerical integration of ordinary differential equations (ODEs) of the form $\mathbf{u}' = \mathbf{f}(t,\mathbf{u}) + G(t,\mathbf{u}) \mathbf{u}$, where…

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…

On common processors, integer multiplication is many times faster than integer division. Dividing a numerator n by a divisor d is mathematically equivalent to multiplication by the inverse of the divisor (n / d = n x 1/d). If the divisor is…

We propose a parametric integral probability metric (IPM) to measure the discrepancy between two probability measures. The proposed IPM leverages a specific parametric family of discriminators, such as single-node neural networks with ReLU…

We introduce the Macaulay2 package SCMAlgebras. It provides functions for computing the modules of deficiency and the filter ideals, in order to check whether a module or an ideal is sequentially Cohen-Macaulay. After the basic algebraic…