An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. We then use this structure to prove Ramsey-type results within Gallai colorings. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decomposition into directed trees...

The quon algebra is an approach to particle statistics in order to provide a theory in which the Pauli exclusion principle and Bose statistics are violated by a small amount. The quons are particles whose annihilation and creation operators obey the quon algebra which interpolates between fermions and bosons. In this paper we generalize these models by introducing a deformation of the quon algebra generated by a collection of operators $a_{i,k}$, $(i,k)\in {\mathbb{N}}^{*}\times \left[m\right]$, on an infinite dimensional vector space satisfying the...

We prove a density version of the Carlson–Simpson Theorem. Specifically we show the following. For every integer $k\ge 2$ and every set $A$ of words over $k$ satisfying $\lim {\sup }_{n\to \infty }|A\cap {\left[k\right]}^n|/k^n>0$ there exist a word $c$ over $k$ and a sequence $\left(w_n\right)$ of left variable words over $k$ such that the set $c\cup \{c^{}{w}_0{\left(a_0\right)}^{}..{.}^{}{w}_n\left(a_n\right):n\in \mathbb{N}\text{and}{a}_0,...,a_n\in \left[k\right]\}$ is contained in $A$. While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.

One usually studies the random walk model of a cat moving from one room to another in an apartment. Imagine now that the cat also has the possibility to go from one apartment to another by crossing some corridors, or even from one building to another. That yields a new probabilistic model for which each corridor connects the entrance rooms of several apartments. This article computes the determinant of the stochastic matrix associated to such random walks. That new model naturally allows to compute...

We show that the Schreier sets $S_{\alpha }(\alpha <{\omega }_1)$ have the following dichotomy property. For every hereditary collection ℱ of finite subsets of ℱ, either there exists infinite $M={\left(m_i\right)}_{i=1}^{\infty }\subseteq \mathbb{N}$ such that $S_{\alpha }\left(M\right)=m_i:i\in E:E\in S_{\alpha }\subseteq ℱ$, or there exist infinite $M={\left(m_i\right)}_{i=1}^{\infty },N\subseteq \mathbb{N}$ such that $ℱ\left[N\right]\left(M\right)=m_i:i\in F:F\in ℱandF\subset N\subseteq S_{\alpha }$.

Applying results of the infinitary Ramsey theory, namely the dichotomy principle of Galvin-Prikry, we show that for every sequence ${\left({\alpha }_j\right)}_{j=1}^{\infty }$ of scalars, there exists a subsequence ${\left({\alpha }_{k_j}\right)}_{j=1}^{\infty }$ such that either every subsequence of ${\left({\alpha }_{k_j}\right)}_{j=1}^{\infty }$ defines a universal series, or no subsequence of ${\left({\alpha }_{k_j}\right)}_{j=1}^{\infty }$ defines a universal series. In particular examples we decide which of the two cases holds.

Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.