activity
20242026
collaborators

6 papers

math.CO2026

Rigidity of expanders and pseudorandom graphs

Michael Krivelevich, Alan Lew, Peleg Michaeli

A graph is called -rigid if, for a generic embedding of its vertices in , the only continuous motions of the vertices preserving the distances between al…

math.CO2026

Combinatorial sufficient conditions for graph rigidity and applications to random graphs

Michael Krivelevich, Alan Lew, Peleg Michaeli

A graph is called -rigid if, for a generic embedding of its vertices in , every edge-length preserving continuous motion of the vertices preserves the di…

math.CO2025

Stiffness matrices of graph blow-ups and the -dimensional algebraic connectivity of complete bipartite graphs

Yunseong Jung, Alan Lew

The -dimensional algebraic connectivity of a graph is a quantitative measure of its -dimensional rigidity, defined in terms of the eigenvalues of stiffness…

math.CO2025

On the -volume rigidity of a simplicial complex in

Alan Lew, Eran Nevo, Yuval Peled +1

We define a generic rigidity matroid for -volumes of a simplicial complex in , and prove that for it has the same rank as the classical generic…

math.CO2024

Minimum degree conditions for graph rigidity

Michael Krivelevich, Alan Lew, Peleg Michaeli

We study minimum degree conditions that guarantee that an -vertex graph is rigid in . For small values of , we obtain a tight bound: for , ever…

math.CO2024

Laplacian eigenvalues of independence complexes via additive compound matrices

Alan Lew

The independence complex of a graph is the simplicial complex on vertex set whose simplices are the independent sets in . We present new lower bounds on the…