4 papers
math.CO2026
Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs
Elad Aigner-Horev, Dan Hefetz, Yury Person +1
We study the emergence of rainbow spanning configurations in independently and uniformly coloured sparse -bijumbled graphs. If the palette of the colouring supports a surplu…
math.CO2026
Rainbow spanning configurations in uniformly coloured pseudorandom graphs
Elad Aigner-Horev, Dan Hefetz, Yury Person +1
We prove a quantitative palette-transference principle for rainbow spanning configurations in uniformly edge-coloured pseudorandom graphs. The input to our transference principle i…
math.PR2025
Smoothed analysis in compressed sensing
Elad Aigner-Horev, Dan Hefetz, Michael Trushkin
Arbitrary matrices , randomly perturbed in an additive manner using a random matrix , are shown to asymptotically almo…
math.CO2023
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
Elad Aigner-Horev, Dan Hefetz, Michael Trushkin
The {\em discrepancy} of a matrix is given by . An outstanding…