Dor Elboim

activity

20172026

most citedMixing times and cutoff for the TASEP in the high and low density phase

3 citations · 8 across the 22 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

On the maximal dimension of an irreducible representation of the symmetric group

Amol Aggarwal, Dor Elboim

We prove that the maximal dimension $d_{N}$ of an irreducible representation of the symmetric group $S_{N}$ satisfies $$d_N=\sqrt{N!} \, e^{-(\mathfrak{d}+o(1))\sqrt{N} }, \quad N\to \…

math.CO2023

Climbing up a random subgraph of the hypercube

Michael Anastos, Sahar Diskin, Dor Elboim +1

Let $Q^{d}$ be the $d$ -dimensional binary hypercube. We say that $P = {v_{1}, \dots, v_{k}}$ is an increasing path of length $k - 1$ in $Q^{d}$ , if for every $i \in [k - 1]$ the edge $v_iv_{i+1…

math.CO2022

Heavy and Light Paths and Hamilton Cycles

Sahar Diskin, Dor Elboim

Given a graph $G$ , we denote by $f (G, u_{0}, k)$ the number of paths of length $k$ in $G$ starting from $u_{0}$ . In graphs of maximum degree 3, with edge weights $i . i . d .$ with $e x p (1)$ ,…

math.CO2021

Random necklaces require fewer cuts

Noga Alon, Dor Elboim, János Pach +1

It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$ , can be partitioned by at most $(k - 1) t$ cuts into intervals…