Related papers: Perfect colourings of cyclotomic integers
A first step in investigating colour symmetries of periodic and nonperiodic patterns is determining the number of colours which allow perfect colourings of the pattern under consideration. A perfect colouring is one where each symmetry of…
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…
Given a Bravais colouring of planar modules $\M_n:=\Z[\xi_n]$, where $\xi_n$ is a primitive $n$th root of unity, two important colour groups arise: the colour symmetry group $H$, which permutes the colours of a given colouring of $\M_n$,…
A coloring of a planar semiregular tiling $\mathcal{T}$ is an assignment of a unique color to each tile of $\mathcal{T}$. If $G$ is the symmetry group of $\mathcal{T}$, we say that the coloring is perfect if every element of $G$ induces a…
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
A vertex colouring of some graph is called perfect if each vertex of colour $i$ has exactly $a_{ij}$ neighbours of colour $j$. Being perfect imposes several restrictions on the colour incidence matrix $(a_{ij})$. We list several (old and…
There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R.…
A perfect coloring (equivalent concepts are equitable partition and partition design) of a graph $G$ is a function $f$ from the set of vertices onto some finite set (of colors) such that every node of color $i$ has exactly $S(i,j)$…
We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…
We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…
Let $G$ be a graph and $C$ a finite set of colours. A vertex colouring $f:V(G)\to C$ is complete if for any pair of distinct colours $c_1,c_2\in C$ one can find an edge $\{v_1,v_2\}\in E(G)$ such that $f(v_i)=c_i$, $i=1,2$. The achromatic…
A vertex colouring of some graph is called perfect if each vertex of colour $i$ has the same number $a_{ij}$ of neighbours of colour $j$. Here we determine all perfect colourings of the edge graphs of the hypercube in dimensions 4 and 5 by…
We prove that the ideal used in recent works to categorify the cyclotomic integers is generated by a cyclotomic polynomial. Moreover, we publish a proof by T. Ekedahl that the $q$-binomial relations used in the tensor product of…
We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…
In this paper we prove that if an infinite circulant graph with $k$ distances has a perfect $2$-colouring with parameters $(b, c)$, then $b + c \leq 2k + \frac{b+c}{q^t}$ for all positive integers $t$ and primes $q$ satisfying…
A coloring of vertices of a given graph is called perfect if the color structure of each ball of radius $1$ in the graph depends only on the color of the ball center. Let $n$ be a positive integer. We consider a lexicographic product of the…
A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…
We list all perfect colorings of $Z^2$ by 9 or less colors. Keywords: perfect colorings, equitable partitions
In this note, we present a new proof that the cyclotomic integers constitute the full ring of integers in the cyclotomic field.
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…