Oren Becker
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Oren Becker has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Lubotzky
The Weizmann Institute of Science, Rehovot, Israel
2 shared publications - Andreas Thom
Technische Universität Dresden, Germany
1 shared publication - Jonathan Mosheiff
Department of Computer Science Hebrew University Jerusalem Israel
1 shared publication
Latest Publications
- Open Access
Group stability and Property (T)
In recent years, there has been a considerable amount of interest in the stability of a finitely-generated group $\Gamma$ with respect to a sequence of groups $\left\{G_{n}\right\}_{n=1}^{\infty}$, equipped with bi-invariant metrics $\left\{d_{n}\right\}_{n=1}^{\infty}$. We consider the case $G_{n}=\operatorname{U}\left(n\right)$ (resp. $G_{n}=\operatorname{Sym}\left(n\right)$), equipped with the normalized Hilbert-Schmidt metric $d_{n}^{\operatorname{HS}}$ (resp. the normalized Hamming metric $d_{n}^{\operatorname{Hamming}}$). Our main result is that if $\Gamma$ is infinite, hyperlinear (resp. sofic) and has Property $\operatorname{(T)}$, then it is not stable with respect to $\left(\operatorname{U}\left(n\right),d_{n}^{\operatorname{HS}}\right)$ (resp. $\left(\operatorname{Sym}\left(n\right),d_{n}^{\operatorname{Hamming}}\right)$). This answers a question of Hadwin and Shulman regarding the stability of $\operatorname{SL}_{3}\left(\mathbb{Z}\right)$. We also deduce that the mapping class group $\operatorname{MCG}\left(g\right)$, $g\geq 3$, and $\operatorname{Aut}\left(\mathbb{F}_n\right)$, $n\geq 3$, are not stable with respect to $\left(\operatorname{Sym}\left(n\right),d_{n}^{\operatorname{Hamming}}\right)$. Our main result exhibits a difference between stability with respect to the normalized Hilbert-Schmidt metric on $\operatorname{U}\left(n\right)$ and the (unnormalized) $p$-Schatten metrics, since many groups with Property $\operatorname{(T)}$ are stable with respect to the latter metrics, as shown by De Chiffre-Glebsky-Lubotzky-Thom and Lubotzky-Oppenheim. We suggest a more flexible notion of stability that may repair this deficiency of stability with respect to $\left(\operatorname{U}\left(n\right),d_{n}^{\operatorname{HS}}\right)$ and $\left(\operatorname{Sym}\left(n\right),d_{n}^{\operatorname{Hamming}}\right)$.Open AccessGroup stability and Property (T)
In recent years, there has been a considerable amount of interest in the stability of a finitely-generated group $\Gamma$ with respect to a sequence of groups $\left\{G_{n}\right\}_{n=1}^{\infty}$, equipped with bi-invariant metrics $\left\{d_{n}\right\}_{n=1}^{\infty}$. We consider the case $G_{n}=\operatorname{U}\left(n\right)$ (resp. $G_{n}=\operatorname{Sym}\left(n\right)$), equipped with the normalized Hilbert-Schmidt metric $d_{n}^{\operatorname{HS}}$ (resp. the normalized Hamming metric $d_{n}^{\operatorname{Hamming}}$). Our main result is that if $\Gamma$ is infinite, hyperlinear (resp. sofic) and has Property $\operatorname{(T)}$, then it is not stable with respect to $\left(\operatorname{U}\left(n\right),d_{n}^{\operatorname{HS}}\right)$ (resp. $\left(\operatorname{Sym}\left(n\right),d_{n}^{\operatorname{Hamming}}\right)$). This answers a question of Hadwin and Shulman regarding the stability of $\operatorname{SL}_{3}\left(\mathbb{Z}\right)$. We also deduce that the mapping class group $\operatorname{MCG}\left(g\right)$, $g\geq 3$, and $\operatorname{Aut}\left(\mathbb{F}_n\right)$, $n\geq 3$, are not stable with respect to $\left(\operatorname{Sym}\left(n\right),d_{n}^{\operatorname{Hamming}}\right)$. Our main result exhibits a difference between stability with respect to the normalized Hilbert-Schmidt metric on $\operatorname{U}\left(n\right)$ and the (unnormalized) $p$-Schatten metrics, since many groups with Property $\operatorname{(T)}$ are stable with respect to the latter metrics, as shown by De Chiffre-Glebsky-Lubotzky-Thom and Lubotzky-Oppenheim. We suggest a more flexible notion of stability that may repair this deficiency of stability with respect to $\left(\operatorname{U}\left(n\right),d_{n}^{\operatorname{HS}}\right)$ and $\left(\operatorname{Sym}\left(n\right),d_{n}^{\operatorname{Hamming}}\right)$. - Open Access
Abelian groups are polynomially stable
In recent years, there has been a considerable amount of interest in stability of equations and their corresponding groups. Here, we initiate the systematic study of the quantitative aspect of this theory. We develop a novel method, inspired by the Ornstein-Weiss quasi-tiling technique, to prove that abelian groups are polynomially stable with respect to permutations, under the normalized Hamming metrics on the groups $\operatorname{Sym}(n)$. In particular, this means that there exists $D\geq 1$ such that for $A,B\in \operatorname{Sym}(n)$, if $AB$ is $\delta$-close to $BA$, then $A$ and $B$ are $\epsilon$-close to a commuting pair of permutations, where $\epsilon\leq O(\delta^{1/D})$. We also observe a property-testing reformulation of this result, yielding efficient testers for certain permutation properties.Open AccessAbelian groups are polynomially stable
In recent years, there has been a considerable amount of interest in stability of equations and their corresponding groups. Here, we initiate the systematic study of the quantitative aspect of this theory. We develop a novel method, inspired by the Ornstein-Weiss quasi-tiling technique, to prove that abelian groups are polynomially stable with respect to permutations, under the normalized Hamming metrics on the groups $\operatorname{Sym}(n)$. In particular, this means that there exists $D\geq 1$ such that for $A,B\in \operatorname{Sym}(n)$, if $AB$ is $\delta$-close to $BA$, then $A$ and $B$ are $\epsilon$-close to a commuting pair of permutations, where $\epsilon\leq O(\delta^{1/D})$. We also observe a property-testing reformulation of this result, yielding efficient testers for certain permutation properties. - Open Access
Stability and Invariant Random Subgroups
Consider $\operatorname{Sym}(n)$, endowed with the normalized Hamming metric $d_n$. A finitely-generated group $\Gamma$ is \emph{P-stable} if every almost homomorphism $\rho_{n_k}\colon \Gamma\rightarrow\operatorname{Sym}(n_k)$ (i.e., for every $g,h\in\Gamma$, $\lim_{k\rightarrow\infty}d_{n_k}( \rho_{n_k}(gh),\rho_{n_k}(g)\rho_{n_k}(h))=0$) is close to an actual homomorphism $\varphi_{n_k} \colon\Gamma\rightarrow\operatorname{Sym}(n_k)$. Glebsky and Rivera observed that finite groups are P-stable, while Arzhantseva and P\u{a}unescu showed the same for abelian groups and raised many questions, especially about P-stability of amenable groups. We develop P-stability in general, and in particular for amenable groups. Our main tool is the theory of invariant random subgroups (IRS), which enables us to give a characterization of P-stability among amenable groups, and to deduce stability and instability of various families of amenable groups.Open AccessStability and Invariant Random Subgroups
Consider $\operatorname{Sym}(n)$, endowed with the normalized Hamming metric $d_n$. A finitely-generated group $\Gamma$ is \emph{P-stable} if every almost homomorphism $\rho_{n_k}\colon \Gamma\rightarrow\operatorname{Sym}(n_k)$ (i.e., for every $g,h\in\Gamma$, $\lim_{k\rightarrow\infty}d_{n_k}( \rho_{n_k}(gh),\rho_{n_k}(g)\rho_{n_k}(h))=0$) is close to an actual homomorphism $\varphi_{n_k} \colon\Gamma\rightarrow\operatorname{Sym}(n_k)$. Glebsky and Rivera observed that finite groups are P-stable, while Arzhantseva and P\u{a}unescu showed the same for abelian groups and raised many questions, especially about P-stability of amenable groups. We develop P-stability in general, and in particular for amenable groups. Our main tool is the theory of invariant random subgroups (IRS), which enables us to give a characterization of P-stability among amenable groups, and to deduce stability and instability of various families of amenable groups. - 1 October 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 211, 211-216
Symmetric unique neighbor expanders and good LDPC codes
- 1 October 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 211, 211-216
Symmetric unique neighbor expanders and good LDPC codes
- Open Access
Symmetric Unique Neighbor Expanders and Good LDPC Codes
An infinite family of bounded-degree 'unique-neighbor' expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every graph in the family F is a Cayley graph. This answers a question raised by Tali Kaufman. Using the same methods, we show that the symmetric LDPC codes constructed by Kaufman and Lubotzky (2012) are in fact symmetric under a simply transitive group action on coordinates.
Open AccessSymmetric Unique Neighbor Expanders and Good LDPC Codes
An infinite family of bounded-degree 'unique-neighbor' expanders was constructed explicitly by Alon and Capalbo (2002). We present an infinite family F of bounded-degree unique-neighbor expanders with the additional property that every graph in the family F is a Cayley graph. This answers a question raised by Tali Kaufman. Using the same methods, we show that the symmetric LDPC codes constructed by Kaufman and Lubotzky (2012) are in fact symmetric under a simply transitive group action on coordinates.
- 1 April 1992
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 96 (7) , 5488-5496
Correlated chemisorption: The effect of coalescence and diffusion on chemisorption islands
The theory of island formation in chemisorption [Becker and Ben-Shaul, Phys. Rev. Lett. 61, 2859 (1988)], which treats chemisorption as a combination of direct adsorption and cluster formation, is generalized to account for the effects of cluster–cluster coalescence and of surface diffusion. The effect of cluster–cluster coalescence is approximated by series expansion in increasing ‘‘overlaps.’’ Exact calculation of the second order term, which describes the two-cluster overlaps, yields a good agreement with Monte Carlo simulation results. By incorporating the surface diffusion process it is shown that upon increasing the diffusion rate (i.e., raising the surface temperature) the system changes its behavior from correlated chemisorption (cluster formation) to random chemisorption. The extended formalism includes, as specific realizations, both the case of immobile particles and the cases of rapid diffusing particles (Langmuir’s and Kisliuk’s models).
- 1 April 1992
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 96 (7) , 5488-5496
Correlated chemisorption: The effect of coalescence and diffusion on chemisorption islands
The theory of island formation in chemisorption [Becker and Ben-Shaul, Phys. Rev. Lett. 61, 2859 (1988)], which treats chemisorption as a combination of direct adsorption and cluster formation, is generalized to account for the effects of cluster–cluster coalescence and of surface diffusion. The effect of cluster–cluster coalescence is approximated by series expansion in increasing ‘‘overlaps.’’ Exact calculation of the second order term, which describes the two-cluster overlaps, yields a good agreement with Monte Carlo simulation results. By incorporating the surface diffusion process it is shown that upon increasing the diffusion rate (i.e., raising the surface temperature) the system changes its behavior from correlated chemisorption (cluster formation) to random chemisorption. The extended formalism includes, as specific realizations, both the case of immobile particles and the cases of rapid diffusing particles (Langmuir’s and Kisliuk’s models).