Discrepancy of high-dimensional permutations

DOI10.19086/da.845zbMath1346.05006arXiv1512.04123OpenAlexW2963356545MaRDI QIDQ2826225

Nathan Linial, Zur Luria

Publication date: 10 October 2016

Published in: Discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.04123

zbMATH Keywords

Latin square

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (7)

Simplicial homeomorphs and trace-bounded hypergraphs ⋮ Substructures in Latin squares ⋮ Large deviations in random latin squares ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ Almost all Steiner triple systems are almost resolvable ⋮ Coloured and Directed Designs ⋮ A universal exponent for homeomorphs

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound on the number of high-dimensional permutations
• A note on the random greedy triangle-packing algorithm
• Sidon sets in groups and induced subgraphs of Cayley graphs
• Large product-free subsets of finite groups
• Expander graphs and their applications
• Quasirandom Groups
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Geometric discrepancy. An illustrated guide

This page was built for publication: Discrepancy of high-dimensional permutations