On the CLT for rotations and BV functions

Let $x?x+\alpha$ be a rotation on the circle and let φ be a step function. Denote by ${\phi }_n(x)$ the ergodic sums ${\sum }_{j=0}^{n?1}\phi (x+j\alpha )$. For α in a class containing the rotations with bounded partial quotients and under a Diophantine condition on the discontinuities of φ, we show that ${\phi }_n/{6{\phi }_{n}6}_2$ is asymptotically Gaussian for n in a set of density 1.     

On the chromatic number of some P5-free graphs

Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, $V(H)$ can be partitioned into A and B such that $H[A]$ is perfect and $\omega (H[B])<\omega (H)$. We use $P_t$ and $C_t$ to denote a path and a cycle on t vertices, respectively. For two disjoint graphs $F_1$ and $F_2$, we use $F_1\cup F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and use $F_1+F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)\cup \{xy|x\in V(F_1)\text{ and }y\in V(F_2)\}$. In this paper, we prove that (i) $(P_5,C_5,K_{2,3})$-free graphs are perfectly divisible, (ii) $\chi (G)\le 2{\omega }^2(G)?\omega (G)?3$ if G is $(P_5,K_{2,3})$-free with $\omega (G)\ge 2$, (iii) $\chi (G)\le \frac{3}{2}({\omega }^2(G)?\omega (G))$ if G is $(P_5,K_1+2K_2)$-free, and (iv) $\chi (G)\le 3\omega (G)+11$ if G is $(P_5,K_1+(K_1\cup K_3))$-free.     

Point partition numbers: Decomposable and indecomposable critical graphs

Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number ${\chi }_t(G)$ is the least integer k for which G admits a coloring with k colors such that each color class induces a $(t?1)$-degenerate subgraph of G. So ${\chi }_1$ is the chromatic number and ${\chi }_2$ is the point arboricity. The point partition number ${\chi }_t$ with $t\ge 1$ was introduced by Lick and White. A graph G is called ${\chi }_t$-critical if every proper subgraph H of G satisfies ${\chi }_t(H)<{\chi }_t(G)$. In this paper we prove that if G is a ${\chi }_t$-critical graph whose order satisfies $|G|\le 2{\chi }_t(G)?2$, then G can be obtained from two non-empty disjoint subgraphs $G_1$ and $G_2$ by adding t edges between any pair $u,v$ of vertices with $u\in V(G_1)$ and $v\in V(G_2)$. Based on this result we establish the minimum number of edges possible in a ${\chi }_t$-critical graph G of order n and with ${\chi }_t(G)=k$, provided that $n\le 2k?1$ and t is even. For $t=1$ the corresponding two results were obtained in 1963 by Tibor Gallai.     

The Orlicz inequality for multilinear forms

The Orlicz $({?}_2,{?}_1)$-mixed inequality states that${\left(\sum _{j_1=1}^n{\left(\sum _{j_2=1}^n|A(e_{j_1},e_{j_2})|\right)}^2\right)}^{\frac{1}{2}}\le \sqrt{2}6A6$ for all bilinear forms $A:{\mathbb{K}}^n\times {\mathbb{K}}^n\to \mathbb{K}$ and all positive integers n, where ${\mathbb{K}}^n$ denotes ${\mathbb{R}}^n$ or ${\mathbb{C}}^n$ endowed with the supremum norm. In this paper we extend this inequality to multilinear forms, with ${\mathbb{K}}^n$ endowed with ${?}_p$ norms for all $p\in [1,\infty ]$.