Related papers: Coding for Sunflowers

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

In 2019, Aharoni proposed a conjecture generalizing the Caceetta-H\"aggkvist conjecture: if an $n$-vertex graph $G$ admits an edge coloring (not necessarily proper) with $n$ colors such that each color class has size at least $r$, then $G$…

A $d$-simplex is defined to be a collection $A_1,\dots,A_{d+1}$ of subsets of size $k$ of $[n]$ such that the intersection of all of them is empty, but the intersection of any $d$ of them is non-empty. Furthermore, a $d$-cluster is a…

The matching number of a family of subsets of an $n$-element set is the maximum number of pairwise disjoint sets. The families with matching number $1$ are called intersecting. The famous Erd\H os-Ko-Rado theorem determines the size of the…

A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…

For every even positive integer $k\ge 4$ let $f(n,k)$ denote the minimim number of colors required to color the edges of the $n$-dimensional cube $Q_n$, so that the edges of every copy of $k$-cycle $C_k$ receive $k$ distinct colors.…

Dvir and Moran proved the following upper bound for the size of a family $\mbox{$\cal F$}$ of subsets of $[n]$ with $\mbox{Vdim}(\mbox{$\cal F$} \Delta \mbox{$\cal F$})\leq d$. Let $d\leq n$ be integers. Let $\mbox{$\cal F$}$ be a family of…

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is…

Let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-set $[n]=\{1,2,\ldots,n\}$. Let $n>2k$ and let $\mathcal{F}\subset \binom{[n]}{k}$ be an {\it intersecting} $k$-graph, i.e., $F\cap F'\neq \emptyset$ for all…

Folded Reed-Solomon (FRS) and univariate multiplicity codes are prominent polynomial codes over finite fields, renowned for achieving list decoding capacity. These codes have found a wide range of applications beyond the traditional scope…

The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…

A $\left(n,\ell,\gamma\right)$-sharing set family of size $m$ is a family of sets $S_1,\ldots,S_m\subseteq [n]$ s.t. each set has size $\ell$ and each pair of sets shares at most $\gamma$ elements. We let $m\left(n,\ell,\gamma\right)$…

Let $\mathbb{F}_p$ be the field with $p$ elements with $p$ prime, $X_1,\ldots, X_n$ pairwise disjoint subsets of $\mathbb{F}_p$with at least $3$ elements such that $\sum_{i=1}^n|X_i|\leq p-5$, and $\mathbb{S}_n$ the set of permutations of…

We present results on coding using multisets instead of ordered sequences. The study is motivated by a moving object tracking problem in a sensor network and can find applications in settings where the order of the symbols in a codeword…

A standard seaweed subalgebra of $A_{n-1}=\mathfrak{sl}(n)$ may be parametrized by a pair of compositions of the positive integer $n$. For all $n$ and certain $k(n)$, we provide closed-form formulas and the generating functions for $C(n,k)$…

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For each integer $k\geq 1$, let $S_{n,k}$ be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles. A subset $H\subseteq S_{n,k}$ is to be a matching if…

A subset $A$ of $[n] = \{1, \dots, n\}$ is $k$-separated if, when the elements of $[n]$ are considered on a circle, between any two elements of $A$ there are at least $k$ elements of $[n]$ that are not in $A$. A family $\mathcal{A}$ of sets…

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…