Related papers: A doubling construction for Williamson matrices
The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semifields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187--196]. We…
We construct a number of new (v;r,s;lambda) supplementary difference sets (SDS) with v odd and lambda = (r+s)-(v-1)/2. In particular, these give rise to D-optimal matrices of the four new orders 206, 242, 262, 482 constructed here for the…
We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of…
The order of orbit generation in one-dimensional Lorenz-like maps is presented within a two letter symbolics scheme. This order is derived from the natural order of a set of fractions associated to the binary sequences. Its relation to the…
Two Latin squares $L=[l(i,j)]$ and $M=[m(i,j)]$, of even order $n$ with entries $\{0,1,2,\ldots,n-1\}$, are said to be nearly orthogonal if the superimposition of $L$ on $M$ yields an $n\times n$ array $A=[(l(i,j),m(i,j))]$ in which each…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
Williamson's theorem is well known for symmetric matrices. In this paper, we state and re-derive some of the cases of Williamson's theorem for symmetric positive-semi definite matrices and symmetric matrices having negative index 1, due to…
For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…
We study intertwining relations for $n\times n$ matrix non-Hermitian, in general, one-dimensional Hamiltonians by $n\times n$ matrix linear differential operators with nondegenerate coefficients at $d/dx$ in the highest degree. Some methods…
We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…
The notions of weak and strong minimizability of a matrix intertwining operator are introduced. Criterion of strong minimizability of a matrix intertwining operator is revealed. Criterion and sufficient condition of existence of a constant…
We outline two methods of constructing improved composite operators using Wilson fermions.
We discuss two simple but useful observations that allow the construction of modular forms from given ones using invariant theory. The first one deals with elliptic modular forms and their derivatives, and generalizes the Rankin-Cohen…
We introduce the notion of a Morse sequence, which provides a simple and effective approach to discrete Morse theory. A Morse sequence is a sequence composed solely of two elementary operations, that is, expansions (the inverse of a…
In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…
We construct all planar semimodular lattices in three simple steps from the direct product of two chains.
Basic matrices are defined which provide unique building blocks for the class of normal matrices which include the classes of unitary and Hermitian matrices. Unique builders for quantum logic gates are hence derived since a quantum logic…
We give two constructions of grading-restricted vertex (super)algebras. We first give a new construction of a class of grading-restricted vertex (super)algebras originally obtained by Meurman and Primc using a different method. This…