Related papers: Arithmetic in big number fields: the '+Ideals' pac…
In this work we describe a minimal log-resolution of an ideal in a smooth complex surface from the minimal log-resolution of its generators.
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…
The Package Miura contains functions that compute divisor class group arithmetic for nonsingular curves. The package reduces computation in a divisor class group to that in the ideal class group via the isomorphism. The underlying quotient…
In this paper, the author introduce and study the notion of pre-{\gamma}-I-open sets in ideal topological space.
We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct:…
\textit{Multiple Instance Learning} (MIL) is concerned with learning from bags of instances, where only bag labels are given and instance labels are unknown. Existent approaches in this field were mainly designed for the bag-level label…
IDEAL (Influence Diagram Evaluation and Analysis in Lisp) is a software environment for creation and evaluation of belief networks and influence diagrams. IDEAL is primarily a research tool and provides an implementation of many of the…
We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to…
We give a description of a new Macaulay2 package called SimplicialPosets. This package provides functions for working with simplicial posets and calculating their generalized Stanley-Reisner ideals. For practical purposes, we also introduce…
The dirichletprocess package provides software for creating flexible Dirichlet process objects. Users can perform nonparametric Bayesian analysis using Dirichlet processes without the need to program their own inference algorithms. Instead,…
We introduce SOFIA, a Mathematica package that automatizes the computation of singularities of Feynman integrals, based on new theoretical understanding of their analytic structure. Given a Feynman diagram, SOFIA generates a list of…
This paper presents algorithms for calculating the quadratic character and the norms of prime ideals in the ring of integers of any quadratic field. The norms of prime ideals are obtained by means of a sieve algorithm using the quadratic…
Metric independent $\sigma$ models are constructed. These are field theories which generalise the membrane idea to situations where the target space has fewer dimensions than the base manifold. Instead of reparametrisation invariance of the…
A technique for reducing the number of integrals in a Monte Carlo calculation is introduced. For integrations relying on classical or mean-field trajectories with local weighting functions, it is possible to integrate analytically at least…
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…
In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide…
In this paper we consider a notion of universal sets for ideals. We show that there exist universal sets of minimal Borel complexity for classic ideals like null subsets of $2^\omega$ and meager subsets of any Polish space, and demonstrate…
We have developed MGGPOD, a user-friendly suite of Monte Carlo codes built around the widely used GEANT (Version 3.21) package. The MGGPOD Monte Carlo suite and documentation are publicly available for download. MGGPOD is an ideal tool for…
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…