SearcharxivSearch

arXiv subjects

Giora Dula

Publications and source records attributed to Giora Dula.

4 recordsLinked to original sources

Constructing, Classifying and Studying the Space of Small Integer Weighing Matrices

Integer weighing matrices (IW-matrices for short) are integer valued orthogonal square matrices. One usecase of these is to create classical weighing matrices with various block structures. In this paper we study and classify the space $IW(n,k)$ of the integer weighing matrices of small size $n\times n$ and weight $k$. Our classification includes a full list of all inequivalent matrices up to Hadamard equivalence and automorphism groups. We then continue to a secondary classification of the symmetric and antisymmetric IW up to symmetric Hadamard equivalence. We apply this to the case of projective space weighing matrices. Next we use the classification to count the cardinality of the spaces of all $IW(n,k)$ as well as the symmetric and anti-symmetric subspace. We supply practical algorithms and implement them in \texttt{Sagemath}. Finding an (anti-)symmetric IW matrix in a given Hadamard class can be done for significantly higher orders. In particular we solve some open cases: Symmetric $W(23,16)$, $W(28,25)$ and $W(30,17)$, and an anti-symmetric $W(28,25)$. We conclude by showing a detailed classification of $IW(7,25)$. We have also improved the \texttt{NSOKS} algorithm to find all possible representations of an integer $k$ as a sum of $n$ integer squares.

math.CO

An algorithm for constructing and classifying the space of small integer weighing matrices

In this paper we describe an algorithm for generating all the possible $PIW(m,n,k)$ - integer $m\times n$ Weighing matrices of weight $k$ up to Hadamard equivalence. Our method is efficient on a personal computer for small size matrices, up to $m\le n=12$, and $k\le 50$. As a by product we also improved the \textit{\textbf{nsoks}} \cite{riel2006nsoks} algorithm to find all possible representations of an integer $k$ as a sum of $n$ integer squares. We have implemented our algorithm in \texttt{Sagemath} and as an example we provide a complete classification for \ $n=m=7$ and $k=25$. Our list of $IW(7,25)$ can serve as a step towards finding the open classical weighing matrix $W(35,25)$.

math.CO

Energy Minimization in $CP^n$: Some Numerical and Analytical Results

We study the problem of minimizing the energy function $M^p(m,n) := \min \sum_{1\le i 0$ are integers and $p$ is even. This problem has implications on finding nice polyhedra in projective spaces, and on quantum random access codes. We conduct experimental search in the complex case which suggests nice patterns on the minimum values. In some cases($p=2$ and partially $n=2$) we supply analytical proofs and give full descriptions of the minimal configurations. We also show that as $m\to \infty$, nearly equidistributed configurations points nearly give the minimal values we expect from our patterns.

math.MG

Immersions of RP^{2^e-1}

We prove that RP^{2^e-1} can be immersed in R^{2^{e+1}-e-7} provided e>6. If e>13, this is 1 better than previously known immersions. Our method is primarily an induction on geometric dimension, with compatibility of liftings being a central issue.

math.AT