2 research outputs found
Enumerating all the Irreducible Polynomials over Finite Field
In this paper we give a detailed analysis of deterministic and randomized
algorithms that enumerate any number of irreducible polynomials of degree
over a finite field and their roots in the extension field in quasilinear where
is the size of the output.} time cost per element.
Our algorithm is based on an improved algorithm for enumerating all the
Lyndon words of length in linear delay time and the known reduction of
Lyndon words to irreducible polynomials
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Abstract. Prolog’s ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranking and unranking functions. Starting from a generalization of Ackerman’s encoding of Hereditarily Finite Sets with Urelements and a novel tupling/untupling operation, we derive encodings for Finite Functions and use them as building blocks for an executable theory of Hereditarily Finite Functions. The more difficult problem of ranking and unranking Hereditarily Finite Permutations is then tackled using Lehmer codes and factoradics. The paper is organized as a self-contained literate Prolog program availabl