相关论文: Rewriting as a Special Case of Noncommutative Groe…

We study a presentation of Khovanov - Lauda - Rouquier's candidate $2$-categorification of a quantum group using algebraic rewriting methods. We use a computational approach based on rewriting modulo the isotopy axioms of its pivotal…

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

This paper has several purposes. We present through a critical review the results from already published papers on the constructive semigroup theory, and contribute to its further development by giving solutions to open problems. We also…

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…

In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…

Polynomial system solving arises in many application areas to model non-linear geometric properties. In such settings, polynomial systems may come with degeneration which the end-user wants to exclude from the solution set. The…

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…

The fundamental groups of most (conjecturally, all) closed 3-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting…

This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…

A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…

Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…

This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…

Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to…

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

In this paper, we are interested in a Neumann-type series for modified Bessel functions of the first kind which arises in the study of Dunkl operators associated with dihedral groups and as an instance of the Laguerre semigroup constructed…

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

The recent proof of the Boij-Soederberg conjectures reveals new structure about Betti diagrams of modules, giving a complete description of the cone of Betti diagrams. We begin to expand on this new structure by investigating the semigroup…

Two different models for a Hopf-von Neumann algebra of bounded functions on the quantum semigroup of all (quantum) permutations of infinitely many elements are proposed, one based on projective limits of enveloping von Neumann algebras…