Related papers: Shotgun reconstruction in the hypercube

For a graph $G$, the $k$-recolouring graph $\mathcal{R}_k(G)$ is the graph whose vertices are the $k$-colourings of $G$ and two colourings are joined by an edge if they differ in colour on exactly one vertex. We prove that for all $n \ge…

Given a random binary picture $P_n$ of size $n$, i.e., an $n\times n$ grid filled with zeros and ones uniformly at random, when is it possible to reconstruct $P_n$ from its $k$-deck, i.e., the multiset of all its $k\times k$ subgrids? We…

The Reconstruction Conjecture of Ulam asserts that, for $n\geq 3$, every $n$-vertex graph is determined by the multiset of its induced subgraphs with $n-1$ vertices. The conjecture is known to hold for various special classes of graphs but…

The "reconfiguration problem" for circular colourings asks, given two $(p,q)$-colourings $f$ and $g$ of a graph $G$, is it possible to transform $f$ into $g$ by changing the colour of one vertex at a time such that every intermediate…

Single-shot wide-angle diffraction imaging is a widely used method to investigate the structure of non-crystallizing objects such as nanoclusters, large proteins or even viruses. Its main advantage is that information about the…

High resolution reconstruction of complicated objects from incomplete and noisy data can be achieved by solving modulation equations iteratively under physical constraints. This direct demodulation method is a powerful technique for dealing…

We formulate and investigate a statistical inverse problem of a random tomographic nature, where a probability density function on $\mathbb{R}^3$ is to be recovered from observation of finitely many of its two-dimensional projections in…

A cube-like graph is a Cayley graph for the elementary abelian group of order $2^n$. In studies of the chromatic number of cube-like graphs, the $k$th power of the $n$-dimensional hypercube, $Q_n^k$, is frequently considered. This coloring…

Inspired by structural colors in avian species, various synthetic strategies have been developed to produce non-iridescent, saturated colors using nanoparticle assemblies. Mixtures of nanoparticles varying in particle chemistry (or complex…

A rainbow $q$-coloring of a $k$-uniform hypergraph is a $q$-coloring of the vertex set such that every hyperedge contains all $q$ colors. We prove that given a rainbow $(k - 2\lfloor \sqrt{k}\rfloor)$-colorable $k$-uniform hypergraph, it is…

Inspired by Bondarenko's counter-example to Borsuk's conjecture, we notice some strongly regular graphs that provide examples of ball packings whose chromatic numbers are significantly higher than the dimensions. In particular, from…

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

Let $n \ge d \ge \ell \ge 1$ be integers, and denote the $n$-dimensional hypercube by $Q_n$. A coloring of the $\ell$-dimensional subcubes $Q_\ell$ in $Q_n$ is called a $Q_\ell$-coloring. Such a coloring is $d$-polychromatic if every $Q_d$…

For a list-assignment $L$, the reconfiguration graph $C_L(G)$ of a graph $G$ is the graph whose vertices are proper $L$-colorings of $G$ and whose edges link two colorings that differ on only one vertex. If $|L(v)| \ge d(v) + 2$ for every…

For a given $\delta \in (0,1)$, the randomly perturbed graph model is defined as the union of any $n$-vertex graph $G_0$ with minimum degree $\delta n$ and the binomial random graph $\mathbf{G}(n,p)$ on the same vertex set. Moreover, we say…

We study an issue commonly seen with graph data analysis: many real-world complex systems involving high-order interactions are best encoded by hypergraphs; however, their datasets often end up being published or studied only in the form of…

A coloring on a finite or countable set $X$ is a function $\varphi: [X]^{2} \to \{0,1\}$, where $[X]^{2}$ is the collection of unordered pairs of $X$. The collection of homogeneous sets for $\varphi$, denoted by $Hom(\varphi)$, consist of…

Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…

Let $c$ be an edge-coloring of the complete $n$-vertex graph $K_n$. The problem of finding properly colored and rainbow Hamilton cycles in $c$ was initiated in 1976 by Bollob\'as and Erd\H os and has been extensively studied since then.…

We consider the problem of developing a method to reconstruct a potential $q$ from the partial data Dirichlet-to-Neumann map for the Schr\"odinger equation $(-\Delta_g+q)u=0$ on a fixed admissible manifold $(M,g)$. If the part of the…