Page 1

Displaying 1 – 6 of 6

Showing per page

Classification of p-adic 6-dimensional filiform Leibniz algebras by solutions of x q = a

Manuel Ladra, Bakhrom Omirov, Utkir Rozikov (2013)

Open Mathematics

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.

Computing r -removed P -orderings and P -orderings of order h

Keith Johnson (2010)

Actes des rencontres du CIRM

We develop a recursive method for computing the r -removed P -orderings and P -orderings of order h , the characteristic sequences associated to these and limits associated to these sequences for subsets S of a Dedekind domain D . This method is applied to compute these objects for S = and S = p .

Currently displaying 1 – 6 of 6

Page 1