Related papers: Set Reconstruction on the Hypercube

In submodular covering problems, we are given a monotone, nonnegative submodular function $f: 2^N \rightarrow\mathbb{R}_+$ and wish to find the min-cost set $S\subseteq N$ such that $f(S)=f(N)$. This captures SetCover when $f$ is a coverage…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

We revisit the problem of determining the independent domination number in hypercubes for which the known upper bound is still not tight for general dimensions. We present here a constructive method to build an independent dominating set…

Given a hypercube $\mathcal{Q}^{n} := \{0,1\}^{n}$ in $\mathbb{R}^{n}$ and $k \in \{0, \dots, n\}$, the $k$-th layer $\mathcal{Q}^{n}_{k}$ of $\mathcal{Q}^{n}$ denotes the set of all points in $\mathcal{Q}^{n}$ whose coordinates contain…

We study the problem of reconstructing an unknown point in $\mathbb{R}^d$ from approximate linear queries. This setting arises naturally in applications ranging from low-dimensional remote sensing and signal recovery to high-dimensional…

Finding the maximum number of maximal independent sets in an $n$-vertex graph $G$, $i(G)$, from a restricted class is an extensively studied problem. Let $kK_2$ denote the matching of size $k$, that is a graph with $2k$ vertices and $k$…

We introduce a new variant of the $k$-deck problem, which in its traditional formulation asks for determining the smallest $k$ that allows one to reconstruct any binary sequence of length $n$ from the multiset of its $k$-length…

For non-negative integers $n$ and $k$ with $n \ge k$, a {\em $k$-minor} of a partition $\lambda = [\lambda_1, \lambda_2, \dots]$ of $n$ is a partition $\mu = [\mu_1, \mu_2, \dots]$ of $n-k$ such that $\mu_i \le \lambda_i$ for all $i$. The…

We study maximal subsemigroups of the monoid T(X) of all full transformations on the set X=N of natural numbers containing a given subsemigroup W of T(X) where each element of a given set $U$ is a generator of T(X) modulo W. This note…

In this paper, we characterize the dynamic of every abelian subgroups $\mathcal{G}$ of GL($n$, $\mathbb{K}$), $\mathbb{K} = \mathbb{R}$ or $\mathbb{C}$. We show that there exists a $\mathcal{G}$-invariant, dense open set $U$ in…

Kelly's lemma is a basic result on graph reconstruction. It states that given the deck of a graph $G$ on $n$ vertices, and a graph $F$ on fewer than $n$ vertices, we can count the number of subgraphs of $G$ that are isomorphic to $F$.…

In cross-section-space probability table constructions, reaction-channel levels are reconstructed on fixed total-subgroup nodes and probabilities. Although the standard full-matching reconstruction is uniquely determined, it does not in…

A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically…

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges…

The Levenshtein sequence reconstruction problem studies the reconstruction of a transmitted sequence from multiple erroneous copies of it. A fundamental question in this field is to determine the minimum number of erroneous copies required…

The central problem in sequence reconstruction is to find the minimum number of distinct channel outputs required to uniquely reconstruct the transmitted sequence. According to Levenshtein's work in 2001, this number is determined by the…

For a finite multiset $A$ of an abelian group $G$, let $\text{FS}(A)$ denote the multiset of the $2^{|A|}$ subset sums of $A$. It is natural to ask to what extent $A$ can be reconstructed from $\text{FS}(A)$. We fully solve this problem for…

For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in…