ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Hecke algebra”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DMTheoreticalRecentJun 11, 2026

On the Impossibility of Parabolic Factorization of certain Kazhdan-Lusztig Basis Elements

Tommy Parisi, Mark Skandera, Ben Spahiu, Jiayuan Wang

This paper describes a set of permutations for which a specific factorization of basis elements in the type-A Hecke algebra leads to combinatorial interpretations of certain polynomials.

View →
cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
math.ATcs.DMmath.COTheoreticalRecentJun 11, 2026

Computing stable homology representations of graph configuration spaces

Eric Ramos, Claudia He Yun

Ramos and White's theorem on multiplicity stability of rational homology for configuration spaces of certain graphs is extended and computed for various families of graphs using computer algebra.

View →
cs.CRquant-phRecentApr 17, 2026

Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$

Ming-Xing Luo

This paper provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.

View →
quant-phcs.CRmath.CORecentMay 17, 2026

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

Ming-Xing Luo

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

View →
cs.DScs.DMTheoreticalRecentJun 11, 2026

(Un)ranking Permutation Classes

Nathanaël Hassler, Vincent Vajnovszki

This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.

View →
cs.CRcs.ITquant-phRecentApr 24, 2026

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection

Ming-Xing Luo

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

View →
cs.DMcs.DSEmpiricalRecentJun 11, 2026

Exhaustive Generation of Genus-One Knot and Link Diagrams via Maps on the Torus

Alexander Omelchenko

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

View →
cs.CRRecentMay 20, 2026

Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings

Xiaoxiong Lu, Yuling Dai, Chengqing Li

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

View →
math.AGcs.AIcs.NERecentMay 27, 2026

Real-rootedness of the Poincaré polynomials of $\overline{\mathcal M}_{0,n}$: an AI-assisted proof

Gergely Bérczi, Young-Hoon Kiem

The paper proves the real-rootedness and ultra-log-concavity of the Poincaré polynomials for the moduli space $\overline{\mathcal M}_{0,n}$ and the Fulton--MacPherson space $\mathbb{P}^1[n]$ using a n…

View →
cs.DMTheoreticalRecentJun 11, 2026

A Class of Multiparameter Signless Stirling Numbers of the First Kind and their $q$-Analogues

Violetta E. Piperigou, Malvina G. Vamvakari

This paper provides a probabilistic derivation of multiparameter signless Stirling numbers and their q-analogues.

View →
math.NTcs.CRRecentMar 26, 2026

Second order Recurrences, quadratic number fields and cyclic codes

Minjia Shi, Xuan Wang, Bouazzaoui Zakariae, Jon-Lark Kim +1 more

The paper investigates generalized Wall-Sun-Sun primes, $WSS(d)$, and uses them to study the weight distributions of specific cyclic codes defined over $ ext{F}_p$ and $ ext{Z}_{p^2}$.

View →
cs.DMmath.COmath.DSTheoreticalRecentJun 11, 2026

The Curious Case of Reversible Elementary Second Order Cellular Automaton 115

Enrico Formenti, Supreeti Kamylia

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

View →
cs.CRRecentApr 20, 2026

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

View →
cs.ITcs.CRRecentMay 22, 2026

On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3

Namhun Koo, Soonhak Kwon, Minwoo Ko, Byunguk Kim

This paper systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

View →
cs.LGcs.AIcs.CVRecentMay 31, 2026

BRo-JEPA: Learning Modular Arithmetic in Latent Space

Divyansh Jha, Yuanfang Xie, Varan Mehra, Brennen Yu

The paper introduces BRo-JEPA, a latent world model that successfully learns modular arithmetic (like addition modulo 10) by explicitly imposing the circular structure of the problem into the latent s…

View →
cs.CGmath.ATmath.CORecentMay 29, 2026

Towards fast computation of higher discrete homology

Jacob Ender, Chris Kapulkin

The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.

View →
cs.FLcs.CLcs.LGRecentJun 1, 2026

An Algebraic View of the Expressivity of Recurrent Language Models

Franz Nowak, Ryan Cotterell, Reda Boumasmoud

The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…

View →
cs.DMTheoreticalRecentJun 11, 2026

Frequencies of Patterns in Smooth Sequences Over the Alphabet $\{1,3\}$

Damien Jamet, Irène Marcovici, Léo Poirier, Thierry de la Rue

This paper uses ergodic theory to study statistical properties of smooth sequences over the odd alphabet {1,3}, defining a notion of type for those sequences and proving unique ergodicity for subshift…

View →