相关论文: Miura: Divisor Class Group Arithmetic

We present an ideal mixed-integer programming (MIP) formulation for a rectified linear unit (ReLU) appearing in a trained neural network. Our formulation requires a single binary variable and no additional continuous variables beyond the…

The Macaulay2 package Cremona performs some computations on rational and birational maps between irreducible projective varieties. For instance, it provides methods to compute degrees and projective degrees of rational maps without any…

We define and study a biadditive symmetric (not necessarily perfect) pairing on the torsion part $\mathrm{Pic}(X)_{\mathrm{tors}}$ of the Picard group of a smooth projective curve $X$ over a field $k$ with values in $k^\times \otimes…

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…

The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…

This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…

In the Hilbert scheme of curves of degree $d_{r}=\frac{r(r+1)}{2}$ and arithmetic genus $g_{r}=\frac{r(r+1)(2r-5)}{6}+1$ in $\mathbb{P}^{3}$ we prove that there exists a unique component of arithmetically Cohen-Macaulay curves denoted by…

Mixed-integer rounding (MIR) cutting planes (cuts) are effective at improving the strength of a linear relaxation for mixed-integer linear programming (MIP) problems. The cuts in this family are derived by aggregating constraints then…

In this Macaulay2 \cite{M2} package we define an object called {\it linear code}. We implement functions that compute basic parameters and objects associated with a linear code, such as generator and parity check matrices, the dual code,…

Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…

The Koszul homology of modules of the polynomial ring $R$ is a central object in commutative algebra.It is strongly related with the minimal free resolution of these modules, and thus with regularity, Hilbert functions, etc. Here we…

An unpublished example due to Joe Harris from 1983 (or earlier) gave two smooth space curves with the same Hilbert function, but one of the curves was arithmetically Cohen-Macaulay (ACM) and the other was not. Starting with an arbitrary…

We describe a significant update to the existing InvariantRing package for Macaulay2. In addition to expanding and improving the methods of the existing package for actions of finite groups, the updated package adds functionality for…

Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…

In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…

For a hyperelliptic curve of genus $g$, a divisor in general position of degree $g+1$ is given by polynomial equations. There is an action from an algebraic group on the representations of divisors by polynomials which fixes divisor…

The boundary of the multi-scale differential compactification of strata of abelian differentials admits an explicit combinatorial description. However, even for low-dimensional strata, the complexity of the boundary requires use of a…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…

We calculate the Picard group, over the integers, of the Hilbert scheme of smooth, irreducible, non-degenerate curves of degree $d$and genus $g \geq 4$ in ${\Bbb P}^r$, in the case when $d \geq 2g+1 $ and $r \leq d-g$. We express the…