Related papers: Indistinguishable sceneries on the Boolean hypercu…
Given a function $f$ on the vertex set of some graph $G$, a scenery, let a simple random walk run over the graph and produce a sequence of values. Is it possible to, with high probability, reconstruct the scenery $f$ from this random…
A Boolean function $f:V \to \{-1,1\}$ on the vertex set of a graph $G=(V,E)$ is locally $p$-stable if for every vertex $v$ the proportion of neighbours $w$ of $v$ with $f(v)=f(w)$ is exactly $p$. This notion was introduced by Gross and…
Mossel and Ross raised the question of when a random colouring of a graph can be reconstructed from local information, namely the colourings (with multiplicity) of balls of given radius. In this paper, we are concerned with random…
We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…
For each Boolean graph $B_n$, it is proved that both $B_n$ and its complement graph $\overline{B_n}$ are vertex decomposable. It is also proved that $B_n$ is an unmixed graph, thus it is also Cohen-Macaulay.
We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…
In the present paper we describe new heuristic technique, which can be applied to the optimization of pseudo-Boolean functions including Black-Box functions. This technique is based on a simple procedure which consists in transition from…
We study a reconstruction problem for colorings. Given a finite or countable set $X$, a coloring on $X$ is a function $\varphi: [X]^{2}\to \{0,1\}$, where $[X]^{2}$ is the collection of all 2-elements subsets of $X$. A set $H\subseteq X$ is…
We construct a smooth locally finite Borel graph $G$ and a local coloring problem $\Pi$ such that $G$ has a coloring $V(G) \to \mathbb{N}$ that solves $\Pi$, but no such coloring can be Borel.
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…
Reconstructing photo-realistic large-scale scenes from images, for example at city scale, is a long-standing problem in computer graphics. Neural rendering is an emerging technique that enables photo-realistic image synthesis from…
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…
We study the ubiquitous super-resolution problem, in which one aims at localizing positive point sources in an image, blurred by the point spread function of the imaging device. To recover the point sources, we propose to solve a convex…
We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lemma on the cube. The main result is the following: for any…
A reconstruction problem is formulated for Sperner systems, and infinite families of nonreconstructible Sperner systems are presented. This has an application to a reconstruction problem for functions of several arguments and identification…
Let $f:\{-1,1\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\{-1,1\}^n$ that runs in time polynomial in $n$ and…
In this paper, we for the first time prove local solvability and stability of the inverse Sturm-Liouville problem with complex-valued singular potential and with polynomials of the spectral parameter in the boundary conditions. The proof…
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…
We study the problem of color reversal in bicolored graphs under local inversions. A \emph{bicoloration} of a graph $G=(V,E)$ is a mapping $\beta: V \to \{-1,1\}$. A \emph{local inversion} at a vertex $v \in V$ consists of reversing the…
Point cloud reconstruction from raw point cloud has been an important topic in computer graphics for decades, especially due to its high demand in modeling and rendering applications. An important way to solve this problem is establishing a…