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.

The paper introduces Optimal Mixture Transport (OMT), a scalable framework that reformulates optimal transport by using mixtures of subpopulations, resulting in a unique, biconvex optimization problem…

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

Chen et al. prove a Poincaré inequality for Glauber dynamics of hard-core model on random regular graphs using Bochner--Bakry--Émery approach.

This paper studies approximating the partition function of the anti-ferromagnetic multi-state Potts model at low temperature on random regular bipartite graphs, and shows that single-site Glauber dyna…

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

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 proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.

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

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

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

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 studies a random compositional model for the growth of affine regions in deep piecewise-linear networks and proves the existence of a submultiplicative pressure for the number of affine pie…

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

This paper presents a deterministic algorithm achieving an expected competitive ratio of O(1) for Euclidean online TSP in high dimensions and O(log n) for d = 1, improving upon previous O(sqrt(n)) and…