Displaying 221 – 240 of 902

Showing per page

Classification des formes quadratiques réelles: un contre-exemple à la finitude

David-Olivier Jaquet-Chiffelle, François Sigrist (1994)

Acta Arithmetica

1. Introduction. On doit à G. Voronoï [Vo] un algorithme de classification complète des formes quadratiques parfaites. Il est dès lors possible, en principe, de déterminer en un temps fini la constante d'Hermite γₙ, qui décrit dans ℝⁿ la densité maximale des empilements de sphères en réseau. L'énorme complexité de l'algorithme lui donne une limite naturelle: il semble actuellement impensable de dépasser la dimension 8, où les explorations ont déjà fourni des milliers de formes...

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.

Clifford algebras, Möbius transformations, Vahlen matrices, and B -loops

Jimmie Lawson (2010)

Commentationes Mathematicae Universitatis Carolinae

In this paper we show that well-known relationships connecting the Clifford algebra on negative euclidean space, Vahlen matrices, and Möbius transformations extend to connections with the Möbius loop or gyrogroup on the open unit ball B in n -dimensional euclidean space n . One notable achievement is a compact, convenient formula for the Möbius loop operation a * b = ( a + b ) ( 1 - a b ) - 1 , where the operations on the right are those arising from the Clifford algebra (a formula comparable to ( w + z ) ( 1 + w ¯ z ) - 1 for the Möbius loop multiplication...

Closed-form expression for Hankel determinants of the Narayana polynomials

Marko D. Petković, Paul Barry, Predrag Rajković (2012)

Czechoslovak Mathematical Journal

We considered a Hankel transform evaluation of Narayana and shifted Narayana polynomials. Those polynomials arises from Narayana numbers and have many combinatorial properties. A mainly used tool for the evaluation is the method based on orthogonal polynomials. Furthermore, we provided a Hankel transform evaluation of the linear combination of two consecutive shifted Narayana polynomials, using the same method (based on orthogonal polynomials) and previously obtained moment representation of Narayana...

CM liftings of supersingular elliptic curves

Ben Kane (2009)

Journal de Théorie des Nombres de Bordeaux

Assuming GRH, we present an algorithm which inputs a prime p and outputs the set of fundamental discriminants D < 0 such that the reduction map modulo a prime above p from elliptic curves with CM by 𝒪 D to supersingular elliptic curves in characteristic p is surjective. In the algorithm we first determine an explicit constant D p so that | D | > D p implies that the map is necessarily surjective and then we compute explicitly the cases | D | < D p .

Currently displaying 221 – 240 of 902