相关论文: Miura: Divisor Class Group Arithmetic
We introduce the Macaulay2 package GradedLieAlgebras for doing computations in graded Lie algebras presented by generators and relations.
We present the Macaulay2 package Resultants, which provides commands for the effective computation of multivariate resultants, discriminants, and Chow forms. We provide some background for the algorithms implemented and show, with a few…
We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.
This paper presents `chipfiring`, a comprehensive Python package for the mathematical analysis of chip-firing games on finite graphs. The package provides a robust toolkit for defining graphs and chip configurations (divisors), performing…
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
The algebraic method for computing the complete point symmetry group of a system of differential equations is extended to finding the complete equivalence group of a class of such systems. The extended method uses the knowledge of the…
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…
Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We introduce milearn, a Python package for multi-instance learning (MIL) that follows the familiar scikit-learn fit/predict interface while providing a unified framework for both classical and neural-network-based MIL algorithms for…
Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…
This short note provides a quick introduction to relative canonical resolutions of curves on rational normal scrolls. We present our Macaulay2-package which computes the relative canonical resolution associated to a curve and a pencil of…
We discuss the GIT moduli of semistable pairs consisting of a cubic curve and a line on the projective plane. We study in some detail this moduli and compare it with another moduli suggested by Alexeev. It is the moduli of pairs (with no…
Let $R$ be a commutative ring and let $I$ be an ideal of $R$. In this paper, we introduce the cozero-divisor graph $\acute{\Gamma}_I(R)$ of $R$ and obtain some related results.
We introduce the package \texttt{EliminationTemplates} for the Macaulay2 computer algebra system, which provides tools for constructing automatic solvers for families of zero-dimensional radical ideals depending on algebraically independent…
The original Miura transformation, considered as a nonlinear potential transformation, is applicable to a continual class of evolution equations, not only to discrete integrable equations and their hierarchies. The same continual class of…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size constraints. In the paper 10.1016/j.ejor.2014.05.042, the…
We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…