On combinatorial rectangles with minimum ∞−discrepancy

DOI10.54550/ECA2021V1S1R7zbMath1491.05009arXiv1909.05648OpenAlexW3209083358MaRDI QIDQ5093423

Chunwei Song, Bowen Yao

Publication date: 26 July 2022

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

majorization relationcombinatorial rectangleminimum discrepancymatrix enumeration

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16) Irregularities of distribution, discrepancy (11K38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of arrays and a generalization related to contingency tables
• A lower bound for the hitting set size for combinatorial rectangles and an application
• Discrepancy of set-systems and matrices
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• On the discrepancy of combinatorial rectangles
• On the enumeration of rectangular (0, 1)-matrices
• Sufficient Dimension Reduction via Inverse Regression
• Inequalities: theory of majorization and its applications

This page was built for publication: On combinatorial rectangles with minimum ∞−discrepancy