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.

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.

This paper identifies new, algebraically weak classes of instances for the Linear Equivalence Problem (LEP) by generalizing techniques from the Permutation Equivalence Problem (PEP) using power codes…

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

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

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.

The paper provides the conjectured solution for the generating function of k-convex polyominoes, based on analysis of generated enumeration data.

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

The paper investigates applying Riemannian optimization techniques to low-rank matrix parameters for deep learning, but finds that the proposed methods do not conclusively outperform the AdamW baselin…

The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…

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.

The paper analyzes congruence-based neural architectures for classifying positive-definite matrices, demonstrating that common semi-orthogonality constraints severely limit the model's expressivity.

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

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

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

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.

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