Related papers: An evaluation approach to computing invariants rin…
It is well-known that the symmetry group of a Feynman diagram can give important information on possible strategies for its evaluation, and the mathematical objects that will be involved. Motivated by ongoing work on multi-loop multi-photon…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
We report on an approach to integration-by-parts reduction based on Gr\"obner bases. We establish the underlying noncommutative rational double-shift algebra wherein the integration-by-parts relations form a left ideal. We describe in…
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…
We generalize the theory of the second invariant cohomology group $H^2_{\rm inv}(G)$ for finite groups $G$, developed in [Da2,Da3,GK], to the case of affine algebraic groups $G$, using the methods of [EG1,EG2,G]. In particular, we show that…
This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…
Maximizing the likelihood has been widely used for estimating the unknown covariance parameters of spatial Gaussian processes. However, evaluating and optimizing the likelihood function can be computationally intractable, particularly for…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…
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…
A connection between representation of compact groups and some invariant ensembles of Hermitian matrices is described. We focus on two types of invariant ensembles which extend the Gaussian and the Laguerre Unitary ensembles. We study them…
Let $p$ be an odd prime and $\mathbb{F}_p$ be the prime field of order $p$. Consider a $2$-dimensional orthogonal group $G$ over $\mathbb{F}_p$ acting on the standard representation $V$ and the dual space $V^*$. We compute the invariant…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…
The reciprocal square root is an important computation for which many very sophisticated algorithms exist (see for example \cite{863046,863031} and the references therein). In this paper we develop a simple differential compensation (much…
We show how to perform systematically improvable variational calculations in the $O(2N)$ Gross-Neveu model for generic $N$, in such a way that all infinities usually plaguing such calculations are accounted for in a way compatible with the…
In a recent paper, Dave Benson and Peter Symonds defined a new invariant $\gamma_G(M)$ for a finite dimensional module $M$ of a finite group $G$ which attempts to quantify how close a module is to being projective. In this paper, we…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We consider the ring of coinvariants for modular representations of cyclic groups of prime order. For all cases for which explicit generators for the ring of invariants are known, we give a reduced Gr\"obner basis for the Hilbert ideal and…