M. Giesbrecht

activity

20062026

most citedInterpolation of Shifted-Lacunary Polynomials

30 citations · 70 across the 24 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.SC2026

Computing Smith Forms Modulo $p^{2}$ of Sparse Matrices Faster Than Matrix Multiplication

Mark Giesbrecht

Let $p$ be a prime and $R = Z / p^{2} Z$ the ring of integers modulo $p^{2}$ . Any $A \in R^{n \times n}$ is unimodularly equivalent to its Smith form \[ S=diag\bigl(\underbr…

cs.SC2026

On Factoring Quantum-Plane Skew Polynomials over $Q (ω) (t)$

Mark Giesbrecht

We study algorithms for factorization in the quantum plane of (dilation) skew polynomials over a function field of a cyclotomic field: \[ \mathsf{R}=\mathsf{K}(t)[x;σ], \qquad \mat…

cs.SC2026

Fast Deterministic Normal Bases and Circulant Polynomial Determinants

Mark Giesbrecht, Armin Jamshidpey, Éric Schost

Let $E = F_{q} [x] / (Γ)$ describe an algebraic extension of a finite field $F_{q}$ , where $q$ is a prime power and $Γ \in F_{q} [x]$ is monic and irreducible…

Computing Smith Forms Modulo p2 of Sparse Matrices Faster Than Matrix Multiplication

On Factoring Quantum-Plane Skew Polynomials over Q(ω)(t)

Fast Deterministic Normal Bases and Circulant Polynomial Determinants

Computing Smith Forms Modulo $p^{2}$ of Sparse Matrices Faster Than Matrix Multiplication

On Factoring Quantum-Plane Skew Polynomials over $Q (ω) (t)$