Related papers: Set Reconstruction on the Hypercube

In this paper, we develop a new method to reconstruct an abelian number field $K$ from the maximal $6$-step solvable quotient of $G_K$ group- theoretically. The new aspect of this paper is that the results in this paper are independent from…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

We formulate hyperbolic uniformization as a Tannakian reconstruction theorem. For a hyperbolic log-orbi curve C, we construct an intrinsic canonical maximal parahoric PSL2-Higgs object. A tensor-functorial parahoric non-abelian…

The Tarski number of an action of a group G on a set X is the minimal number of pieces in a paradoxical decomposition of it. For any k>3 we construct a faithful transitive action of a free group of rank k-1 with Tarski number k. Using…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if for each set $\Omega$ upon which $G$ acts faithfully, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ that leaves invariant each of the $G$-orbits in the…

Given a finite abelian group $G$ and a subset $S\subseteq G$, we let $N_{G,\ S}$ be the smallest integer $N$ such that for any subset $A\subseteq G$ with $N$ elements, we have $g+S\subseteq A$ for some $g\in G$. Using the probabilistic…

For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra.…

Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper, we consider the following very basic recovery question:…

A vertex-subset graph problem $Q$ defines which subsets of the vertices of an input graph are feasible solutions. The reconfiguration version of a vertex-subset problem $Q$ asks whether it is possible to transform one feasible solution for…

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

We undertake a detailed study of the sets of multiplicity in a second countable locally compact group $G$ and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space $\mathcal{B}(L^2(G))$…

We present a new dataset condensation framework termed Squeeze, Recover and Relabel (SRe$^2$L) that decouples the bilevel optimization of model and synthetic data during training, to handle varying scales of datasets, model architectures…

The sequence reconstruction problem was proposed by Levenshtein in 2001. In this model, a sequence from a code is transmitted over several channels, and the decoder receives the distinct outputs from each channel. The main problem is to…

The coprime hypergraph of integers on $n$ vertices $CHI_k(n)$ is defined via vertex set $\{1,2,\dots,n\}$ and hyperedge set $\{\{v_1,v_2,\dots,v_{k+1}\}\subseteq\{1,2,\dots,n\}:\gcd(v_1,v_2,\dots,v_{k+1})=1\}$. In this article we present…

Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…

For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and…