Doron Puder
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Doron Puder has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Michael Magee
Department of Mathematical Sciences, Durham University, Durham, UK
11 shared publications - Ori Parzanchevski
Einstein Institute of Mathematics Hebrew University Jerusalem
5 shared publications - Danielle Ernst-West
School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel
3 shared publications - Frédéric Naud
Institut Mathématique de Jussieu, Université Pierre et Marie Curie, Paris Cedex 05, France
2 shared publications - Joel Friedman
University of British Columbia
2 shared publications - Liam Hanany2 shared publications
Latest Publications
- Open Access
- 19 January 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (1)
An extension of the cogrowth formula to arbitrary subsets of the tree
What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a given subset, in terms of the exponential decay rate of the analogous probability of the non‐backtracking random walk. This generalizes the well‐known cogrowth formula of Grigorchuk, Cohen and Northshield. We also extend the formula to arbitrary subsets of the biregular tree.
- 19 January 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (1)
Open AccessAn extension of the cogrowth formula to arbitrary subsets of the tree
What is the probability that a random walk in the free group ends in a proper power? Or in a primitive element? We present a formula that computes the exponential decay rate of the probability that a random walk on a regular tree ends in a given subset, in terms of the exponential decay rate of the analogous probability of the non‐backtracking random walk. This generalizes the well‐known cogrowth formula of Grigorchuk, Cohen and Northshield. We also extend the formula to arbitrary subsets of the biregular tree.
- Open Access
- 17 June 2025
- Published by Elsevier in Journal of Algebra
- Vol. 682, 380-412
The ring of stable characters over- 17 June 2025
- Published by Elsevier in Journal of Algebra
- Vol. 682, 380-412
Open AccessThe ring of stable characters over - 21 May 2025
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 179 (2) , 259-298
On the Aldous-Caputo Spectral Gap Conjecture for Hypergraphs
In their celebrated paper [CLR10], Caputo, Liggett and Richthammer proved Aldous’ conjecture and showed that for an arbitrary finite graph, the spectral gap of the interchange process is equal to the spectral gap of the underlying random walk. A crucial ingredient in the proof was the Octopus Inequality — a certain inequality of operators in the group ring $\mathbb{R}\left[{\mathrm{Sym}}_{n}\right]$ of the symmetric group. Here we generalise the Octopus Inequality and apply it to generalising the Caputo–Liggett–Richthammer Theorem to certain hypergraphs, proving some cases of a conjecture of Caputo.- 21 May 2025
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 179 (2) , 259-298
On the Aldous-Caputo Spectral Gap Conjecture for Hypergraphs
In their celebrated paper [CLR10], Caputo, Liggett and Richthammer proved Aldous’ conjecture and showed that for an arbitrary finite graph, the spectral gap of the interchange process is equal to the spectral gap of the underlying random walk. A crucial ingredient in the proof was the Octopus Inequality — a certain inequality of operators in the group ring $\mathbb{R}\left[{\mathrm{Sym}}_{n}\right]$ of the symmetric group. Here we generalise the Octopus Inequality and apply it to generalising the Caputo–Liggett–Richthammer Theorem to certain hypergraphs, proving some cases of a conjecture of Caputo.- Open Access
- 18 October 2024
- Published by Mathematical Sciences Publishers in Algebra & Number Theory
- Vol. 18 (11) , 2047-2090
Word measures on GLn(q) and free group algebras
- 18 October 2024
- Published by Mathematical Sciences Publishers in Algebra & Number Theory
- Vol. 18 (11) , 2047-2090
Open AccessWord measures on GLn(q) and free group algebras
- Open AccessThe ring of stable characters over $\text{GL}_\bullet(q)$For a fixed prime power $q$, let $\text{GL}_\bullet(q)$ denote the family of groups $\text{GL}_N(q)$ for $N \in \mathbb{Z}_{\geq 0}$. In this paper we study the $\mathbb{C}$-algebra of "stable" class functions of $\text{GL}_\bullet(q)$, and show it admits four different linear bases, each arising naturally in different settings. One such basis is that of stable irreducible characters, namely, the class functions spanned by the characters corresponding to finitely generated simple $\mathrm{VI}$-modules in the sense of [arXiv:1408.3694,arXiv:1602.00654]. A second one comes from characters of parabolic representations. The final two, one originally defined in [arXiv:1803.04155] and the other in [arXiv:2110.11099], are more combinatorial in nature. As corollaries, we clarify many properties of these four bases and prove a conjecture from [arXiv:2106.11587].Open AccessThe ring of stable characters over $\text{GL}_\bullet(q)$For a fixed prime power $q$, let $\text{GL}_\bullet(q)$ denote the family of groups $\text{GL}_N(q)$ for $N \in \mathbb{Z}_{\geq 0}$. In this paper we study the $\mathbb{C}$-algebra of "stable" class functions of $\text{GL}_\bullet(q)$, and show it admits four different linear bases, each arising naturally in different settings. One such basis is that of stable irreducible characters, namely, the class functions spanned by the characters corresponding to finitely generated simple $\mathrm{VI}$-modules in the sense of [arXiv:1408.3694,arXiv:1602.00654]. A second one comes from characters of parabolic representations. The final two, one originally defined in [arXiv:1803.04155] and the other in [arXiv:2110.11099], are more combinatorial in nature. As corollaries, we clarify many properties of these four bases and prove a conjecture from [arXiv:2106.11587].
- 11 September 2023
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2024 (5) , 4242-4300
Local Statistics of Random Permutations from Free Products
Let $\alpha $ and $\beta $ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha \beta \alpha \beta ^{-1}$. How many fixed points does this random permutation have on average? The current paper studies questions of this kind and relates them to surprising topological and algebraic invariants of elements in free products of groups. Formally, let $\Gamma =G_{1}*\ldots *G_{k}$ be a free product of groups where each of $G_{1},\ldots ,G_{k}$ is either finite, finitely generated free, or an orientable hyperbolic surface group. For a fixed element $\gamma \in \Gamma $, a $\gamma $-random permutation in the symmetric group $S_{N}$ is the image of $\gamma $ through a uniformly random homomorphism $\Gamma \to S_{N}$. In this paper we study local statistics of $\gamma $-random permutations and their asymptotics as $N$ grows. We first consider $\mathbb{E}\big [\textrm{fix}_{\gamma }\big (N\big )\big ]$, the expected number of fixed points in a $\gamma $-random permutation in $S_{N}$. We show that unless $\gamma $ has finite order, the limit of $\mathbb{E}\big [\textrm{fix}_{\gamma }\big (N\big )\big ]$ as $N\to \infty $ is an integer, and is equal to the number of subgroups $H\le \Gamma $ containing $\gamma $ such that $H\cong \mathbb{Z}$ or $H\cong C_{2}*C_{2}$. Equivalently, this is the number of subgroups $H\le \Gamma $ containing $\gamma $ and having (rational) Euler characteristic zero. We also prove there is an asymptotic expansion for $\mathbb{E}\big [\textrm{fix}_{\gamma }\big (N\big )\big ]$ and determine the limit distribution of the number of fixed points as $N\to \infty $. These results are then generalized to all statistics of cycles of fixed lengths.- 11 September 2023
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2024 (5) , 4242-4300
Local Statistics of Random Permutations from Free Products
Let $\alpha $ and $\beta $ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha \beta \alpha \beta ^{-1}$. How many fixed points does this random permutation have on average? The current paper studies questions of this kind and relates them to surprising topological and algebraic invariants of elements in free products of groups. Formally, let $\Gamma =G_{1}*\ldots *G_{k}$ be a free product of groups where each of $G_{1},\ldots ,G_{k}$ is either finite, finitely generated free, or an orientable hyperbolic surface group. For a fixed element $\gamma \in \Gamma $, a $\gamma $-random permutation in the symmetric group $S_{N}$ is the image of $\gamma $ through a uniformly random homomorphism $\Gamma \to S_{N}$. In this paper we study local statistics of $\gamma $-random permutations and their asymptotics as $N$ grows. We first consider $\mathbb{E}\big [\textrm{fix}_{\gamma }\big (N\big )\big ]$, the expected number of fixed points in a $\gamma $-random permutation in $S_{N}$. We show that unless $\gamma $ has finite order, the limit of $\mathbb{E}\big [\textrm{fix}_{\gamma }\big (N\big )\big ]$ as $N\to \infty $ is an integer, and is equal to the number of subgroups $H\le \Gamma $ containing $\gamma $ such that $H\cong \mathbb{Z}$ or $H\cong C_{2}*C_{2}$. Equivalently, this is the number of subgroups $H\le \Gamma $ containing $\gamma $ and having (rational) Euler characteristic zero. We also prove there is an asymptotic expansion for $\mathbb{E}\big [\textrm{fix}_{\gamma }\big (N\big )\big ]$ and determine the limit distribution of the number of fixed points as $N\to \infty $. These results are then generalized to all statistics of cycles of fixed lengths.- 1 September 2023
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 256 (1) , 269-282
A note on the trace method for random regular graphs
- 1 September 2023
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 256 (1) , 269-282
A note on the trace method for random regular graphs
- Top Cited PapersOpen Access
- 15 May 2023
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Pi
- Vol. 11
The Asymptotic Statistics of Random Covering Surfaces
Let $\Gamma _{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq 2$ . We develop a new method for integrating over the representation space $\mathbb {X}_{g,n}=\mathrm {Hom}(\Gamma _{g},S_{n})$ , where $S_{n}$ is the symmetric group of permutations of $\{1,\ldots ,n\}$ . Equivalently, this is the space of all vertex-labeled,n-sheeted covering spaces of the closed surface of genusg.Given $\phi \in \mathbb {X}_{g,n}$ and $\gamma \in \Gamma _{g}$ , we let $\mathsf {fix}_{\gamma }(\phi )$ be the number of fixed points of the permutation $\phi (\gamma )$ . The function $\mathsf {fix}_{\gamma }$ is a special case of a natural family of functions on $\mathbb {X}_{g,n}$ called Wilson loops. Our new methodology leads to an asymptotic formula, as $n\to \infty $ , for the expectation of $\mathsf {fix}_{\gamma }$ with respect to the uniform probability measure on $\mathbb {X}_{g,n}$ , which is denoted by $\mathbb {E}_{g,n}[\mathsf {fix}_{\gamma }]$ . We prove that if $\gamma \in \Gamma _{g}$ is not the identity andqis maximal such that $\gamma $ is aqthpower in $\Gamma _{g}$ , then $$\begin{align*}\mathbb{E}_{g,n}\left[\mathsf{fix}_{\gamma}\right]=d(q)+O(n^{-1}) \end{align*}$$ as $n\to \infty $ , where $d\left (q\right )$ is the number of divisors ofq. Even the weaker corollary that $\mathbb {E}_{g,n}[\mathsf {fix}_{\gamma }]=o(n)$ as $n\to \infty $ is a new result of this paper. We also prove that $\mathbb {E}_{g,n}[\mathsf {fix}_{\gamma }]$ can be approximated to any order $O(n^{-M})$ by a polynomial in $n^{-1}$ .- 15 May 2023
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Pi
- Vol. 11
Top Cited PapersOpen AccessThe Asymptotic Statistics of Random Covering Surfaces
Let $\Gamma _{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq 2$ . We develop a new method for integrating over the representation space $\mathbb {X}_{g,n}=\mathrm {Hom}(\Gamma _{g},S_{n})$ , where $S_{n}$ is the symmetric group of permutations of $\{1,\ldots ,n\}$ . Equivalently, this is the space of all vertex-labeled,n-sheeted covering spaces of the closed surface of genusg.Given $\phi \in \mathbb {X}_{g,n}$ and $\gamma \in \Gamma _{g}$ , we let $\mathsf {fix}_{\gamma }(\phi )$ be the number of fixed points of the permutation $\phi (\gamma )$ . The function $\mathsf {fix}_{\gamma }$ is a special case of a natural family of functions on $\mathbb {X}_{g,n}$ called Wilson loops. Our new methodology leads to an asymptotic formula, as $n\to \infty $ , for the expectation of $\mathsf {fix}_{\gamma }$ with respect to the uniform probability measure on $\mathbb {X}_{g,n}$ , which is denoted by $\mathbb {E}_{g,n}[\mathsf {fix}_{\gamma }]$ . We prove that if $\gamma \in \Gamma _{g}$ is not the identity andqis maximal such that $\gamma $ is aqthpower in $\Gamma _{g}$ , then $$\begin{align*}\mathbb{E}_{g,n}\left[\mathsf{fix}_{\gamma}\right]=d(q)+O(n^{-1}) \end{align*}$$ as $n\to \infty $ , where $d\left (q\right )$ is the number of divisors ofq. Even the weaker corollary that $\mathbb {E}_{g,n}[\mathsf {fix}_{\gamma }]=o(n)$ as $n\to \infty $ is a new result of this paper. We also prove that $\mathbb {E}_{g,n}[\mathsf {fix}_{\gamma }]$ can be approximated to any order $O(n^{-M})$ by a polynomial in $n^{-1}$ . - 31 December 2022
- Published by Springer Nature in Mathematische Annalen
- Vol. 388 (2) , 1437-1494
Matrix group integrals, surfaces, and mapping class groups II: $\textrm{O}\left( n\right) $ and $\textrm{Sp}\left( n\right) $- 31 December 2022
- Published by Springer Nature in Mathematische Annalen
- Vol. 388 (2) , 1437-1494
Matrix group integrals, surfaces, and mapping class groups II: $\textrm{O}\left( n\right) $ and $\textrm{Sp}\left( n\right) $- Open Access
Local Statistics of Random Permutations from Free Products
Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average? The current paper studies questions of this kind and relates them to surprising topological and algebraic invariants of elements in free products of groups. Formally, let $\Gamma=G_{1}*\ldots*G_{k}$ be a free product of groups where each of $G_1,\ldots,G_k$ is either finite, finitely generated free, or an orientable hyperbolic surface group. For a fixed element $\gamma\in\Gamma$, a $\gamma$-random permutation in the symmetric group $S_{N}$ is the image of $\gamma$ through a uniformly random homomorphism $\Gamma\to S_{N}$. In this paper we study local statistics of $\gamma$-random permutations and their asymptotics as $N$ grows. We first consider $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$, the expected number of fixed points in a $\gamma$-random permutation in $S_{N}$. We show that unless $\gamma$ has finite order, the limit of $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$ as $N\to\infty$ is an integer, and is equal to the number of subgroups $H\le\Gamma$ containing $\gamma$ such that $H\cong\mathbb{Z}$ or $H\cong C_{2}*C_{2}$. Equivalently, this is the number of subgroups $H\le\Gamma$ containing $\gamma$ and having (rational) Euler characteristic zero. We also prove there is an asymptotic expansion for $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$ and determine the limit distribution of the number of fixed points as $N\to\infty$. These results are then generalized to all statistics of cycles of fixed lengths.Open AccessLocal Statistics of Random Permutations from Free Products
Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average? The current paper studies questions of this kind and relates them to surprising topological and algebraic invariants of elements in free products of groups. Formally, let $\Gamma=G_{1}*\ldots*G_{k}$ be a free product of groups where each of $G_1,\ldots,G_k$ is either finite, finitely generated free, or an orientable hyperbolic surface group. For a fixed element $\gamma\in\Gamma$, a $\gamma$-random permutation in the symmetric group $S_{N}$ is the image of $\gamma$ through a uniformly random homomorphism $\Gamma\to S_{N}$. In this paper we study local statistics of $\gamma$-random permutations and their asymptotics as $N$ grows. We first consider $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$, the expected number of fixed points in a $\gamma$-random permutation in $S_{N}$. We show that unless $\gamma$ has finite order, the limit of $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$ as $N\to\infty$ is an integer, and is equal to the number of subgroups $H\le\Gamma$ containing $\gamma$ such that $H\cong\mathbb{Z}$ or $H\cong C_{2}*C_{2}$. Equivalently, this is the number of subgroups $H\le\Gamma$ containing $\gamma$ and having (rational) Euler characteristic zero. We also prove there is an asymptotic expansion for $\mathbb{E}\left[\mathrm{fix}_{\gamma}\left(N\right)\right]$ and determine the limit distribution of the number of fixed points as $N\to\infty$. These results are then generalized to all statistics of cycles of fixed lengths.