Related papers: An evaluation approach to computing invariants rin…
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…
In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…
We investigate the existence problem of group invariant matrices using algebraic approaches. We extend the usual concept of multipliers to group rings with cyclotomic integers as coefficients. This concept is combined with the field descent…
We study symmetries of bases and spanning sets in finite element exterior calculus, using representation theory. We want to know which vector-valued finite element spaces have bases invariant under permutation of vertex indices. The…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
Representation theory provides a suitable framework to count and classify invariants in tensor models. We show that there are two natural ways of counting invariants, one for arbitrary rank of the gauge group and a second, which is only…
In this paper we give an insight into the behaviour of signature-based Gr\"obner basis algorithms, like F5, G2V or SB, for inhomogeneous input. On the one hand, it seems that the restriction to sig-safe reductions puts a penalty on the…
We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
The present work develops certain analytical tools required to construct and compute invariant kernels on the space of complex covariance matrices. The main result is the $\mathrm{L}^1$--Godement theorem, which states that any invariant…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We propose a determinant-free approach for simulation-based Bayesian inference in high-dimensional Gaussian models. We introduce auxiliary variables with covariance equal to the inverse covariance of the model. The joint probability of the…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…
Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes of countably infinite structures, that are…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
At finite $N$ the ring of gauge invariant operators is not freely generated. For problems of interest in physics, these rings are Cohen--Macaulay and admit a Hironaka decomposition, in which the full invariant ring is a free module over a…
In this paper we present a mathematical formulation for the omega invariant of a numerical semigroup for each of its minimal generators. The model consists of solving a problem of optimizing a linear function over the efficient set of a…