Related papers: Continuous Combinatorics of Abelian Group Actions

A connected Cayley graph for an Abelian group generated by a finite symmetric subset $S$ can be represented by an integer matrix, its Heuberger matrix. We call the number of columns of that matrix its rank and the number of rows its…

The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…

Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $\mathbb F_p$. Given a homogeneous equation $\mathcal L:\sum_{i=1}^k c_i x_i=0$ with $k\ge 3$, we study…

A well-known conjecture of Alspach says that every $2k$-regular Cayley graph of an abelian group can be decomposed into Hamiltonian cycles. We consider an analogous question for infinite abelian groups. In this setting one natural analogue…

A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

Cayley graphs are graphs on algebraic structures, typically groups or group-like structures. In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of cycles, Cayley graphs on some non-abelian groups, and…

We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…

The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…

This is the third and final installment of an exposition of an ACL2 formalization of finite group theory. Part I covers groups and subgroups, cosets, normal subgroups, and quotient groups. Part II extends the theory in the developmnent of…

We prove several consistency results in choiceless set theory ZF+DC regarding countable chromatic numbers of various algebraic hypergraphs on Euclidean spaces.

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

We use cobordism theory to analyse anomalies of finite non-abelian symmetries in 4 spacetime dimensions. By applying the method of `anomaly interplay', which uses functoriality of cobordism and naturality of the $\eta$-invariant to relate…

Let F be a global function field and let F^ab be its maximal abelian extension. Following an approach of D.Hayes, we shall construct a continuous homomorphism \rho: Gal(F^ab/F) \to C_F, where C_F is the idele class group of F. Using class…

For $G$ a finite group acting linearly on $\mathbb{A}^2$, the equivariant Hilbert scheme $\operatorname{Hilb}^r[\mathbb{A}^2/G]$ is a natural resolution of singularities of $\operatorname{Sym}^r(\mathbb{A}^2/G)$. In this paper we study the…

We provide a simple algorithm for constructing Hamiltonian graph cycles (visiting every vertex exactly once) on a set of arbitrarily large finite subgraphs of aperiodic two-dimensional Ammann-Beenker (AB) tilings. Using this result, and the…

Let $G=A_n$, a finite alternating group. We study the commuting graph of $G$ and establish, for all possible values of $n$ barring $13, 14, 17$ and $19$, whether or not the independence number is equal to the clique-covering number.

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…

We survey recent results on multiple transitivity of automorphism groups of affine algebraic varieties. We consider the property of infinite transitivity of the special automorphism group, which is equivalent to flexibility of the…

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…