This paper proposes a preconditioning layer for stable weight conditioning in LLM training.

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.

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

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.

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

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

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.

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…

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.

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…

The paper introduces a computational framework using Hodge zero-modes to track the geometry of topological features in parameter-dependent data, providing metrics like curvature and holonomy to quanti…

This paper fixes two subtle bugs in Go's extended GCD implementation, which is critical for RSA key generation, and formally proves the correctness and termination of the corrected code.

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

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}$.

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

The paper improves Banaszczyk's inequality, providing a significantly better tail estimate for the discrete Gaussian measure on a lattice, which has applications in analyzing dual attacks against the…

This paper completely characterizes cyclic equalizability for two words over any finite alphabet by proving that the words must share the same Parikh vector.

This paper presents an algorithm to generate snake-like polyominoes within a given rectangle and provides exact formulas for the maximal area of such polyominoes for certain dimensions.