Short Proofs of Khintchine-Type Inequalities for Zero-One Matrices
暂无分享，去创建一个
Abstract If an n × n matrix has entries either zero or one, row sums ri and column sums sj, the ∑r i 2 + ∑s j 2 ⩽ h(n + h n ) Khintchine, Mat. Sb. 39 (1932) , 35–39) and ∑ri2 + ∑sj2 ⩽ nh + ∑risi (Matus, Report 1652, UTIA CSAV (1990)) , where h is the number of ones. Extensions of the inequalities are presented and proved by elementary means.
[1] Extremal two-correlations of two-valued stationary one-dependent processes , 1989 .
[2] W. A. J. Luxemburg. On an Inequality of A. Khintchine for Zero-One Matrices , 1972, J. Comb. Theory, Ser. A.
[3] M. Katz. Rearrangements of (0–1) matrices , 1971 .
[4] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[5] The maximal and minimal 2-correlation of a class of 1-dependent 0–1 valued processes , 1988 .