This paper constructs a cubic graph with a polyhedral map whose automorphism groups are isomorphic to a given finite group.

This paper improves the known bounds on the ratio between domination number and packing number in unit disk graphs and bridgeless claw-free cubic graphs.

The paper proposes a novel symmetric stream cipher utilizing the chaotic dynamics of random cubic mappings in the complex plane to generate highly random and secure key streams.

This paper classifies the Gold almost perfect nonlinear function in even dimensions, identifying admissible coefficients and proving dimension rigidity.

The authors construct r-dimensional cubical sheaf complexes with positive constant rate, linear distance, and constant soundness for CSS codes.

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

An approach is described to support rigid α canonical variables in an e-graph.

The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.

The authors provide a deterministic algorithm for solving integer programs in standard form with improved running time.

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

The authors improve the lower bounds for the kissing number in dimensions 25-31.

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.

This paper proposes HULK, an efficient homomorphic encryption algorithm that enables fast bulk bitwise operations on encrypted data.