[BOOK][B] Handbook of finite fields

GL Mullen, D Panario - 2013 - api.taylorfrancis.com
The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

Determining the closed forms of the O (as3) anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra

J Blümlein, M Kauers, S Klein, C Schneider - Computer Physics …, 2009 - Elsevier
Single scale quantities, as anomalous dimensions and hard scattering cross sections, in
renormalizable Quantum Field Theories are found to obey difference equations of finite …

Fast decoding of codes in the rank, subspace, and sum-rank metric

H Bartz, T Jerkovits, S Puchinger… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
We speed up existing decoding algorithms for three code classes in different metrics:
interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the …

The holonomic toolkit

M Kauers - Computer Algebra in Quantum Field Theory …, 2013 - Springer
This is an overview over standard techniques for holonomic functions, written for readers
who are new to the subject. We state the definition for holonomy in a couple of different …

[HTML][HTML] Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix

G Labahn, V Neiger, W Zhou - Journal of Complexity, 2017 - Elsevier
Given a nonsingular n× n matrix of univariate polynomials over a field K, we give fast and
deterministic algorithms to compute its determinant and its Hermite normal form. Our …

Fraction-free row reduction of matrices of Ore polynomials

B Beckermann, H Cheng, G Labahn - Journal of Symbolic Computation, 2006 - Elsevier
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in
a fraction-free way. The reductions can be used for finding the rank and left nullspace of …

[BOOK][B] Algorithmes efficaces en calcul formel

A Bostan, F Chyzak, M Giusti, R Lebreton, G Lecerf… - 2017 - inria.hal.science
Le calcul formel traite des objets mathématiques exacts d'un point de vue informatique. Cet
ouvrage «Algorithmes efficaces en calcul formel» explore deux directions: la calculabilité et …

[HTML][HTML] Computing minimal interpolation bases

CP Jeannerod, V Neiger, É Schost, G Villard - Journal of Symbolic …, 2017 - Elsevier
We consider the problem of computing univariate polynomial matrices over a field that
represent minimal solution bases for a general interpolation problem, some forms of which …

Normal forms for general polynomial matrices

B Beckermann, G Labahn, G Villard - Journal of Symbolic Computation, 2006 - Elsevier
We present an algorithm for the computation of a shifted Popov normal form of a rectangular
polynomial matrix. For specific input shifts, we obtain methods for computing the matrix …

Solving structured linear systems with large displacement rank

A Bostan, CP Jeannerod, É Schost - Theoretical Computer Science, 2008 - Elsevier
Linear systems with structures such as Toeplitz, Vandermonde or Cauchy-likeness can be
solved in Õ (α2n) operations, where n is the matrix size, α is its displacement rank, and Õ …