We provide a unified approach for constructing Wick words in mixed q-Gaussian algebras, which are generated by sj = aj +a ∗ j , j = 1, · · · , N, where aia ∗ j −qija ∗ j ai = δij . Here we also allow equality in −1 ≤ qij = qji ≤ 1. This approach relies on Speicher’s central limit theorem and the ultraproduct of von Neumann algebras. We also use the unified argument to show that the Ornstein–Uhlenbeck semigroup is hypercontractive, the Riesz transform associated to the number operator is bounded, and the number operator satisfies the Lp Poincar´e inequalities with constants C √p. Finally we prove that the mixed q-Gaussian algebra is weakly amenable and strongly solid in the sense of Ozawa and Popa. Our approach is mainly combinatorial and probabilistic. The results in this paper can be regarded as generalizations of previous results due to Speicher, Biane, Lust-Piquard, Avsec, et al.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. Erd\"{o}s raised the problem of determining $f(n)$. Erd\"{o}s conjectured that there exists a positive constant $c$ such that $ex(n,C_{2k})\geq cn^{1+1/k}$. Haj\'{o}s conjecture that every simple even graph on $n$ vertices can be decomposed into at most $n/2$ cycles. We present the problems, conjectures related to these problems and we summarize the know results. We do not think Haj\'{o}s conjecture is true.