Suitable Permutations, Binary Covering Arrays, and Paley Matrices

DOI10.1007/978-3-319-17729-8_3zbMath1329.05039OpenAlexW2337000424MaRDI QIDQ3466746

Charles J. Colbourn

Publication date: 25 January 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17729-8_3

zbMATH Keywords

Hadamard matrixGolomb rulerPaley matrixdirected block designsuitable sets of permutations

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Constructions and nonexistence results for suitable sets of permutations ⋮ Largest minimal inversion-complete and pair-complete sets of permutations ⋮ Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ Better bounds for poset dimension and boxicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of binary covering arrays
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Covering and radius-covering arrays: constructions and classification
• Covering arrays from cyclotomy
• On the dimensions of ordered sets of bounded degree
• Orthogonal arrays. Theory and applications
• Classification of Hadamard matrices of order 28
• On the order dimension of 1-sets versus \(k\)-sets
• A review of the available construction methods for Golomb rulers
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On the classification of Hadamard matrices of order 32
• Iterative Exhaustive Pattern Generation for Logic Testing
• Hadamard Matrices of Order 32
• Binary Covering Arrays and Existentially Closed Graphs
• A Constructive Solution to a Tournament Problem
• Minimal scrambling sets of simple orders
• Concerning a Certain Set of Arrangements
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: Suitable Permutations, Binary Covering Arrays, and Paley Matrices