Related papers: Equivariant Gr\"obner bases
The degree of the generators of invariant polynomial rings of is a long standing open problem since the very initial study of the invariant theory in the 19th century. Motivated by its significant role in characterizing multipartite…
In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
The aim of this article is to introduce standard bases of ideals in polynomial rings with respect to a class of orderings which are not necessarily semigroup orderings. Our approach generalises the concept of standard bases with respect to…
This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…
We investigate actions of cyclic groups on polynomial rings with two variables, and the minimal free resolution of the corresponding invariant ring. In particular, we fully classify several cases, including the case the defining ideal has…
We introduce an infinite family of quiver representation-valued invariants of classical, virtual and surface-knots and links associated to a choice of finite biquandle, commutative unital ring, biquandle module and set of biquandle…
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
In commutative algebra, the theory of Gr\"obner bases enables one to compute in any finitely generated algebra over a given computable field. For non-finitely generated algebras however, other methods have to be pursued. For instance, it…
In the last decade, the approximate basis computation of vanishing ideals has been studied extensively in computational algebra and data-driven applications such as machine learning. However, symbolic computation and the dependency on term…
Previous work by Mora and Sala provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in $n$ variables of degrees $k=1,\dots,n$, $\langle e_{1,n}(x), \dots, e_{n,n}(x) \rangle$. Haglund, Rhoades, and…
This paper surveys and develops links between polynomial invariants of finite groups, factorization theory of Krull domains, and product-one sequences over finite groups. The goal is to gain a better understanding of the multiplicative…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…
Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…
We previously showed that the inverse limit of standard-graded polynomial rings with perfect coefficient field is a polynomial ring, in an uncountable number of variables. In this paper, we show that the same result holds with arbitrary…