Related papers: Comprehensive Involutive Systems
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
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…
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…
Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
We consider ideals of polynomials vanishing on the W-orbits of the intersections of mirrors of a finite reflection group W. We determine all such ideals which are invariant under the action of the corresponding rational Cherednik algebra…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
This paper is the first of a series in which we develop exact and approximate algorithms for mappings of systems of differential equations. Here we introduce the MapDE algorithm and its implementation in Maple, for mappings relating…
In this paper we present an overview of the connection between completely integrable systems and the background geometry of the flow. This relation is better seen when using a group-based concept of moving frame introduced by Fels and Olver…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
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…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We examine an analytic variational inference scheme for the Gaussian Process State Space Model (GPSSM) - a probabilistic model for system identification and time-series modelling. Our approach performs variational inference over both the…
We provide an inductive algorithm computing Gromov-Witten invariants in all genera with arbitrary insertions of all smooth complete intersections in projective space. We also prove that all Gromov-Witten classes of all smooth complete…
We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…
Grassmann manifolds $G_{k,n}$ are among the central objects in geometry and topology. The Borel picture of the mod 2 cohomology of $G_{k,n}$ is given as a polynomial algebra modulo a certain ideal $I_{k,n}$. The purpose of this paper is to…
The main idea in this paper is merging two techniques that have been recently developed. On the one hand, we consider MCCGS, standing for Minimal Canonical Comprehensive Groebner Systems, a recently introduced computational tool yielding…
In this paper we formulate a general method for building completely integrable quantum systems. The method is based on the use of the so-called multi-parameter spectral equations, i.e. equations with several spectral parameters. We show…
We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…