Related papers: Fast algorithms for ell-adic towers over finite fi…
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…
There are several researches on Lie algebras and Lie superalgebras graded by finite root systems. In this paper, we study Leibniz algebras graded by finite root systems and obtain some results in simply-laced cases.
In this paper, we describe an elementary method for counting the number of non-isomorphic algebras of a fixed dimension over a given finite field. We show how this method works for the explicit example of $2$-dimensional algebras over the…
We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\F$ is at most $k$ over the algebraic closure of $\F$, where $k$ is a given positive integer. We estimate the arithmetic…
In this work we construct sequences of locally recoverable AG codes arising from a tower of function fields and give bound for the parameters of the obtained codes. In a particular case of a tower over $\mathbb{F}_{q^2}$ for any odd $q$,…
Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…
We present a quantum algorithm for computing the period lattice of infrastructures of fixed dimension. The algorithm applies to infrastructures that satisfy certain conditions. The latter are always fulfilled for infrastructures obtained…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
Weyl groups are ubiquitous, and efficient algorithms for them -- especially for the exceptional algebras -- are clearly desirable. In this paper we provide several of these, addressing practical concerns arising naturally for instance in…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…
The aim of this paper is to develop a constraint algorithm for singular classical field theories in the framework of $k$-cosymplectic geometry. Since these field theories are singular, we need to introduce the notion of $k$-precosymplectic…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $\Delta t=A t_s^{2/3}$. For non-conserved systems, only effectively finite timesteps are…
Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…
In this article, we introduce a finite element method designed for the robust computation of approximate signed distance functions to arbitrary boundaries in two and three dimensions. Our method employs a novel prediction-correction…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…