Related papers: Shotgun reconstruction in the hypercube
In this paper, we deal with the problem of reconstruction from Radon random samples in local shift-invariant signal space. Different from sampling after Radon transform, we consider sampling before Radon transform, where the sample set is…
We prove that every proper edge-coloring of the $n$-dimensional hypercube $Q_n$ contains a rainbow copy of every tree $T$ on at most $n$ edges. This result is best possible, as $Q_n$ can be properly edge-colored using only $n$ colors while…
We show that reconstructing a curve in $\mathbb{R}^d$ for $d\geq 2$ from a $0.66$-sample is always possible using an algorithm similar to the classical NN-Crust algorithm. Previously, this was only known to be possible for $0.47$-samples in…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…
We consider an urn model, whose replacement matrix has all entries nonnegative and is balanced, that is, has constant row sums. We obtain the rates of the counts of balls corresponding to each color for the strong laws to hold. The analysis…
For $n\geq s> r\geq 1$ and $k\geq 2$, write $n \rightarrow (s)_{k}^r$ if every hyperedge colouring with $k$ colours of the complete $r$-uniform hypergraph on $n$ vertices has a monochromatic subset of size $s$. Improving upon previous…
The frequency allocation problem that appeared in the design of cellular telephone networks can be regarded as a multicoloring problem on a weighted hexagonal graph, which opened some still interesting mathematical problems. We generalize…
We study in how far it is possible to reconstruct a graph from various Banach algebras associated to its universal covering, and extensions thereof to quantum statistical mechanical systems. It turns out that most the boundary operator…
In the present work we consider the problem of a reconstruction of eigenfunctions of the Johnson graph $J(n,w)$. We give necessary and sufficient numerical conditions for a unique reconstruction of an eigenfunction with given eigenvalue by…
We study the following question: Given are two $k$-colorings $\alpha$ and $\beta$ of a graph $G$ on $n$ vertices, and integer $\ell$. The question is whether $\alpha$ can be modified into $\beta$, by recoloring vertices one at a time, while…
Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$…
We investigate proper $(a:b)$-fractional colorings of $n$-uniform hypergraphs, which generalize traditional integer colorings of graphs. Each vertex is assigned $b$ distinct colors from a set of $a$ colors, and an edge is properly colored…
Consider an urn model where at each step one of $q$ colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball.…
In recent work by Mossel and Ross, it was asked how large $q$ has to be for a random jigsaw puzzle with $q$ different shapes of "jigs" to have exactly one solution. The jigs are assumed symmetric in the sense that two jigs of the same type…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.
The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the…
We give here some precisions and improvements about the validity of the explicit reconstruction of any holomorphic function on a ball of $\mathbb{C}^2$ from its restrictions on a family of complex lines. Such validity depends on the mutual…