Related papers: Infinite Sum-Product Configurations in Parallel
We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…
A colouring of a graph $G$ has clustering $k$ if the maximum number of vertices in a monochromatic component equals $k$. Motivated by recent results showing that many natural graph classes are subgraphs of the strong product of a graph with…
A matching $M$ in a graph $G$ is connected if all the edges of $M$ are in the same component of $G$. Following \L uczak,there have been many results using the existence of large connected matchings in cluster graphs with respect to regular…
We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fraisse's Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
We study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes, with the extra condition that the ordered concatenation of elements of this…
Let $X_0, X_1, ..., X_k$ with $k \in \IN\cup\{\infty\}$ be sequence spaces $($finite or infinite dimensional$)$ over $\IC$ or $\IR$ with absolute norms $N_i$ for $i = 0, ..., k$, $($i.e., with 1-unconditional bases$)$ such that $\dim X_0 =…
We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that for every…
Inspired by Owings's problem, we investigate whether, for a given an Abelian group $G$ and cardinal numbers $\kappa,\theta$, every colouring $c:G\longrightarrow\theta$ yields a subset $X\subseteq G$ with $|X|=\kappa$ such that $X+X$ is…
Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…
There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…
In 2006 T. Brown asked the following question: Given a non-periodic infinite word $x=x_1x_2x_3\cdots$ with values in a non-empty set $\mathbb{A},$ does there exist a finite coloring $\varphi: \mathbb{A}^+\rightarrow C$ relative to which $x$…
A set of points $S$ in Euclidean space $\mathbb{R}^d$ is called \textit{Ramsey} if any finite partition of $\mathbb{R}^{\infty}$ yields a monochromatic copy of $S$. While characterization of Ramsey set remains a major open problem in the…
We present a short ultrafilter proof of the existence of monochromatic exponential triples $\{a, b, b^a\}$ in any finite coloring of the natural numbers. The proof is given from scratch and uses only Ramsey's theorem, the notion of…
We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…
Given two combinatorial notions $\mathsf{P}_0$ and $\mathsf{P}_1$, can we encode $\mathsf{P}_0$ via $\mathsf{P}_1$. In this talk we address the question where $\mathsf{P}_0$ is 3-coloring of integers and $\mathsf{P}_1$ is product of…
Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the…
We extend a recent result that for the (additive) semigroup of positive integers $\mathbb{N}$, there are continuum many subdirect products of $\mathbb{N} \times \mathbb{N}$ up to isomorphism. We prove that for $U,V$ each one of $\mathbb{Z}$…
Schur's theorem states that in any $k$-colouring of the set of integers $[n]$ there is a monochromatic solution to $a+b=c$, provided $n$ is sufficiently large. Abbott and Wang studied the size of the largest subset of $[n]$ such that there…