Related papers: On bilinear algorithms for multiplication in quate…
We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…
We investigate Lie bialgebra structures on simple Lie algebras of non-split type $A$. It turns out that there are several classes of such Lie bialgebra structures, and it is possible to classify some of them. The classification is obtained…
We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…
We study 2-term tilting complexes of Brauer tree algebras in terms of simplicial complexes. We show the symmetry and convexity of the simplicial complexes as lattice polytopes. Via a geometric interpretation of derived equivalences, we show…
Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…
The quest for non-commutative matrix multiplication algorithms in small dimensions has seen a lot of recent improvements recently. In particular, the number of scalar multiplications required to multiply two $4\times4$ matrices was first…
We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
Let A be a modular abelian variety over \Q of arbitrary even dimension. We establish criteria to prevent a given quaternion algebra over a totally real number field to be the endomorphism algebra of A over \bar\Q. We accomplish this by…
To construct ternary "quaternions" following Hamilton we must introduce two "imaginary "units, $q_1$ and $q_2$ with propeties $q_1^n=1$ and $q_2^m=1$. The general is enough difficult, and we consider the $m=n=3$. This case gives us the…
To an orthogonal or unitary involution on a central simple algebra of degree 4, or to a symplectic involution on a central simple algebra of degree 8, we associate a Pfister form that characterises the decomposability of the algebra with…
This paper provides the next step towards classification of algebras of generalized quaternion type. Previously algebras with 2-regular Gabriel quiver were classified (a quiver is 2-regular if at each vertex, two arrows start and two arrows…
Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…
In this paper we study abelian varieties which correspond to CM points in the coarse moduli space of principally polarized abelian varieties with multiplication by a maximal order in a quaternion algebra over a totally real number field.…
We determine and explicitly parametrize the isomorphism classes of nonassociative quaternion algebras over a field of characteristic different from two, as well as the isomorphism classes of nonassociative cyclic algebras of odd prime…
Quaternions often appear in wide areas of applied science and engineering such as wireless communications systems, mechanics, etc. It is known that are two types of non-isomorphic generalized quaternion algebras, namely: the algebra of…
A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…
A Lie (super)algebra with a non-degenerate invariant symmetric bilinear form will be called a NIS-Lie (super)algebra. The double extension of a NIS-Lie (super)algebra is the result of simultaneously adding to it a central element and an…
We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…