The number of submatrices of a given type in a Hadamard matrix and related results

DOI10.1016/0095-8956(88)90040-8zbMATH Open0658.05015OpenAlexW2035687898WikidataQ105583547 ScholiaQ105583547MaRDI QIDQ1111555FDOQ1111555

Authors: Vojtěch Rödl, Peter Frankl, Richard M. Wilson 

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90040-8

Recommendations

• \((1,-1)\)-matrices with near-extremal properties
• The maximum number of 2 by 2 odd submatrices in (0,1)-matrices
• Embedding rectangular matrices in hadamard matrices
• An observation about submatrices
• Even \(2 \times 2\) submatrices of a random zero-one matrix

zbMATH Keywords

submatrixgraphs with uniformly distributed edges

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• On universality of graphs with uniformly distributed edges
• A Constructive Solution to a Tournament Problem
• Title not available (Why is that?)
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Graphs which contain all small graphs

Cited In (26)

• Large homogeneous submatrices
• Embedding rectangular matrices in hadamard matrices
• The minimum independence number for designs
• Submatrices of Hadamard matrices: complementation results
• Title not available (Why is that?)
• Generalisations of matrix partitions: complexity and obstructions
• Quasirandomness in hypergraphs
• Quasi-random graphs
• Even \(2 \times 2\) submatrices of a random zero-one matrix
• A Ramsey type problem concerning vertex colourings
• \((1,-1)\)-matrices with near-extremal properties
• Regular pairs in sparse random graphs I
• On characterizing hypergraph regularity
• Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• Quasi-random subsets of \(\mathbb{Z}_ n\)
• Discrepancy and eigenvalues of Cayley graphs
• Quasi‐random classes of hypergraphs
• Ultimate data hiding in quantum mechanics and beyond
• Quasi-random multilinear polynomials
• Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
• Forcing quasirandomness with triangles
• Not all graphs are segment \(T\)-graphs
• Embedding graphs with bounded degree in sparse pseudorandom graphs
• Quasi-Random Set Systems
• The maximum number of 2 by 2 odd submatrices in (0,1)-matrices

This page was built for publication: The number of submatrices of a given type in a Hadamard matrix and related results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111555)