‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

The quaternion Fourier transform (QFT), which is a nontrivial generalization of the real and complex Fourier transform (FT) using quaternion algebra has been of interest to researchers for some years (see e.g. [3, 5]). It was found that many FT properties still hold but others have to be modified. Based on the (right-sided) QFT, one can extend the classical wavelet transform (WT) to quaternion ...

We define an invariant of torsors under adjoint linear algebraic groups of type Cn—equivalently, central simple algebras of degree 2n with symplectic involution—for n divisible by 4 that takes values in H(k, μ2). The invariant is distinct from the few known examples of cohomological invariants of torsors under adjoint groups. We also prove that the invariant detects whether a central simple alg...

Efficient execution on processors with multiple cores requires the exploitation of parallelism within the processor. For many dense linear algebra codes this, in turn, requires the efficient execution of codes which operate on relatively small matrices. Efficient implementations of dense Basic Linear Algebra Subroutines exist (BLAS libraries). However, calls to BLAS libraries introduce large ov...

let $cr_n(f_p)$ denote the algebra of $n times n$ circulant‎ ‎matrices over $f_p$‎, ‎the finite field of order $p$ a prime‎. ‎the‎ ‎order of the unit groups $mathcal{u}(cr_3(f_p))$‎, ‎$mathcal{u}(cr_4(f_p))$ and $mathcal{u}(cr_5(f_p))$ of algebras of‎ ‎circulant matrices over $f_p$ are computed‎.

Let A be a definite quaternion algebra over ℚ, with discriminant D , and

Quaternion matrices are employed successfully in many color image processing applications. In particular, a pure quaternion matrix can be used to represent red, green, and blue channels of images. A low-rank approximation for obtained by using the singular value decomposition. However, this is not optimal sense that resulting may quaternion, i.e., contains real component which useful representa...

In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, then later prove its correctness, which requires a good knowledge of linear algebra.

Circular Brownian motion models of random matrices were introduced by Dyson and describe the parametric eigenparameter correlations of unitary random matrices. For symmetric unitary, self-dual quaternion unitary and an analogue of antisymmetric hermitian matrix initial conditions, Brownian dynamics toward the unitary symmetry is analyzed. The dynamical correlation functions of arbitrary number ...