scholarly journals A CLT for multi-dimensional martingale differences in a lexicographic order

2016 ◽  
Vol 126 (5) ◽  
pp. 1503-1510
Author(s):  
Guy Cohen
2014 ◽  
Vol 57 (1) ◽  
pp. 17-82 ◽  
Author(s):  
TUOMAS P. HYTÖNEN ◽  
ANTTI V. VÄHÄKANGAS

AbstractWe extend the local non-homogeneous Tb theorem of Nazarov, Treil and Volberg to the setting of singular integrals with operator-valued kernel that act on vector-valued functions. Here, ‘vector-valued’ means ‘taking values in a function lattice with the UMD (unconditional martingale differences) property’. A similar extension (but for general UMD spaces rather than UMD lattices) of Nazarov-Treil-Volberg's global non-homogeneous Tb theorem was achieved earlier by the first author, and it has found applications in the work of Mayboroda and Volberg on square-functions and rectifiability. Our local version requires several elaborations of the previous techniques, and raises new questions about the limits of the vector-valued theory.


2019 ◽  
Vol 125 ◽  
pp. 58-71 ◽  
Author(s):  
Lázaro Bustio-Martínez ◽  
Martín Letras-Luna ◽  
René Cumplido ◽  
Raudel Hernández-León ◽  
Claudia Feregrino-Uribe ◽  
...  

10.37236/8186 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Sheila Sundaram

In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1^n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this conjecture and establish its truth in the following special cases: for $\mu\in [(n-4,1^4), (n)]$  or $\mu\in [(1^n), (3,1^{n-3})], $ or $\mu=(3, 2^k, 1^r)$ when $k\geq 1$ and $0\leq r\leq 2.$  Many new Schur positivity questions are presented.


10.37236/4784 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Shagnik Das ◽  
Benny Sudakov

The celebrated Erdős-Ko-Rado theorem shows that for $n \ge 2k$ the largest intersecting $k$-uniform set family on $[n]$ has size $\binom{n-1}{k-1}$. It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting.We consider the most probably intersecting problem for $k$-uniform set families. We provide a rough structural characterisation of the most probably intersecting families and, for families of particular sizes, show that the initial segment of the lexicographic order is optimal.


2012 ◽  
Vol 116 (1-4) ◽  
pp. 25-33 ◽  
Author(s):  
Michelangelo Bucci ◽  
Alessandro De Luca ◽  
Luca Q. Zamboni

2021 ◽  
pp. 418-437
Author(s):  
James Davidson

This chapter looks in detail at proofs of the weak law of large numbers (convergence in probability) using the technique of establishing convergence in Lp‐norm. The extension to a proof of almost‐sure convergence is given, and then special results for martingale differences, mixingales, and approximable processes. These results are proved in array notation to allow general forms of heterogeneity.


1980 ◽  
Vol 17 (01) ◽  
pp. 178-186 ◽  
Author(s):  
Bo Bergman

In this paper it is shown that for a large class of replacement problems the class of stationary replacement strategies is complete, i.e. in order to minimize the average long run cost per unit time it suffices to consider replacement rules which are equal for each new unit irrespectively of what has been observed from earlier units. The main result is based on a version of the law of large numbers for martingale differences proved in the appendix.


Sign in / Sign up

Export Citation Format

Share Document