Related papers: Grobner Basis Techniques for Computing Actions of …

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…

It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

Progression, the task of updating a knowledge base to reflect action effects, generally requires second-order logic. Identifying first-order special cases, by restricting either the knowledge base or action effects, has long been a central…

In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…

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…

Over the recent years, the theory of rewriting has been used and extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we investigate a further generalization to Gray categories,…

Using the language of double categories we generalise a classical result on finite-product-preserving left Kan extensions, by Ad\'amek and Rosick\'y, to one on left Kan extensions that preserve algebraic structures defined by `suitable'…

We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gr\"obner basis methods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite…

The non-parametric estimation of covariance lies at the heart of functional data analysis, whether for curve or surface-valued data. The case of a two-dimensional domain poses both statistical and computational challenges, which are…

Granular-ball computing is an efficient, robust, and scalable learning method for granular computing. The basis of granular-ball computing is the granular-ball generation method. This paper proposes a method for accelerating the…

In order to apply nonstandard methods to modern algebraic geometry, as a first step in this paper we study the applications of nonstandard constructions to category theory. It turns out that many categorial properties are well behaved under…

We classify extensions of certain classifiable C*-algebras using the six term exact sequence in K-theory together with the positive cone of the K_0-groups of the distinguished ideal and quotient. We then apply our results to a class of…

This is essentially an illustration for the general technology of homotopical enhancements developed recently in arxiv:2409.17489. We take the derived category of an abelian category, and we look at the full subcategory spanned by complexes…

We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus minimization, which we show to be equivalent to a programming…

The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations…

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

The formation of rings of fractions and the associated process of localization are the most important technical tools in commutative algebra. Krasner (m,n)-hyperrings are a generalization of (m,n)-ring. Let R be a commutative Krasner…

In this paper we use topological techniques to construct generalized trace and modified dimension functions on ideals in certain ribbon categories. Examples of such ribbon categories naturally arise in representation theory where the usual…