Elad Tzalik

activity

20242026

collaborators

8 papers

math.CO2026

The Structure of Cycles in Projective Geometry over $F_{q}$

Ran J. Tessler, Elad Tzalik

A classical geometric result says that every nonzero cycle of the mod- $2$ incidence map from $d$ -subsets to $(d - 1)$ -subsets of $[n]$ has support at least $d + 1$ , with equality attai…

math.CO2026

The number of tiles of $Z^{d}$

Itai Benjamini, Gady Kozma, Elad Tzalik

It is proved that the number of subsets of $[n]^{d}$ that tile $Z^{d}$ is $(3^{\frac{1}{3}})^{n^{d} \pm o (n^{d})}$ .

cs.DS2026

Greedy Completion for Weighted $(I^\pm, I^^{2})$ -Spanners

Elad Tzalik

We study $(I^\pm, I^^{2})$ -spanners for weighted graphs. We propose a simple greedy completion procedure which starts from a sparse initial graph, and repeatedly fixes pairs of vertices wi…

math.MG2026

Determining a Points Configuration from a Subset of the Pairwise Distances

Itai Benjamini, Elad Tzalik

We study rigidity without assuming general position. Given $n$ distinct labelled points and a set $P \subseteq (2 [ n ])$ of revealed pairs, we ask when the correspon…

cs.DS2026

New Greedy Spanners and Applications

Elizaveta Popova, Elad Tzalik

We present a simple greedy procedure to compute an $(I^\pm, I^^{2})$ -spanner for a graph $G$ . We then show that this procedure is useful for building fault-tolerant spanners, as well as sp…

math.CO2025

Hypercube minor-universality

Itai Benjamini, Or Kalifa, Elad Tzalik

A graph $G$ is $m$ -minor-universal if every graph with at most $m$ edges (and no isolated vertices) is a minor of $G$ . We prove that the $d$ -dimensional hypercube, $Q_{d}$ , is $Î©\le…