2,614 research outputs found

    Cohomology-Developed Matrices -- constructing families of weighing matrices and automorphism actions

    Full text link
    The aim of this work is to construct families of weighing matrices via their automorphism group action. This action is determined from the 0,1,20,1,2-cohomology groups of the underlying abstract group. As a consequence, some old and new families of weighing matrices are constructed. These include the Paley Conference, the Projective-Space, the Grassmannian, and the Flag-Variety weighing matrices. We develop a general theory relying on low dimensional group-cohomology for constructing automorphism group actions, and in turn obtain structured matrices that we call \emph{Cohomology-Developed matrices}. This "Cohomology-Development" generalizes the Cocyclic and Group Developments. The Algebraic structure of modules of Cohomology-Developed matrices is discussed, and an orthogonality result is deduced. We also use this algebraic structure to define the notion of \emph{Quasiproducts}, which is a generalization of the Kronecker-product

    Divisible Design Graphs

    Get PDF
    AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k;)-Graph

    Balanced generalized weighing matrices and their applications

    Get PDF
    Balanced generalized weighing matrices include well-known classical combinatorial objects such as Hadamard matrices and conference matrices; moreover, particular classes of BGW -matrices are equivalent to certain relative difference sets. BGW -matrices admit an interesting geometrical interpretation, and in this context they generalize notions like projective planes admitting a full elation or homology group. After surveying these basic connections, we will focus attention on proper BGW -matrices; thus we will not give any systematic treatment of generalized Hadamard matrices, which are the subject of a large area of research in their own right. In particular, we will discuss what might be called the classical parameter series. Here the nicest examples are closely related to perfect codes and to some classical relative difference sets associated with affine geometries; moreover, the matrices in question can be characterized as the unique (up to equivalence) BGW -matrices for the given parameters with minimum q-rank.One can also obtain a wealth of monomially inequivalent examples and deter  mine the q-ranks of all these matrices by exploiting a connection with linear shift register sequences

    A survey of complex generalized weighing matrices and a construction of quantum error-correcting codes

    Full text link
    Some combinatorial designs, such as Hadamard matrices, have been extensively researched and are familiar to readers across the spectrum of Science and Engineering. They arise in diverse fields such as cryptography, communication theory, and quantum computing. Objects like this also lend themselves to compelling mathematics problems, such as the Hadamard conjecture. However, complex generalized weighing matrices, which generalize Hadamard matrices, have not received anything like the same level of scrutiny. Motivated by an application to the construction of quantum error-correcting codes, which we outline in the latter sections of this paper, we survey the existing literature on complex generalized weighing matrices. We discuss and extend upon the known existence conditions and constructions, and compile known existence results for small parameters. Some interesting quantum codes are constructed to demonstrate their value.Comment: 33 pages including appendi

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

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

    Selected Papers in Combinatorics - a Volume Dedicated to R.G. Stanton

    Get PDF
    Professor Stanton has had a very illustrious career. His contributions to mathematics are varied and numerous. He has not only contributed to the mathematical literature as a prominent researcher but has fostered mathematics through his teaching and guidance of young people, his organizational skills and his publishing expertise. The following briefly addresses some of the areas where Ralph Stanton has made major contributions
    • …
    corecore