Related papers: Grobner Basis Techniques for Computing Actions of …
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
In this paper, by using the Groebner-Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
We use pointwise Kan extensions to generate new subcategories out of old ones. We investigate the properties of these newly produced categories and give sufficient conditions for their cartesian closedness to hold. Our methods are of…
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…
Let $K$ be a complete non-Archimedean field $K$ with separated power series, treated in the analytic Denef--Pas language. We prove the existence of definable retractions onto an arbitrary closed definable subset of $K^{n}$, whereby…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
These notes are an expanded version of a talk given by the second author. Our main interest is focused on the challenging problem of computing Kronecker coefficients. We decided, at the beginning, to take a very general approach to the…
We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…
This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
An algebraic left Kan extension is a left Kan extension which interacts well with the algebraic structure present in the given situation, and these appear in various subjects such as the homotopy theory of operads and in the study of…
We study and compare different Graph Neural Network extensions that increase the expressive power of GNNs beyond the Weisfeiler-Leman test. We focus on (i) GNNs based on higher order WL methods, (ii) GNNs that preprocess small substructures…
By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between non-homogeneous Gr\"obner bases and homogeneous Gr\"obner bases. As a consequence, a general principle of…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture using a recursive formula for the Catalan numbers.
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…