Related papers: On bilinear algorithms for multiplication in quate…

Let $L$ be a separable quadratic extension of either $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L$. Our techniques are based on computing maximal one-sided…

We study the average-case hardness of establishing that a graph does not have a large clique in both proof and communication complexity. We show exponential lower bounds on the length of cutting planes and bounded-depth resolution over…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

We consider the class of algebras of rank 4 equipped with a standard involution over an arbitrary base ring. In particular, we characterize quaternion rings, those algebras defined by the construction of the even Clifford algebra.

Let G be a group of order 8 and F an algebraically closed field with char= 2. In this paper we compute the number of n degree representations of G and subsequent dimensions of the corresponding spaces of invatiant bilinear forms over the…

In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field $\mathbb{F}$. Given a generic bilinear sequence $B \in \mathbb{F}[\mathbf{x},\mathbf{y}]$, with respect to a partition of…

Using elementary linear algebra, this paper clarifies and proves some concepts about a recently introduced octonion-like associative division algebra over R. This octonion-like algebra is actually the same as the split-biquaternion algebra,…

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

This book introduces the concept of neutrosophic bilinear algebras and their generalizations to n-linear algebras, n>2. This book has five chapters. The first chapter is introductory in nature and gives a few essential definitions and…

The main goal of this paper is to extend [J. Algebra Appl. 20 (2021), 2150074] to generalized quaternion algebras, even when these algebras are not necessarily division rings. More precisely, in such cases, the image of a multilinear…

The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith respect to the degree of the extension. Recently, Randriambololona has generalized…

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Leibniz algebras are certain generalization of Lie algebras. In this paper we give classification of non-Lie solvable (left) Leibniz algebras of dimension $\leq 8$ with one dimensional derived subalgebra. We use the canonical forms for the…

The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing…

In this article, we give the most genaral form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized quaternions (3PGQs) and study on various properties and applications. Firstly we present the definiton,…

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

We establish a lower bound for the complexity of multiplying two skew polynomials. The lower bound coincides with the upper bound conjectured by Caruso and Borgne in 2017, up to a log factor. We present algorithms for three special cases,…

We provide a classification, up to isomorphism, of four-dimensional ternary Leibniz algebras over an algebraically closed field of characteristic zero. For each non-abelian algebra in the classification, we explicitly determine its centroid…

We compute the complexity of the billiard language of the regular Euclidean $N$-gons (and other families of rational lattice polygons), answering a question posed by Cassaigne-Hubert-Troubetzkoy. Our key technical result is a counting…

We investigate two types of boundedness criteria for bilinear Fourier multiplier operators with symbols with bounded partial derivatives of all (or sufficiently many) orders. Theorems of the first type explicitly prescribe only a certain…