Related papers: Set Reconstruction on the Hypercube

Let $G$ be an induced subgraph of the hypercube $Q_k$ for some $k$. We show that if $|G|$ is a power of $2$ then, for sufficiciently large $n$, the vertex set of $Q_n$ can be partitioned into induced copies of $G$. This answers a question…

In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely Longest Increasing Subsequence Reconfiguration. We give a polynomial-time algorithm for…

The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool…

We show that for any discrete semigroup $X$ the semigroup operation can be extended to a right-topological semigroup operation on the space $G(X)$ of inclusion hyperspaces on $X$. We detect some important subsemigroups of $G(X)$, study the…

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a color-preserving…

We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…

We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tensor decomposition as a sum of rank-one tensors, when given…

If the group of a 2-knot group $K$ has an abelian normal subgroup of rank $\geq1$ which is not finitely generated then either $K$ has no minimal Seifert hypersurface or $K$ is topologically equivalent to Example 10 of Ralph Fox's``{\it A…

Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long,…

Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…

We unify various \'etale groupoid reconstruction theorems such as: 1) Kumjian-Renault's reconstruction from a groupoid C*-algebra. 2) Exel's reconstruction from an ample inverse semigroup. 3) Steinberg's reconstruction from a groupoid ring.…

There are different concepts regarding to tree decomposition of a graph $G$. For the Hypercube $Q_n$, these concepts have been shown to have many applications. But some diverse papers on this subject make it difficult to follow what is…

Harary and Lauri conjectured that the class reconstruction number of trees is 2, that is, each tree has two unlabelled vertex-deleted subtrees that are not both in the deck of any other tree. We show that each tree $T$ can be reconstructed…

We present a general deconstruction procedure aimed at recognizing whether a given conformal model may be obtained as an orbifold of another one, and to identify the twist group and the original model in terms of some readily available…

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case…

Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq…

The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has…

In this paper we show that for any affine complete rational surface singularity there is a correspondence between the dual graph of the minimal resolution and the quiver of the endomorphism ring of the special CM modules. We thus call such…

Let K be the kernel of an epimorphism G -> Z, where G is a finitely presented group. If K has infinitely many subgroups of index 2, 3, or 4, then it has uncountably many. Moreover, if K is the commutator subgroup of a classical knot group…