Related papers: Computing mixed multiplicities, mixed volumes, and…
Using invariants from commutative algebra to count geometric objects is a basic idea in singularities. For example, the multiplicity of an ideal is used to count points of intersection of two analytic sets at points of non-transverse…
We give an effective method to determine the multiplier ideals and jumping numbers associated with a curve singularity $C$ in a smooth surface. We characterize the multiplier ideals in terms of certain Newton polygons, generalizing a…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…
This paper develops a theory of isolated hypersurface singularities in mixed characteristic $(0,p)$, focusing on quotient rings over a Discrete Valuation Ring (DVR). We introduce and study analogues of the classical Tjurina and Milnor…
Modeling of microlensing events poses computational challenges for the resolution of the lens equation and the high dimensionality of the parameter space. In particular, numerical noise represents a severe limitation to fast and efficient…
We compute some algebraic invariants (e.g. depth, Castelnuovo - Mumford regularity) for a special class of monomial ideals, namely the ideals of mixed products. As a consequence, we characterize the Cohen-Macaulay ideals of mixed products.
Let $(A, \frak m)$ be a noetherian local ring with maximal ideal $\frak{m}$ and infinite residue field $k = A/\frak{m}.$ Let $J$ be an $\frak m$-primary ideal, $I_1,...,I_s$ ideals of $A$, and $M$ a finitely generated $A$-module. In this…
Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multi-linear terms to global optimality. This iterative algorithm primarily exploits the advantages of…
The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
We describe the Macaulay2 package "A1BrouwerDegrees" for computing local and global $\mathbb{A}^1$-Brouwer degrees and studying symmetric bilinear forms over the complex numbers, the real numbers, the rational numbers, and finite fields of…
As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an algorithm for computing the multiplicity structure, proposes…
We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…
This paper investigates the parareal algorithms for solving the stochastic Maxwell equations driven by multiplicative noise, focusing on their convergence, computational efficiency and numerical performance. The algorithms use the…
This paper develops mixed-normal approximations for probabilities that vectors of multiple Skorohod integrals belong to random convex polytopes when the dimensions of the vectors possibly diverge to infinity. We apply the developed theory…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
The acquisition of the defining equations of Rees algebras is a natural way to study these algebras and allows certain invariants and properties to be deduced. In this paper, we consider Rees algebras of codimension 2 perfect ideals of…