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

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…

The paper introduces the Insertion Process (IP), a novel stochastic generative model that learns variable-length, non-monotonic sequence generation by explicitly modeling the insertion order of tokens…

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

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 proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

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

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…

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 introduces a novel, efficient mechanism based on permute-and-flip for applying differential privacy to symbolic state trajectories, significantly reducing the computational overhead compared…

The paper refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper introduces a new variant of the Traveling Salesman Problem where the goal is to find two paths connecting a set of sites while minimizing the Fréchet distance between the two paths.

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

This paper proposes methods to optimally permute the rows and columns of a sparse matrix to minimize the number of cyclic diagonals required for homomorphic sparse-matrix vector multiplication, signif…

The paper introduces 'bridges,' a type of morphism between encryption schemes, and provides a general recipe for constructing them, showing that their security relies on the security of the initial sc…

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.