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 develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

This paper constructs an epsilon-cover of the joint value set of m constant-degree polynomials over a convex set H in the linfty-norm, with size n^(O(log(mn)/ε^2)), given that the polynomials have a c…

This paper studies the existence of polynomial measures of dependence between two random variables that satisfy the data processing inequality and vanish on independence. It proves that no such polyno…

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…

The paper proposes a novel method to identify parsimonious explicit piece-wise polynomial relationships, demonstrating its effectiveness in modeling the inverse kinematics of industrial manipulator ro…

This paper studies the expressivity of shallow polynomial neural networks with monomial activation functions over finite fields, quantifying it by the cardinality of the neuromanifold and deriving low…

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

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

This paper presents a polynomial-time Monte Carlo algorithm to determine the symmetry Lie algebra of a parametrized variety directly from the parametrization.

This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…

This paper provides a uniform construction for counting the number of flat-foldable assignments in an origami Miura-ori crease pattern with a specific number of single face flips.

The paper presents black box algorithms for constructing standard generators and performing membership testing in Suzuki groups, with no false positives.

This paper determines that verifying global parameter identifiability for linear ODE models is an NP-hard problem, establishing a computational complexity boundary for the field.

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…