← Back to all news
arXiv Machine Learning 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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Aug 19

On detection probabilities of link invariants

The paper proves that for many standard link invariants, 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. It shows that almost every such link lies in an invariant fiber whose size is itself exponential in n, a phenomenon that applies broadly, including to the Jones and HOMFLYPT polynomials and integral Khovanov homology. The companion website provides detailed data, including complete distributions of fiber sizes, separate alternating and non-alternating data, and topological data analysis.

By Tuomas Kelom\"aki, Abel Lacabanne, Daniel Tubbenhauer, Pedro Vaz, Victor L. Zhang
More like this →
arXiv Machine Learning
Sep 7

The Geometry of Polynomial Group Convolutional Neural Networks

The paper introduces a new mathematical framework for polynomial group convolutional neural networks (PGCNNs) using graded group algebras. It presents two natural parametrizations of the architecture—based on Hadamard and Kronecker products—that are related by a linear map. The authors compute the dimension of the resulting neuromanifold, show it depends only on the number of layers and group size, and describe the general fiber of the Kronecker parametrization, conjecturing a similar description for the Hadamard case, supported by explicit computations for small groups and shallow networks.

By Yacoub Hendi, Daniel Persson, Magdalena Larfors
More like this →
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
More like this →