arXiv Machine Learning July 14, 2026 By Abel Lacabanne, Daniel Tubbenhauer, Pedro Vaz

Big data approach to Kazhdan-Lusztig polynomials

Read the original on arXiv Machine Learning →

arXiv:2412. 01283v3 Announce Type: replace-cross Abstract: We investigate the structure of Kazhdan-Lusztig polynomials of the symmetric group by leveraging computational approaches from big data, including exploratory and topological data analysis, applied to the polynomials for symmetric groups of up to 11 strands.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

23h ago

On detection probabilities of link invariants

arXiv:2509. 05574v3 Announce Type: replace-cross Abstract: We prove that, for many standard link invariants, both the proportion of distinct invariant values and the detection probability among prime alternating links with at most n crossings decay exponentially in n, with an explicit universal rate.

By Tuomas Kelom\"aki, Abel Lacabanne, Daniel Tubbenhauer, Pedro Vaz, Victor L. Zhang

arXiv Machine Learning

Jul 15

Learning the Graphical Nature of Symmetries

arXiv:2607. 12026v1 Announce Type: cross Abstract: Finite groups are rigid algebraic objects, whose Cayley graphs expose a rich network geometry through which group-theoretic structure can be measured, compared, and learned.

By Rashid Barket, Enrico Grimaldi, Yacoub Hendi, Edward Hirst, Adam Onus, Harmeet Singh

benchmarks

arXiv Machine Learning

Jun 26

Generating Special Triangulations with Transformers

arXiv:2606. 26660v1 Announce Type: cross Abstract: Triangulations, i.

By Charles Arnal, Jacky H. T. Yip, Fran\c{c}ois Charton, Gary Shiu

llms

arXiv Machine Learning

Jun 26

A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks

arXiv:2606. 26212v1 Announce Type: new Abstract: A Graph Neural Network (GNN) framework for predicting the solvability of finite groups from their Cayley graph representations was introduced in [1].

By Tal Weissblat

arXiv Machine Learning

Jun 9

Graph Neural Networks for Predicting Solvability of Finite Groups

arXiv:2606. 07619v1 Announce Type: new Abstract: We present a Graph Neural Network (GNN) framework for the classification of finite groups according to their solvability.

By Tal Weissblat

arXiv Machine Learning

Jul 7

Topological data analysis using persistent discrete homology

arXiv:2506. 15020v2 Announce Type: replace-cross Abstract: We propose persistent discrete homology as a tool for topological data analysis and discuss its advantages over the existing methods.

By Chris Kapulkin, Nathan Kershaw

Related stories

On detection probabilities of link invariants

Learning the Graphical Nature of Symmetries

Generating Special Triangulations with Transformers

A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks

Graph Neural Networks for Predicting Solvability of Finite Groups

Topological data analysis using persistent discrete homology