Related papers: Constructions for orthogonal designs using signed …
In this paper we generalize the construction of binary self-orthogonal codes obtained from weakly self-orthogonal designs described by Tonchev in [12] in order to obtain self-orthogonal codes over an arbitrary field. We extend construction…
We introduce and develop a theory of orthogonality with respect to Sobolev inner products on the real line for sequences of functions with a tridiagonal, skew-Hermitian differentiation matrix. While a theory of such L2-orthogonal systems is…
Many problems in areas such as compressive sensing and coding theory seek to design a set of equal-norm vectors with large angular separation. This idea is essentially equivalent to constructing a frame with low coherence. The elements of…
Electronic structure methods that exploit nonorthogonal Slater determinants face the challenge of efficiently computing nonorthogonal matrix elements. In a recent publication, H. G. A. Burton, J. Chem. Phys. 154, 144109 (2021), I introduced…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
The construction of the Varchenko matrix for hyperplane arrangements, first introduced by Alexandre Varchenko, extends naturally to oriented matroids. In this paper, we generalize the theorem of Gao and Zhang by proving that the Varchenko…
We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We construct some families of bipartite signed graphs with only two distinct eigenvalues. This leads to constructing infinite families of regular…
Our focus is on the set of lower-triangular, infinite matrices that have natural operations like addition, multiplication by a number, and matrix multiplication. With respect to addition this set forms and abelian group while with respect…
The purpose of this note is to study the complex structures orthogonal to a given Riemannian metric. For another paper on this topic, we highly recommend the work of Salamon. His work describes in great detail the role that curvature plays…
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…
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…
We define Bush-type generalized Hadamard matrices over abelian groups and construct symmetric Bush-type generalized Hadamard matrices over the additive group of finite field $\mathbb{F}_q$, $q$ a prime power. We then show and study an…
In this paper we introduce modular symmetric designs and use them to study the existence of Hadamard matrices modulo 5. We prove that there exist 5-modular Hadamard matrices of order n if and only if n != 3, 7 (mod 10) or n != 6, 11. In…
We revisit the old idea of constructing difference sets from cyclotomic classes. Two constructions of skew Hadamard difference sets are given in the additive groups of finite fields using unions of cyclotomic classes of order $N=2p_1^m$,…
New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The…
In [8] a notion of generalized Hadamard product was introduced. We show that when certain kinds of tensors interact with the eigenvalues of symmetric matrices the resulting formulae can be nicely expressed using the generalized Hadamard…
Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable…
This paper presents a novel algorithmic framework for the computational design, simulation, and fabrication of a hexagonal grid-based double-curvature structure with planar hexagonal panels. The journey begins with constructing a robust…
The goal of this article is to exhibit two new families of finitely generated simple groups of homeomorphisms of $\mathbf{R}$. These families are strikingly different from existing families owing to the nature of their actions on…
Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…