This paper proves an inverse-polynomial spectral-gap bound for the lazy swap chain on binary matrices with prescribed row and column sums, which is a standard sampler for fixed-margin null models.

The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…

This paper studies ranking and aggregation under Kendall tau distance with matroid or flag matroid constraints on prefixes.

The paper establishes conditions for QUBO formulations of combinatorial optimization problems that guarantee valid binary and feasible local minimizers using gradient-based methods.

This paper proposes an approximation algorithm for the submodular joint replenishment problem with decomposable submodular ordering cost functions, achieving an O(k)-approximation.

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

This paper shows that any boolean matrix with bounded factorization norm can be expressed as a signed sum of blow-up identity matrices, and this result has applications to matrix sequences and complex…

This paper presents an index for the maximum segment sum problem with query offset and range, using O(log^2 n) query time and O(n log n) space.

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

The paper explains a method for finding the number of solutions to a system of multivariate polynomial inequalities over a finite field and applies it to find formulas for the number of contiguous sup…

This paper proves conditions for efficiently approximating expectations of certain functions with respect to standard Gaussian or symmetric exponential probability measures.

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

This paper proves that a majority of filled-in Sudoku grids require a logarithmic fraction of cells to be filled by clues, and constructs grids requiring 18 and 80 clues for 9x9 and 16x16 Sudoku, resp…