Related papers: Miura: Divisor Class Group Arithmetic
Let X be a smooth complex affine curve, and let R be the space of right ideal classes in the ring D of differential operators on X. We introduce and study a fibration \gamma : R \to Pic(X). We relate this fibration to the corresponding one…
Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…
Package-X, a Mathematica package for the analytic computation of one-loop integrals dimensionally regulated near 4 spacetime dimensions is described. Package-X computes arbitrarily high rank tensor integrals with up to three propagators,…
Group based moving frames have a wide range of applications, from the classical equivalence problems in differential geometry to more modern applications such as computer vision. Here we describe what we call a discrete group based moving…
The purpose of this note is to suggest an analogue for genus 2 curves of part of Gross and Zagier's work on elliptic curves. Experimentally, for genus 2 curves with CM by a quartic CM field K, it appears that primes dividing the…
We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…
By adapting the technique of David, Koukoulopoulos and Smith for computing sums of Euler products, and using their interpretation of results of Schoof \`a la Gekeler, we determine the average number of subgroups (or cyclic subgroups) of an…
We introduce the MathGR package, written in Mathematica. The package can manipulate tensor and GR calculations with either abstract or explicit indices, simplify tensors with permutational symmetries, decompose tensors from abstract indices…
We describe the main functions of the Macaulay2 package Quasidegrees. The purpose of this package is to compute the quasidegree set of a finitely generated A-graded module presented as the cokernel of a monomial matrix. We provide examples…
We make a very detailed analysis of the numerical properties of effective divisors whose support is contained in the exceptional locus of a birational morphism of smooth projective surfaces. As an application we extend Miyaoka's inequality…
Probing in mixed-integer programming (MIP) is a technique of temporarily fixing variables to discover implications that are useful to branch-and-cut solvers. Such fixing is typically performed one variable at a time -- this paper develops…
The purpose of this paper is two-fold. We first prove a series of results, concerned with the notion of Zariski multiplicity, mainly for non-singular algebraic curves. These results are required in the paper "A Theory of Branches for…
Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. We consider the (small)…
Domain specific accelerators present new challenges and opportunities for code generation onto novel instruction sets, communication fabrics, and memory architectures. In this paper we introduce an intermediate representation (IR) which…
Split group codes are a class of group algebra codes over an abelian group. They were introduced in 2000 by Ding, Kohel and Ling as a generalization of the cyclic duadic codes. For a prime power q and an abelian group G of order n such that…
A valuation theoretic approach is presented that directly leads to division algebras that are noncrossed products (instead of, e.g., describing Brauer classes of noncrossed products in an abstract manner). While this feature is shared by…
Cutting planes are essential for solving mixed-integer linear problems (MILPs), because they facilitate bound improvements on the optimal solution value. For selecting cuts, modern solvers rely on manually designed heuristics that are tuned…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
Multiple instance learning (MIL) is concerned with learning from sets (bags) of objects (instances), where the individual instance labels are ambiguous. In this setting, supervised learning cannot be applied directly. Often, specialized MIL…
GroupMath is a Mathematica package which performs several calculations related to semi-simple Lie algebras and the permutation groups, both of which are important in particle physics as well as in other areas of research.