Generalized semimodularity: order statistics

02/14/2019
by   Iosif Pinelis, et al.
0

A notion of generalized n-semimodularity is introduced, which extends that of (sub/super)modularity in four ways at once. The main result of this paper, stating that every generalized (n2)-semimodular function on the nth Cartesian power of a distributive lattice is generalized n-semimodular, may be considered a multi/infinite-dimensional analogue of the well-known Muirhead lemma in the theory of Schur majorization. This result is also similar to a discretized version of the well-known theorem due to Lorentz, which latter was given only for additive-type functions. Illustrations of our main result are presented for counts of combinations of faces of a polytope; one-sided potentials; multiadditive forms, including multilinear ones -- in particular, permanents of rectangular matrices and elementary symmetric functions; and association inequalities for order statistics. Based on an extension of the FKG inequality due to Rinott & Saks and Aharoni & Keich, applications to correlation inequalities for order statistics are given as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2019

Iterated Jackknives and Two-Sided Variance Inequalities

We consider the variance of a function of n independent random variables...
research
04/28/2022

Information Inequalities via Submodularity and a Problem in Extremal Graph Theory

The present paper offers, in its first part, a unified approach for the ...
research
05/05/2022

Effective poset inequalities

We explore inequalities on linear extensions of posets and make them eff...
research
04/14/2022

Isoperimetric Inequalities Made Simpler

We give an alternative, simple method to prove isoperimetric inequalitie...
research
05/02/2019

Noncommutative versions of inequalities in quantum information theory

In this paper, we aim to replace in the definitions of covariance and co...
research
06/12/2020

On the optimal constants in the two-sided Stechkin inequalities

We address the optimal constants in the strong and the weak Stechkin ine...
research
09/27/2018

Entropy versions of additive inequalities

The connection between inequalities in additive combinatorics and analog...

Please sign up or login with your details

Forgot password? Click here to reset