Related papers: On bilinear algorithms for multiplication in quate…
We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…
The paper aims to investigate the classification problem of low dimensional complex none Lie filiform Leibniz algebras. There are two sources to get classification of filiform Leibniz algebras. The first of them is the naturally graded none…
we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of…
Non-degenerate bilinear forms over fields of characteristic 2, in particular, non-symmetric ones, are classified with respect to various equivalences, and the Lie algebras preserving them are described. Although it is known that there are…
In this work a rationalized algorithm for calculating the quotient of two complex numbers is presented which reduces the number of underlying real multiplications. The performing of a complex number division using the naive method takes 4…
Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…
Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…
Polynomial multiplication is known to have quasi-linear complexity in both the dense and the sparse cases. Yet no truly linear algorithm has been given in any case for the problem, and it is not clear whether it is even possible. This…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
We introduce the notion of quadri-algebras. These are associative algebras for which the multiplication can be decomposed as the sum of four operations in a certain coherent manner. We present several examples of quadri-algebras: the…
A Lie algebra is said to be quadratic if it admits a symmetric invariant and non-degenerated bilinear form. Semisimple algebras with the Killing form are examples of these algebras, while orthogonal subspaces provide abelian quadatric…
{\small In this paper, we find a class of division quaternion algebras over the field }$\mathbb{Q}\left( i\right) ${\small \ and a class of division symbol algebras over a cyclotomic field.}
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…
We consider Clifford algebras over the field of real or complex numbers as a quotient algebra without fixed basis. We present classification of Clifford algebra elements based on the notion of quaternion type. This classification allows us…
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…
We present a package 'MixedMultiplicity' for computing mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over a field. This enables us to find mixed volumes of convex lattice polytopes…