Superimposed codes

Zoltán Füredi

Renyi Institute of Mathematics, Budapest, Hungary

February, 2012

Zoltan Furedi Superimposed codes

Binary codes and the corresponding hypergraphs
Two equivalent settings:

A code C ⊂ {0, 1}n

Frequently, C ⊂ Fn2 .

Supports of v ∈ C form a hypergraph F ⊂ 2V , where usually

V = [n] := {1, 2, . . . , n}.
Obviously, v ↔ F and C ↔ F
H = (V , F) is a hypergraph with vertex set V , edge set F ⊆ 2V .

F is r -uniform if |F | = r for all F ∈ F

the weight of every codeword is r .
i.e.,
V
r : the set of all r
-subsets of V .
V n

If |V | = n then | r | = r .

Zoltan Furedi Superimposed codes

Motivation: Superimposed codes
Many instances in Coding Theory
codewords must be restored from partial
x1
information, like x2
• defected data (error correcting codes), or .. y
.
• some superposition of the strings.
xt
These lead to superimposed codes.
(
AIM: No confusion on parallel transmission. j
0 if ∀i : xi = 0;
yj =
1 otherwise.
• Lots of versions and related problems.

t simultaneous transmissions x1 , . . . , xt ∈ C
such that ∀xi can be identified. I.e.,
Definition (t-union-free families.)
A1 ∪ A2 ∪ · · · ∪ At 6=B1 ∪ B2 ∪ · · · ∪ Bt .

Zoltan Furedi Superimposed codes

AIM of talk
Definition (Binary codes and the corresponding hypergraphs)
Code: C ⊂ {0, 1}n ↔ F ⊂ 2[n] . [n] := {1, 2, . . . , n}

STANDARD MODEL:
All parties (transmitters, receivers) agree on a code C.

PROBLEMS:
1. Find C with appropriate properties.
(error-correction, non-overlapping, etc.)
2. Estimate max |C|.

AIM OF TALK:
To exhibit connections between coding theory and
extremal hypergraphs (Turan type problems).
We illustrate our method to estimate the size of cancellative codes.

Zoltan Furedi Superimposed codes

Examples for superimposed codes

Definition (t-union-free families.)

A1 ∪ A2 ∪ · · · ∪ At 6=B1 ∪ B2 ∪ · · · ∪ Bt .

UNIONFREE(n, t) := max |C| =?

(Lindström 1969, Coppersmith & Shearer 1998)
t-cover-free families: S
∀A1 , . . . , At+1 ∈ F ∀i ∈ [t + 1], Ai 6⊂ 1≤j≤t+1,j6=i Aj .
COVFREE(n, t) := max |C| =?
(Kautz & Singleton 1960, Dyachkov & Rykov 1982, Hwang & T. Sós,
Erdős-Frankl-ZF 1982,1985, Linial, Vishvanathan-Szegedy, Ruszinko)
Locally thin families: S
∀A1 , . . . , At+1 ∈ F ∃i ∈ [t + 1] : Ai \ j:j6=i Aj 6= ∅.
(Alon & Körner 2000, Alon, Körner, Fachini & Monti 2000)

Zoltan Furedi Superimposed codes

The rate of codes
F is t-cover-free if A0 ⊂ A1 ∪ · · · ∪ At =⇒ A0 ∈ {A1 , . . . , At }.
No union of t codewords can cover another (on n vertices).

CF(n, t) := max |F|

n

Case t = 1. (Sperner 1928) CF(n, 1) = ⌊n/2⌋ .
Case t ≥ 2 unsolved.

We are interested the case when t is fixed and n → ∞.

Theorem (Dyachkov and Rykov 1982; Ruszinkó 1994; ZF 1996)
Asymptotic. ∃c1 , c2 > 0 such that for n > n0 (t)
2 2
2c1 n/t ≤ CF(n, t) ≤ UF(n, t) ≤ 2c2 n log t/t

Lower bound: random.

Zoltan Furedi Superimposed codes

Union-free families, t = 2

Question:
(Erdős and Moser, 1969) F is (strongly) union-free if

all the |F2 | pairwise unions are distinct. UF(n, 2) := max |F|.
Obviously, |F2 | ≤ 2n implying

UF(n, 2) < 1 + 2(n+1)/2 .

In Frankl and Füredi 1984 two construction:

Standard random choice: exponent is at least (.2534 + o(1))n,
algebraic construction: exponent is at least (n − 1)/4.

Best bounds (Coppersmith, Shearer 1998)

log2 UF(n, 2)
.3134 + o(1) ≤ ≤ .4998 + o(1).
n

Zoltan Furedi Superimposed codes

Remark on weakly union-free families

F is weakly union-free if it does not contain four distinct sets

A, B, C, D with A ∪ B = C ∪ D. w UF(n, 2) := max |F|.
Standard random choice (F&F1984):
exponent ≥ (1/3 + o(1))n.

Best upper bound (Coppersmith, Shearer 1998)

log2 w UF(n, 2)
≤ .5 + o(1).
n
(F&F1984 showed an upper bound .75, and Lindström 1972 gave .6.)

Zoltan Furedi Superimposed codes

How to estimate max size of codes?
Usually hopeless (Komlós’ principle :-)
IDEA: construct, investigate constant weight codes
(r -uniform hypergraphs), then generalize (if it is possible).
Definition (maximal t-union-free families.)
UNIONFREEr (n, t) := max |F| : F ⊂ [n]


r such that
A1 ∪ A2 ∪ · · · ∪ At 6=B1 ∪ B2 ∪ · · · ∪ Bt .

Case of pairs (graphs, r = 2):

UNIONFREE2 (n, 2) := max{e(G) : G has no C4 , neither C3 }.
(Erdős, Klein 1938) UNIONFREE2 (n, 2) = Θ(n3/2 ).

Conjecture (Erdős, Simonovits)

 
1
UNIONFREE2 (n, 2) = √ + o(1) n3/2 (?)
2 2

Zoltan Furedi Superimposed codes

Cancellative families
Claim. F ⊂ 2[n] is union-free (2-union-free) if and only if
— A ∪ B 6= C ∪ D (four distinct sets), i.e., weekly union-free, and
— A ∪ B 6= A ∪ C (three distinct sets), i.e., cancellative.
Definition
A family of sets F ⊂ 2[n] is called cancellative if
A and A ∪ B determine B (in case of A, B ∈ F).
Equivalently, for all A, B, C ∈ F

A ∪ B = A ∪ C =⇒ B = C.
For technical reasons we also suppose ∅ ∈
/ F.
Let CANC(n) be the size of the largest cancellative family on n
elements, CANCr (n) denotes the largest r -uniform family.

We present our method for cancellative families.

Zoltan Furedi Superimposed codes

Cancellative families and codes
Definition (Cancellative families)
C ⊂ {0, 1}n ↔ F ⊂ 2[n] is cancellative if
A ∪ B 6= A ∪ C

(Three distinct sets). A and A ∪ B determine B. A 6⊇ B∆C.

B
=
A A C

A B = A C
B _A = C _A
B C A

Zoltan Furedi Superimposed codes

Cancellative families and r -partite hypergraphs
Claim. Any r -partite hypergraph is cancellative.
G IVEN : A and A ∪ B.

00
11
11
00 11
00
00
11 00
11
00
11
111
000
000
111
000
111
000
111
00
11
11
00 00
11
000
111
00
11 00
11 000
111
00
11 111
000
00
11
000
111 11
00 11
00 11
00
00
11 000
111
000
111 11
00 11
00
00
11
00
11 00
11
00
11 00
11 00
11
111
000 111
000 00
11 00
11
00
11
000
111
00
11 000
111
000
111
00
11 000
111
000
111 000
111

V1 V2 ... Vr V1 V2 ... Vr
Find out B.

Zoltan Furedi Superimposed codes

Cancellative families and r -partite hypergraphs

Find out B. Solution:

11
00
00
11
00
11 11
00
00
11
00
11
111
000
000
111
000
111
000
111
00
11
111
000
00
11
000
111
00
11
000
111
111
000
000
111
000
111
000
111

V1 V2 ... Vr

Zoltan Furedi Superimposed codes

What is the max size of a cancellative family?
Question (Erdős, Katona 1970) CANC(n) := max |F| = ?
Construction: Any r -partite hypergraph.

Take triples.

CANC(n) ≥ 3⌊n/3⌋ = (1.442 . . . )n ≥ 2⌊n/2⌋ .

CONJECTURE (Erdős, Katona 1970, 1974) For 3|n

CANC(n) = 3n/3 = (1.442 . . .)n .

Zoltan Furedi Superimposed codes

Uniform cancellative families
[n]


CANCr (n) := max{|F | : F ⊂ r such that A ∪ B6=A ∪ C}.
CONJECTURE (Bollobás 1974)

n n+1 n+r −1
CANCr (n) = ⌊ ⌋⌊ ⌋...⌊ ⌋,
r r r
where the construction is obtained as the complete r -partite
r -uniform hypergraph with nearly equal parts.
The case r = 2, i.e. graphs, is true.
The graph is triangle-free, so Turán theorem implies

n2
CANC2 (n) = ⌊ ⌋.
4

Theorem (Bollobás 1974, on triple systems)

n n+1 n+2
CANC3 (n) = ⌊ ⌋⌊ ⌋⌊ ⌋.
3 3 3

Zoltan Furedi Superimposed codes

Cancellative quadruple systems and more

Theorem (Sidorenko 1987, on four-tuples when 4 divides n)

 n 4
CANC4 (n) = .
4
Pikhurko (2008) for all n.
CANC5 (n), . . . are unsolved.

r
BUT! Shearer (1996): CANCr (n) > (1 + ε)r nr r ≥ 11.
(r is fixed and n → ∞).
CANC(n) > (1.46 . . . )n , for n > n0 .

Zoltan Furedi Superimposed codes

The case n ≤ 2k

Fact: A ∈ F then all other B ∈ F are distinct on V \ A. =⇒

|F| ≤ 2n−|A| .

Corollary. CANCk (n) = 2n−k for k ≤ n ≤ 2k.

Construction: Transversals of n − k pairs and 2k − n singletons.

Zoltan Furedi Superimposed codes

Proof of an upper bound for uniform families
Theorem (Frankl&ZF 1984)
For all n ≥ 2k
  √
2k
 
n k +1 n
|F| ≤ 2k
≤ .
k
k 2k k

2k
We already have CANCk (2k) = 2k which is much less than


k .
Define FS := {A ∈ F : A ⊂ S}.

   
X
k n X n−k
|FS | ≤ 2 . |FS | = |F| .
2k k
S⊂V S⊂V

Zoltan Furedi Superimposed codes

Proof of the upper bound, the general case

Theorem (Frankl&ZF1984)
For all n
CANC(n) < 1.5n .

If maxF ∈F |F | ≥ n/2 then |F| ≤ 2n/2 .

Otherwise, let F := F1 ∪ F2 ∪ F3 ∪ . . . with
Fk := F ∈ F : |F | = k.

√  n
√ X 1 n √
   
X X k +1 n 3
|F| = |Fk | ≤ k
< n k
= n .
2 k 2 k 2
k <n/2 k <n/2 k

CANC(a)CANC(b) ≤ CANC(a + b) =⇒
CANC(n)1/n never exceeds its supremum.

Zoltan Furedi Superimposed codes

The max size of cancellative families
Theorem (Tolhuizen (2000) randomized algebraic construction,
Frankl & ZF (1984) upper bound for n ≥ 2r )
2r n
   
γ0 n
< CANCr (n) ≤ 2r
.
2r r r
r
Q 2k −1
Here γ0 := k ≥1 2k
= .2887 . . .

Corollary (Tolhuizen (2000), Frankl & ZF (1984))

γ
√0 1.5n < CANC(n) < 1.5n
n
log 3
“the rate of a cancellative code is log 2 − 1 = .5849 . . . ”.
Success!!
Remark. But Komlós’ principle failed, 3/2 is not a “new” number.

Zoltan Furedi Superimposed codes

2-cancellative families
AIM: A, B and A ∪ B ∪ C determine C.
DEF. F is 2-cancellative if for every fourtuple {A, B, C, D} with
A, B, C, D ∈ F

A ∪ B ∪ C = A ∪ B ∪ D =⇒ C = D.
1
t(4) := lim sup log2 |F|.
n→∞, F ⊂2[n] n
Alon, Fachini, and Körner (2000),
Fachini, Körner, and Monti (2001) imply t(4) < .4561.
(These are concerned with locally thin families).
Körner and Sinaimeri (2006) .11 < t(4) < .42.

THM (ZF, 2011) t(4) < .322.

Question Rate of t-cancellative families?

Zoltan Furedi Superimposed codes

Union-free and Cover-free families,
a hierarchy of problems

Rest of the talk: mainly on union-free families.

If F is t-COVFREE then it is t-UNIONFREE.

If F is t-UNIONFREE then it is (t − 1)-COVFREE. Hence
CF(n, t) ≤ UF(n, t) ≤ CF(n, t − 1) ≤ UF(t − 1, n) ≤ . . .
AIM: If we know enough about the uniform cases UFr (n, t),
then find/estimate UF(n, t).
We have:

CFr (n, t) ≤ UFr (n, t) ≤ CFr (n, t − 1) ≤ UFr (t − 1, n) ≤ . . .

Zoltan Furedi Superimposed codes

Turán type problems
Definition (Turán number)
The Turán number of the class of r -uniform hypergraphs
H := {H1 , H2 , . . . } is denoted by ex(n, H).
It is the size of the largest r -graph on n vertices avoiding every
H ∈ H.

E.g., ex(n, K3 ) = ⌊n2 /4⌋.

Extremum: complete bipartite graph, K⌊n/2⌋,⌈n/2⌉ (no triangle).

The determination of CFr (n, t) and UFr (n, t) are

Turán type problems,
there are a bunch of forbidden configurations.

Turán type problems are often difficult, esp. for hypergraphs.

Local condition → a global estimate.

Zoltan Furedi Superimposed codes

r -unionfree families of r -sets
Here we almost solve one more case:
r -uniform r -Unionfree codes.
[n]

UFr (n, r ) := max |F| : F ⊂ r such that
A1 ∪ A2 ∪ · · · ∪ Ar =B1 ∪ B2 ∪ · · · ∪ Br
and Ai , Bj ∈ F imply {A1 , A2 , . . . , Ar } = {B1 , B2 , . . . , Br }.

Theorem (ZF & Ruszinkó 2012)

There exists a β = β(r ) > 0 such that for all n ≥ r ≥ 4
√ n(n − 1)
n2 e−βr log n < UFr (n, r ) ≤ .
r (r − 1)

In the case r = 3 we only have the probabilistic lower bound

Ω(n5/3 ) ≤ UF3 (n, 3) ≤ n(n − 1)/6.

Upper bound: easy (F is (r − 1)-cover-free).

Wanted: constructions! They should be uncrowded.

Zoltan Furedi Superimposed codes

Union-free families and r × r grids
Lemma (Sufficient condition for constructing r -union-free)
F ⊂ [n]


r is linear, contains no triangle nor grid then it is r -UF
ex(n, {I≥2 , T3 , Gr ×r }) ≤ UFr (n, r ).

11
00 11
00 00
11 00
11 00
11
11
00 11
00 11
00 11
00 11
00
11
00 11
00 11
00 11
00 11
00
11
00 11
00 11
00 11
00 11
00 2 3 4
1 C A

11
00 11
00 11
00 11
00 11
00 4’ D B

r × r grid, Gr ×r Triangle Tr a member of I≥2

A hypergraph is linear, if |E ∩ F | ≤ 1 holds for every pair of edges.
Let I≥2 be (more precisely Ir≥2 ) the class of hypergraphs of two
edges and intersection sizes at least two.
This class consists of r − 2 non-isomorphic hypergraphs.

Zoltan Furedi Superimposed codes

Combinatorial “lines” mod q
Classical CONSTRUCTION: Given integers q ≥ r ≥ 2, q prime.
Definition (Transversal design mod q, r -unif hpgr on rq vertices)
Vertex set V := {(j, y) : 1 ≤ j ≤ r , y ∈ Fq } = [r ] × Fq ,
lattice points on R2 , {(j, y) : y ∈ Fq } = j’th column.
For integers 0 ≤ y, m < q define the r -set L(y, m)
a combinatorial line of slope m
L(y, m) = {(1, y), (2, y + m), . . . , (r , y + (r − 1)m)},
where the second coordinates are taken modulo q.
Finally, the hypergraph L is the set of all combinatorial lines
L := Lr ,F = {L(y, m) : y ∈ Fq , m ∈ Fq }.

n = rq vertices, q 2 = n2 /r 2 hyperedges (i.e., ‘lines’, r -tuples).

But its it r -union-free? Is it linear? Triangle-fee? Grid-free?

For |m| < q/(4r ) and q/4 < y < 3q/4 or for
0 ≤ y ≤ y + (r − 1)m < q the points of L(y, m) are collinear.
Zoltan Furedi Superimposed codes
The combinatorial lines L form a linear hpgr

Lemma
If q is a prime (and q ≥ r ), then Lr ,F is a linear hypergraph.

Proof. Well-known and easy.

|L(y, m) ∩ L(y ′ , m′ )| ≥ 2 implies that there exist 1 ≤ i 6= j ≤ r

y + im ≡ y ′ + im′ (mod q)
y + jm ≡ y ′ + jm′ (mod q),

implying (j − i)(m′ − m) ≡ 0 (mod q), a contradiction.

In fact, ∀ pair {(i, y ), (j, y ′ )} (i 6= j) is covered by a unique line L.

Is our hypergraph grid-free?

Zoltan Furedi Superimposed codes

r × r grids in r -partite families
r =partite hypergraph induced by straight lines is grid-free if:
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111
111111111111111111111 111111111111111111111
000000000000000000000
000000000000000000000
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000
000
111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
00
11 000
111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000
111
000000000000000000000
111111111111111111111
00
11 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111 00
11 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111 00
11 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000
111
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000
111
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000
111 000
111
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000
111
000000000000000000000
111111111111111111111
111111111111111111111 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111 000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000
111 000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111 00
11 000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111 00
11 000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111 00
11 000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111 000
111
00
11 000
111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
000
111 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111 000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111 000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
111111111111111111111 000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000
111
000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000 000000000000000000000
111111111111111111111
000
111
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000 000000000000000000000
111111111111111111111
000
111
111111111111111111111
000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000 000000000000000000000
111111111111111111111
000
111 000
111
111111111111111111111
000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000 000000000000000000000
111111111111111111111
000
111
111111111111111111111
000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111
000
111 000
111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
000
111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111 000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000
000000000000000000000
111111111111111111111
111111111111111111111
000000000000000000000

We need: r 2 Red intersection points 6= r 2 Blue intersection points.

Zoltan Furedi Superimposed codes
The transversal design contains 3 × 3 grids
00
11 00
11 20
L(18, −5), L(6, −2), L(0, 10) 00
11 11
00 00
11
18 11
00 11
00
and 00
11 11
00 11
00
L(18, −8), L(6, 7) and L(0, 4). 00
11 11
00 11
00
00
11 11
00 11
00
00
11 13 11
00
00
11 00
11 11
00
00
11 11
00 11
00
00
11 10 11
00
00
11 00
11 11
00
00
11 11
00 8
00
11 11
00 00
11
6 11
00 11
00
Note that slopes are special 00
11 11
00 11
00
00
11 4 11
00
M = {m1 , m2 , m3 } = {−5, −2, 10} 00
11 11
00 11
00
′ ′ ′ ′
M = {m1 , m2 , m3 } = {−8, 7, 4} 00
11 11
00 2
00
11 11
00 11
00
we have ∃x, a, b (a, b 6= 0) such that 0 11
00 11
00
M ∪ M ′ ⊂ {x − a − b, x − b, x − a, x + a, x + b, x + a + b}
or
M ∪ M ′ ⊂ {x − 2a, x − a, x + a, x + 2a}.

Zoltan Furedi Superimposed codes

The set of combinat’l lines L is grid-free for r ≥ 4
Theorem
If q is a prime, q > r 4r , r ≥ 4, then Lr ,F is Gr ×r -free.

Conjecture
Thm should be true for all q > r .

Rest of this talk: proof method, consequences.

One has to prove that for slopes m, m′ ∈ Fqr , and
starting points y1 > y2 > . . . , yr , the combinatorial lines
L(yi , mi ) = {(1, yi ), (2, yi + mi ), . . . , (r , yi + (r − 1)mi )}, and
L(yi , mi′ ) = {(j, yi + (j − 1)mj′ ) : 1 ≤ j ≤ r } cannot be a grid Gr ×r .
A purely algebraic statement, 3r variables, r (r − 1) equations.
However, proof uses pseudolines and straight (Eucledian) lines.
IDEA: Combinatorial line L → polygon π(L). Etc.

Zoltan Furedi Superimposed codes

Grid-free linear hypergraphs
Corollary (Grid-free packings)
For r ≥ 4 there exists a real cr > 0 such that there are linear
r -uniform hypergraphs F on n vertices containing no grids and

n(n − 1)
|F| > − cr n8/5 .
r (r − 1)

n(n − 1) n(n − 1)
− cr n8/5 < exr (n, {I≥2 , Gr ×r }) ≤
r (r − 1) r (r − 1)
holds for every n, r ≥ 4.
Conjecture (grid-free Steiner systems)
∃ an n(r ) such that, for every

admissible n > n(r ) (this means
that (n − 1)/(r − 1) and n2 / 2r are both integers) there exists a

grid-free S(n, r , 2).

Zoltan Furedi Superimposed codes

Grid-free triple systems

In the case of r = 3 with probabilistic method we only have

1
Ω(n1.8 ) ≤ ex3 (n, {I≥2 , G3×3 }) ≤ n(n − 1),
6

Conjecture
The asymptotic ex3 (n, {I≥2 , G3×3 }) = Θ(n2 ) holds for r = 3.
There are infinitely many Steiner triple systems avoiding G3×3 .

There is a large literature of the existence of Steiner triple

systems avoiding certain (small) subconfigurations.

Zoltan Furedi Superimposed codes

Sparse Steiner systems
Conjecture (Erdős, 1973)
A STS(n) is called e-sparse if it contains no set of
e distinct triples spanning at most e + 2 points.
For every e ≥ 4 there exists an n0 (e) such that if n > n0 (e)
and n is admissible (i.e., n ≡ 1 or 3 (mod 6)),
then there exists an e-sparse STS(n).

Solution for e = 4 by Brouwer 1977, Murphy 1990, 1993, Ling

and Colbourn 2000, finally Grannell, Griggs & Whitehead 2000.
e = 5 by Colbourn, Mendelsohn, Rosa, and Širáň 1994,
Fujiwara 2006 and Wolfe 2005, 2008.
Infinitely many constructions for 6-sparse by Forbes, Grannell
and Griggs 2007, 2009.
Teirlinck writes in his 2009 review “currently no nontrivial
example of a 7-sparse Steiner triple system is known”.

Zoltan Furedi Superimposed codes

No triangles, no r × r grids
UFr (n, r ) := max |F | : F ⊂ [n]


r such that
A1 ∪ A2 ∪ · · · ∪ Ar =B1 ∪ B2 ∪ · · · ∪ Br
and Ai , Bj ∈ F imply {A1 , A2 , . . . , Ar } = {B1 , B2 , . . . , Br }.

Theorem (ZF & Ruszinkó 2012)

There exists a β = β(r ) > 0 such that for all n ≥ r ≥ 4
√ n(n − 1)
n2 e−βr log n < ex(n, {I≥2 , T3 , Gr ×r }) ≤ UFr (n, r ) ≤ .
r (r − 1)

1100 1100 1100 1100 1100

0011 0011 0011 0011 0011
0011 0011 0011 0011 0011 4
0011 0011 0011 0011 0011 1 2 3
C A

0011 0011 0011 0011 0011 4’ D B

r × r grid, Gr ×r Triangle Tr a member of I≥2

CONJECTURE: UFr (n, r ) = o(n2 ) for all r ≥ 3.

Zoltan Furedi Superimposed codes

The end

Many, many unsolved challenging problems...

Thank you for your attention!

Zoltan Furedi Superimposed codes