Classes of polynomials having only one non-cyclotomic irreducible factor
We study the p-adic equation x q = a over the field of p-adic numbers. We construct an algorithm which gives a solvability criteria in the case of q = p m and present a computer program to compute the criteria for any fixed value of m ≤ p − 1. Moreover, using this solvability criteria for q = 2; 3; 4; 5; 6, we classify p-adic 6-dimensional filiform Leibniz algebras.
We develop a recursive method for computing the -removed -orderings and -orderings of order the characteristic sequences associated to these and limits associated to these sequences for subsets of a Dedekind domain This method is applied to compute these objects for and .