New polynomial and multidimensional extensions of classical partition results

In the 1970s Deuber introduced the notion of $(m,p,c)$-sets in $\mathbb{N}$ and showed that these sets are partition regular and contain all linear partition regular configurations in $\mathbb{N}$. In this paper we obtain enhancements and extensions of classical results on $(m,p,c)$-sets in two directions. First, we show, with the help of ultrafilter techniques, that Deuber's results extend to polynomial configurations in abelian groups. In particular, we obtain new partition regular polynomial configurations in $\mathbb{Z}^d$. Second, we give two proofs of a generalization of Deuber's results to general commutative semigroups. We also obtain a polynomial version of the central sets theorem of Furstenberg, extend the theory of $(m,p,c)$-systems of Deuber, Hindman and Lefmann and generalize a classical theorem of Rado regarding partition regularity of linear systems of equations over $\mathbb{N}$ to commutative semigroups.Comment: Some typos, including a terminology confusion involving the words `clique' and `shape', were fixe

Caterpillar dualities and regular languages

We characterize obstruction sets in caterpillar dualities in terms of regular languages, and give a construction of the dual of a regular family of caterpillars. We show that these duals correspond to the constraint satisfaction problems definable by a monadic linear Datalog program with at most one EDB per rule

Minimizing the number of independent sets in triangle-free regular graphs

Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of $K_{d,d}$. Their proof uses linear programming bounds on the distribution of a cleverly chosen random variable. In this paper, we use this method to give lower bounds on the independence polynomial of regular graphs. We also give new bounds on the number of independent sets in triangle-free regular graphs

Moufang sets and structurable division algebras

A Moufang set is essentially a doubly transitive permutation group such that each point stabilizer contains a normal subgroup which is regular on the remaining vertices; these regular normal subgroups are called the root groups, and they are assumed to be conjugate and to generate the whole group. It has been known for some time that every Jordan division algebra gives rise to a Moufang set with abelian root groups. We extend this result by showing that every structurable division algebra gives rise to a Moufang set, and conversely, we show that every Moufang set arising from a simple linear algebraic group of relative rank one over an arbitrary field k of characteristic different from 2 and 3 arises from a structurable division algebra. We also obtain explicit formulas for the root groups, the tau-map and the Hua maps of these Moufang sets. This is particularly useful for the Moufang sets arising from exceptional linear algebraic groups