Related papers: A doubling construction for Williamson matrices
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…
The general method of the cojmplex supersymmetrization (supercomplexifications) of the soliton equations with the odd (bi) hamiltoninan structure is established. New version of the supercomplexified Kadomtsev-Petvishvili hierarchy is given.…
The Strassen $2\times2$ matrix multiplication algorithm arises from the volume form on the 3-dimensional quotient space of the $2\times 2$ matrices by the multiples of identity.
Let $A(n,r;3)$ be the total weight of the alternating sign matrices of order $n$ whose sole `1' of the first row is at the $r^{th}$ column and the weight of an individual matrix is $3^k$ if it has $k$ entries equal to -1. Define the…
We present a simple yet powerful technique for forming iterative methods of various convergence orders. Methods of various convergence orders (four, six, eight and ten) are formed through a modest modification of the classical Newton…
In this paper a vectorized algorithm for simultaneously computing up to eight singular value decompositions (SVDs, each of the form $A=U\Sigma V^{\ast}$) of real or complex matrices of order two is proposed. The algorithm extends to a batch…
A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in…
In this note, we give an alternative and explicit construction of the $G_2(2)$-hexagon from a $U_3(2)$-geometry.
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
The Cayley-Dickson Construction is a generalization of the familiar construction of the complex numbers from pairs of real numbers. The complex numbers can be viewed as two-dimensional vectors equipped with a multiplication. The…
Using the ideas of concatenation construction of codes over the $q$-ary alphabet, we modify the known generalized Sylvester-type construction of the Hadamard matrices. The new construction is based on two collections of the Hadamard…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
This paper presents a method for constructing flat deformations of associative algebras. We will refer to this method as method two because it is a generalisation of the method obtained in [1]. The deformations obtained using the first two…
We define several operations that switch substructures of Hadamard matrices thereby producing new, generally inequivalent, Hadamard matrices. These operations have application to the enumeration and classification of Hadamard matrices. To…
We give a new construction of the moonshine VOA V^{\natural} over the real number field. We proved that V^{\natural} has a positive definite invariant bilinear form and its full automorphism group is the Monster simple group. We also…
In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which…
We present methods of constructing examples of quandles of order 3n, where n is greater or equal to 3. The necessary and sufficient conditions for the constructed examples to be (i) connected (ii) group (conjugate) (iii) involutory and (iv)…
In this paper, we explicitly provide expressions for a sequence of orthogonal polynomials associated with a weight matrix of size $N$ constructed from a collection of scalar weights $w_{1}, \ldots, w_{N}$: $$W(x) =…
For an arbitrary matrix dilation, any integer n and any integer/semi-integer c, we describe all masks that are symmetric with respect to the point c and have sum rule of order n. For each such mask, we give explicit formulas for wavelet…
Mekler's construction is a powerful technique for building purely algebraic structures from combinatorial ones. Its power lies in the fact that it allows various model-theoretic tameness properties of the combinatorial structure to transfer…