Related papers: Duality for image and kernel partition regularity …

We show that there is a rational vector space $V$ such that, whenever $V$ is finitely coloured, there is an infinite set $X$ whose sumset $X+X$ is monochromatic. Our example is the rational vector space of dimension…

A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…

In recent work, Amdeberhan and Merca considered the integer partition function $a(n)$ which counts the number of integer partitions of weight $n$ wherein even parts come in only one color (i.e., they are monochromatic), while the odd parts…

We show that for any finite partition of $\mathbb{N}$ there is an infinite sequence whose finite sums are monochromatic and such that infinitely many of the products with a fixed number of factors are monochromatic -- though not necessarily…

If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…

The statistical distribution of eigenvalues of pairs of coupled random matrices can be expressed in terms of integral kernels having a generalized Christoffel--Darboux form constructed from sequences of biorthogonal polynomials. For…

Here, we show that the first isomorphism theorem, the orbit-stabilizer theorem, and the non-uniqueness of solutions of underdetermined linear systems are all manifestations of the same underlying algebraic property. We will call this…

Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…

The set of finite binary matrices of a given size is known to carry a finite type A bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and…

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

A particular case of the Hindman--Galvin--Glazer theorem states that, for every partition of an infinite abelian group $G$ into two cells, there will be an infinite $X\subseteq G$ such that the set of its finite sums…

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…

We classify certain categories of partitions of finite sets subject to specific rules on the colorization of points and the sizes of blocks. More precisely, we consider pair partitions such that each block contains exactly one white and one…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…

A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines $\ell_1$ and $\ell_2$, one on each. A bipartite permutation graph is a permutation graph which is bipartite. In the the…

We use semi-invariant pictures to prove two conjectures about maximal green sequences. First: if $Q$ is any acyclic valued quiver with an arrow $j\to i$ of infinite type then any maximal green sequence for $Q$ must mutate at $i$ before…

We consider a series of questions that grew out of determining when two quantum planes are isomorphic. In particular, we consider a similar question for quantum matrix algebras and certain ambiskew polynomial rings. Additionally, we modify…

The aim of this paper is to study integer rounding properties of various systems of linear inequalities to gain insight about the algebraic properties of Rees algebras of monomial ideals and monomial subrings. We study the normality and…

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…