Related papers: An evaluation approach to computing invariants rin…
Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…
In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…
Multi-matrix invariants, and in particular the scalar multi-trace operators of $\mathcal{N}=4$ SYM with $U(N)$ gauge symmetry, can be described using permutation centraliser algebras (PCA), which are generalisations of the symmetric group…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
In this paper we study invariant rings arising in the study of finite dimensional algebraic structures. The rings we encounter are graded rings of the form $K[U]^{\Gamma}$ where $\Gamma$ is a product of general linear groups over a field…
Let $G={\rm Spec} A$ be a linearly reductive group and let $w_G\in A^*$ be the invariant integral on $G$. We establish the harmonic analysis on $G$ and we compute $w_G$ when $G=Sl_n, Gl_n, O_n, Sp_{2n}$ by geometric arguments and by means…
Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer is trivial; the base size of $G$ is the minimal cardinality of a base. In this paper we initiate the study of bases for…
It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…
We construct the general permutation invariant Gaussian 2-matrix model for matrices of arbitrary size $D$. The parameters of the model are given in terms of variables defined using the representation theory of the symmetric group $S_D$. A…
Analyzing and reasoning about safety properties of software systems becomes an especially challenging task for programs with complex flow and, in particular, with loops or recursion. For such programs one needs additional information, for…
Let $G$ be a finite group of order $n$, and $\xi$ an $n$-th primitive root of unity. Consider the affine scheme $C:=\mbox{Spc}({\mathbb Z}[\xi]\otimes_{\mathbb Z} R(G))$ where $R(G)$ is the representation ring of $G$. We study the fibers of…
Over a field of characteristic 0, every ring of invariants of a finite group is Cohen-Macaulay. This is not true for fields of positive characteristic. We consider permutation representations and their invariant rings over fields…
This paper presents algebraic methods for the study of polynomial relative invariants, when the group G formed by the symmetries and relative symmetries is a compact Lie group. We deal with the case when the subgroup H of symmetries is…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…
Inverse classification is the process of manipulating an instance such that it is more likely to conform to a specific class. Past methods that address such a problem have shortcomings. Greedy methods make changes that are overly radical,…
In this article we introduce powerful tools and techniques from invariant theory to free analysis. This enables us to study free maps with involution. These maps are free noncommutative analogs of real analytic functions of several…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…