The polynomial-time low-degree conjecture, which predicts that low-degree indistinguishability, a uniform null distribution, permutation invariance, and independent resampling imply polynomial-time ha…

The paper resolves three conjectures related to arrow pattern avoidance in permutations using two different proof methods.

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

This paper identifies a tractability island inside the contextual-fraction problem by collapsing it to a fixed-point calculation for a specific class of permutation-transport models.

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 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 presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

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 uses majorization theory to analyze lattice reduction, showing that local swaps smooth the Gram-Schmidt profile and deriving variational and telescoping identities for the worst-case profile…

This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

This paper proposes a high entropy differential privacy implementation that maintains aggregation invariants with probability one or exponentially close to one.

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 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…

This paper shows #P-completeness for several graph counting problems using a new technique.

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…