Related papers: An evaluation approach to computing invariants rin…
The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…
A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…
We consider the three finite free convolutions for polynomials studied in a recent paper by Marcus, Spielman, and Srivastava. Each can be described either by direct explicit formulae or in terms of operations on randomly rotated matrices.…
Many invariants of finitely generated positive cancelative commutative semigroups can be studied from their Poincar\'e series. We offer and present several closed formulas for them. Moreover, those formulas have elementary proofs and are…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
This paper describes the structure of invariant skew fields for linear actions of finite solvable groups on free skew fields in $d$ generators. These invariant skew fields are always finitely generated, which contrasts with the free algebra…
Given a polynomial ring $P$ over a field $K$, an element $g \in P$, and a $K$-subalgebra $S$ of $P$, we deal with the problem of saturating $S$ with respect to $g$, i.e. computing $Sat_g(S) = S[g, g^{-1}]\cap P$. In the general case we…
Invariant coordinate selection is an unsupervised multivariate data transformation useful in many contexts such as outlier detection or clustering. It is based on the simultaneous diagonalization of two affine equivariant and positive…
In this paper we propose a (non-linear) smoothing algorithm for group-affine observation systems, a recently introduced class of estimation problems on Lie groups that bear a particular structure. As most non-linear smoothing methods, the…
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time's spending. Further, both of…
The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…
The estimation of large covariance matrices has a high dimensional bias. Correcting for this bias can be reformulated via the tool of Free Probability Theory as a free deconvolution. The goal of this work is a computational and statistical…
An algorithm is described to convert Lorentz and gauge invariant expressions in non--Abelian gauge theories with matter into a standard form, consisting of a linear combination of basis invariants. This algorithm is needed for computer…
I define three "measures" of the complicatedness of a finite group in terms of bases in permutation representations of the group, and consider their relationships to other measures.
A covariant quantization method for physical systems with reducible constraints is presented.
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
In this paper we study the action of a countable group $\Gamma$ on the space of orders on the group. In particular, we are concerned with the invariant probability measures on this space, known as invariant random orders. We show that for…
Given a finite residue field $k$, one looks for a smoothness basis that is invariant under the automorphism group of $k$. We construct models for some finite fields that admit such a basis. This work aims at accelerating algorithms for…
We present a general-order spin-free formulation of the single-reference closed-shell coupled-cluster method. We show that the working equations of a fully biorthogonal contravariant projection formulation of the residual equations, as…
Gauge-invariant operators can be specified by equivalence classes of permutations. We develop this idea concretely for the singlets of the flavour group $SO(N_f)$ in $U(N_c)$ gauge theory by using Gelfand pairs and Schur-Weyl duality. The…