Related papers: Mora's holy grail: Algorithms for computing in loc…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…
We study gradings by abelian groups on associative algebras with involution over an arbitrary field. Of particular importance are the fine gradings (that is, those that do not admit a proper refinement), because any grading on a…
We introduce perfect resolving algebras and study their fundamental properties. These algebras are basic for our theory of differential graded schemes, as they give rise to affine differential graded schemes. We also introduce etale…
We study the locus of the liftings of a homogeneous ideal $H$ in a polynomial ring over any field. We prove that this locus can be endowed with a structure of scheme $\mathrm L_H$ by applying the constructive methods of Gr\"obner bases, for…
In this paper, we introduce generalized Gorenstein local (GGL) rings. The notion of GGL rings is a natural generalization of the notion of almost Gorenstein rings, which can thus be treated as part of the theory of GGL rings. For a…
We develop the theory of central ideals on commutative rings. We introduce and study the central seminormalization of a ring in another one. This seminormalization is related to the theory of regulous functions on real algebraic varieties.…
We present an algorithm to compute the automorphism group of a Mori dream space. As an example calculation, we determine the automorphism groups of singular cubic surfaces with general parameters. The strategy is to study graded…
In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
We consider modules $M$ over Lie algebroids ${\mathfrak g}_A$ which are of finite type over a local noetherian ring $A$. Using ideals $J\subset A$ such that ${\mathfrak g}_A \cdot J\subset J $ and the length $\ell_{{\mathfrak g}_A}(M/JM)<…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
A $G$-grading on a complex semisimple Lie algebra $L$, where $G$ is a finite abelian group, is called quasi-good if each homogeneous component is 1-dimensional and 0 is not in the support of the grading. Analogous to classical root systems,…
We study the solution of minimax problems $\min_x \max_y G(x) + \langle K(x),y\rangle - F^*(y)$ in finite-dimensional Hilbert spaces. The functionals $G$ and $F^*$ we assume to be convex, but the operator $K$ we allow to be non-linear. We…
We present an elegant, generic and extensive formalization of Gr\"obner bases in Isabelle/HOL. The formalization covers all of the essentials of the theory (polynomial reduction, S-polynomials, Buchberger's algorithm, Buchberger's criteria…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
We discuss how generalized multiresolution analyses (GMRAs), both classical and those defined on abstract Hilbert spaces, can be classified by their multiplicity functions $m$ and matrix-valued filter functions $H$. Given a natural number…
The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…
We characterize the class of ideals of a polynomial ring such that the hilbert series of their graded local cohomology modules is maximal.