Related papers: An algorithm for Hodge ideals
In this paper, we describe a new hybrid algorithm for computing all singular triplets above a given threshold and provide its implementation in MATLAB/Octave and R. The high performance of our codes and ease at which they can be used,…
Given a smooth algebraic variety X with an action of a connected reductive linear algebraic group G, and an equivariant D-module M, we study the G-decompositions of the associated V-, Hodge, and weight filtrations. If M is the localization…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or…
In the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms (EMOAs). MOBGO utilizes Gaussian…
Given a pseudo-effective divisor L we construct the diminished ideal of L, a "continuous" extension of the asymptotic multiplier ideal for big divisors to the pseudo-effective boundary. For most pseudo-effective divisors L the multiplier…
We study the canonical mixed Hodge module structure associated to the $\mathscr{D}_X$-module $\mathscr{M}(f^{-\alpha}):=\mathscr{O}_X(*f)f^{-\alpha}$. We particularly focus on the weight filtration and extend many known results to the…
We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…
A compression algorithm is introduced for multi-determinant wave functions which can greatly reduce the number of determinants that need to be evaluated in quantum Monte Carlo calculations. We have devised an algorithm with three levels of…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
Let G be a reductive algebraic group and H a closed subgroup of G. Explicit constructions of G-invariant ideals in the algebra K[G/H] are given. This allows to obtain an elementary proof of Matsushima's criterion: a homogeneous space G/H is…
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…
We give a formula computing the irregular Hodge numbers for a confluent hypergeometric differential equation.
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…
A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…
For time-dependent PDEs, the numerical schemes can be rendered bound-preserving without losing conservation and accuracy, by a post processing procedure of solving a constrained minimization in each time step. Such a constrained…
We develop Hybrid Monte Carlo (HMC) algorithms for constrained Hamiltonian systems of gauge- Higgs models and introduce a new observable for the constraint effective Higgs potential. We use an extension of the so-called Rattle algorithm to…
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by…
We present a new algorithm for computing the real radical of an ideal and, more generally, the-radical of, which is based on convex moment optimization. A truncated positive generic linear functional vanishing on the generators of is…