Related papers: Rewriting as a Special Case of Noncommutative Groe…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
The paper concerns a certain subcategory of the category of representations for a semisimple algebraic group $G$ in characteristic $p$, which arise from the semisimple modules for the corresponding quantum group at a $p$-th root of unity.…
We introduce a new class of algebras, called reconstruction algebras, and present some of their basic properties. These non-commutative rings dictate in every way the process of resolving the Cohen-Macaulay singularities C^2/G where G is a…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
We give an explicit set of generators for the semigroup of the Gr\"obner degeneration of a toric ideal. This set of generators is used to study algebraic properties of the semigroup it generates: approximation of semigroups,…
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…
Let $k$ be a nonperfect field of characteristic $2$. Let $G$ be a $k$-split simple algebraic group of type $E_6$ (or $G_2$) defined over $k$. In this paper, we present the first examples of nonabelian non-$G$-completely reducible…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
By using the quasi-determinant the construction of Gel'fand et al. leads to the inverse of a matrix with noncommuting entries. In this work we offer a new method that is more suitable for physical purposes and motivated by deformation…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
We study the structure of the generator of a symmetric, conservative quantum dynamical semigroup with norm-bounded generator on a von Neumann algebra equipped with a faithful semifinite trace. For von Neumann algebras with abelian commutant…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We associate a 2-complex to the following data: a presentation of a semigroup $S$ and a transitive action of $S$ on a set $V$ by partial transformations. The automorphism group of the action acts properly discontinuously on this 2-complex.…
Present notes can be viewed as an attempt to extend the notion of Schubert/Grothendieck polynomial to the context of an arbitrary algebraic oriented cohomology theory and, hence, of a commutative one-dimensional formal group law.
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…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…
Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…