Related papers: On bilinear algorithms for multiplication in quate…
We give two new criteria for a basic algebra to be biserial. The first one states that an algebra is biserial iff all subalgebras of the form eAe where e is supported by at most 4 vertices are biserial. The second one gives some condition…
In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…
Let p and q be two positive primes. In this paper we obtain a complete characterization of quaternion division algebras H_K(p,q) over the composite K of n quadratic number fields. Also, in Section 6, we obtain a characterization of…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
In this paper, we investigate subnormal subgroups of the multiplicative group of an almost locally simple artinian algebra with involution. In particular, we show that if either the set of traces or the set of norms of such a subgroup with…
We compare the implementation of a 8x8 bit multiplier with two different implementations of a 4x4 quaternary digit multiplier. Interfacing this binary multiplier with quaternary to binary decoders and binary to quaternary encoders leads to…
The class in the Brauer group of a quaternion algebra over a field is 2-torsion. We study the following question: Which 2-torsion elements of the Brauer group of a complex function field are representable by quaternion algebras? Using…
We propose the arbitrary precision approximate (APA) bilinear algorithm of length 46 for multiplication of 4 x 4 and 4 x 4 matrices. The algorithm has polynomial order 3 and 352 nonzero coefficients from total 2208.
Let $p$ and $q$ be two positive primes. Let $\ell$ be an odd positive prime integer and $F$ a quadratic number field. Let $K$ be an extension of $F$ such that $K$ is a dihedral extension of $\Q$ of degree $\ell$ over $F$ or $K$ is an…
We review a lattice construction arising from quaternion algebras over number fields and use it to obtain some known extremal and densest lattices in dimensions 8 and 16. The benefit of using quaternion algebras over number fields is that…
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the…
In this paper we study certain quaternion algebras and symbol algebras which split.
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time…
This note contains two new observations on the linkage properties of quaternion algebras over fields of characteristic 2: first, that a 3-linked field need not be 4-linked (a case which was left open in previous papers) and that three…
A Lie (super)algebra with a non-degenerate invariant symmetric bilinear form $B$ is called a nis-(super)algebra. The double extension $\mathfrak{g}$ of a nis-(super)algebra $\mathfrak{a}$ is the result of simultaneous adding to…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We give a minimal system of 476 generators (resp. 510 generators) for the algebra of SL(2,C)-covariant polynomials on binary forms of degree 9 (resp. degree 10). These results were only known as conjectures so far. The computations rely on…
Using the complex Klein-Gordon field as a model, we quantize the quaternionic scalar field in the real Hilbert space. The lagrangian formulation has accordingly been obtained, as well as the hamiltonian formulation, and the energy and…
This is the sequel exposition following [1]. The framework quotient algebra partition is rephrased in the language of the s-representation. Thanks to this language, a quotient algebra partition of the simplest form is established under a…