相关论文: Miura: Divisor Class Group Arithmetic

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

Given a moduli problem with a nice coarse moduli space, which is the most intrinsic and natural divisor on this moduli space? We describe a general method of constructing effective divisors on a large class of moduli spaces using the…

In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…

We compute many new classes of effective divisors in $\overline{\mathcal{M}}_{g,n}$ coming from the strata of abelian differentials and efficiently reproduce many known results obtained by alternate methods. Our method utilises maps between…

The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…

Inspired by the decomposition in the hybrid quantum-classical optimization algorithm we introduced in arXiv:1902.04215, we propose here a new (fully classical) approach to solving certain non-convex integer programs using Graver bases. This…

We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the arithmetic multiplicity. Minimal differential…

We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…

We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…

We propose an extended variant of the reformulation and decomposition algorithm for solving a special class of mixed-integer bilevel linear programs (MIBLPs) where continuous and integer variables are involved in both upper- and lower-level…

We compute the class of a divisor on M_{g,n} given as the closure of the locus of smooth pointed curves [C; x_1,..., x_n] for which \sum d_j x_j has an effective representative, where d_j are integers summing up to g-1, not all positive.…

Isogeometric analysis (IgA) offers enhanced approximation capabilities for the discretization of elliptic boundary-value problems, yet it results in large, sparse, and increasingly ill-conditioned linear systems due to higher…

Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy superclusters) and curvelike structures (filaments). It would be ideal to…

We propose a new formulation of Multiple-Instance Learning (MIL), in which a unit of data consists of a set of instances called a bag. The goal is to find a good classifier of bags based on the similarity with a "shapelet" (or pattern),…

Ising computing provides a new computing paradigm for many hard combinatorial optimization problems. Ising computing essentially tries to solve the quadratic unconstrained binary optimization problem, which is also described by the Ising…

We continue the study of intersection algebras $\mathcal B = \mathcal B_R(I, J)$ of two ideals $I, J$ in a commutative Noetherian ring $R$. In particular, we exploit the semigroup ring and toric structures in order to calculate various…

We apply the methods of Fukaya, Kato and Sharifi to refine Mazur's study of the Eisenstein ideal. Given prime numbers $N$ and $p\geq 5$ such that $p\mid \varphi(N)$, we study the quotient of the cohomology group of modular curve $X_{0}(N)$…

We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…

This paper is a sequel to \cite{C}, in which the author studies secant planes to linear series on a curve that is general in moduli. In that paper, the author proves that a general curve has no linear series with exceptional secant planes,…

We discuss aspects of the theory of non-invertible transformations which enter in the problem of classification of diffe\-ren\-tial-difference equations and, in particular, the notion of Miura type transformation. We introduce the concept…