Related papers: Formal Analysis of Galois Field Arithmetics - Para…
Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…
Fourier phase retrieval (FPR) is an inverse problem that recovers the signal from its Fourier magnitude measurement, it's ill-posed especially when the sampling rates are low. In this paper, an untrained generative prior is introduced to…
We present a formalism for the calculation of multi-particle one-loop amplitudes, valid for an arbitrary number N of external legs, and for massive as well as massless particles. A new method for the tensor reduction is suggested which…
Given an undirected graph G, the effective resistance r(s,t) measures the dissimilarity of node pair s,t in G, which finds numerous applications in real-world problems, such as recommender systems, combinatorial optimization, molecular…
Applying Gr\"obner basis theory to concrete problems in Lean 4 remains difficult since the current formalization of multivariate polynomials is based on a non-computable representation and is therefore not suitable for efficient symbolic…
Polynomial graph filters and their inverses play important roles in graph signal processing. An advantage of polynomial graph filters is that they can be implemented in a distributed manner, which involves data transmission between adjacent…
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
Recently, a parallel decoding algorithm of $G_N$-coset codes was proposed.The algorithm exploits two equivalent decoding graphs.For each graph, the inner code part, which consists of independent component codes, is decoded in parallel. The…
We design a deterministic subexponential time algorithm that takes as input a multivariate polynomial $f$ computed by a constant-depth circuit over rational numbers, and outputs a list $L$ of circuits (of unbounded depth and possibly with…
We develop a parallel rejection algorithm to tackle the problem of low acceptance in Monte Carlo methods, and apply it to the simulation of the hopping conduction in Coulomb glasses using Graphics Processing Units, for which we also…
We develop a Galois descent approach to finite-field Fourier spectra over an arbitrary finite base field. Let $\mathbb K=\mathbb F_q$ and $\mathbb L=\mathbb F_{q^m}$. If a Fourier transform is applied to a $\mathbb K$-valued vector, then…
In this paper we examine the potential of computer-assisted proof methods to be applied much more broadly than commonly recognized. More specifically, we contend that there are vast opportunities to derive useful mathematical results and…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
For every finite field F and every positive integer r, there exists a finite extension F' of F such that either SO(2r+1,F') or its simple derived group can be realized as a Galois group over Q. If the characteristic of F is 3 or 5 (mod 8),…
We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising…
An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying known techniques is that a noncommutative circuit of size…
In positive characteristic, nearly all Picard-Vessiot extensions are inseparable over some intermediate iterative differential extensions. In the Galois correspondence, these intermediate fields correspond to nonreduced subgroup schemes of…
In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
Quantum computers require quantum processors. An important part of the processor of any computer is the arithmetic unit, which performs binary addition, subtraction, division and multiplication, however multiplication can be performed using…