Related papers: Coloured Hard-Dimers
A graph is k-total colourable if there is an assignment of k different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour. The total chromatic number of some direct product…
We develop novel techniques which allow us to prove a diverse range of results relating to subset sums and complete sequences of positive integers, including solutions to several longstanding open problems. These include: solutions to the…
Experimental approaches have been applied to address questions in understanding three-dimensional chromatin organisation and function. As datasets increase in size and complexity, it becomes a challenge to reach a mechanistic interpretation…
Mixtures of polarised fermions of two different masses can form weakly-bound clusters, such as dimers and trimers, that are universally described by the scattering length between the heavy and light fermions. We use the resonating group…
The histogram is an analysis tool in widespread use within many sciences, with high energy physics as a prime example. However, there exists an inherent bias in the choice of binning for the histogram, with different choices potentially…
We investigate the distributions of the number of: (1) monochromatic complete subgraphs over edgewise 2-colorings of complete graphs; and (2) monochromatic arithmetic progressions over 2-colorings of intervals, as statistical Ramsey theory…
If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few…
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…
Horadam sequences and their partial sums are computed via generating functions. The results are as simple as possible.
We propose Generative Probabilistic Image Colorization, a diffusion-based generative process that trains a sequence of probabilistic models to reverse each step of noise corruption. Given a line-drawing image as input, our method suggests…
In this paper we study the generating functionals of several random packing processes: the classical Mat\'ern hard-core model; its extensions, the $k$-Mat\'ern models and the $\infty$-Mat\'ern model, which is an example of random sequential…
This paper describes a sequence of natural numbers that grows faster than any Turing computable function. This sequence is generated from a version of the tiling problem, called a coloring system. In our proof that generates the sequence,…
We analyse here some programming tools (MC-generators) from viewpoint of their application to the tasks of dark matter (DM) interpretation of cosmic rays puzzles. We shortly describe our tasks, where the main goal is the solution of the…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
In this paper, we discuss sums of powers of the positive integers and compute both the exponential and ordinary generating functions for these sums. We express these generating functions in terms of exponential and geometric polynomials and…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
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…
We obtain an estimate for the main term of the counting function for numerical monoids.
We study colored coverage and clustering problems. Here, we are given a colored point set where the points are covered by (unknown) $k$ clusters, which are monochromatic (i.e., all the points covered by the same cluster, have the same…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…