Proposed G$^3$VLA, a camera-aware geometric module for pretrained vision-language-action models, injecting calibrated structure into visual tokens using intrinsic-conditioned ray embeddings, projectiv…

This paper shows that finite unions of intersecting affine modules in one dimension are efficiently exactly learnable using equivalence and subset queries.

This paper develops a geometric interpretation for the specification number of Boolean threshold functions and evaluates the average specification number, settling a question in the field.

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 establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.

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…

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 provides new upper bounds and algorithms for the shortest path map equivalence decomposition of a polygonal domain, leading to solutions for two-point shortest path queries, geodesic diamet…

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

The paper introduces a subgrid marching tetrahedra scheme that accurately recovers complex, intersection-free manifold meshes from tetrahedral grids, overcoming limitations of classic marching methods…

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.

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 presents black box algorithms for constructing standard generators and performing membership testing in Suzuki groups, with no false positives.

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

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

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 provides the first unconditional proof for Weber's Conjecture for the case $k ext{ up to } 12$, which is crucial for lattice-based cryptography.