Exact Agreement Expansion up to the Top via Non-polarity
Tali Kaufman, Huy Tuan Pham
Abstract
Agreement expansion asks whether local assignments to faces of a poset that usually agree on a sampled common face must agree with a single global function on most faces. Agreement expansion is exact (approximate) if local assignments need to exactly (approximately) agree with the global function. We suggest a new proof technique for agreement expansion that enables agreement expansion in settings which were previously beyond reach, such as: exact agreement expansion for Grassmannian posets (before only simplicial complexes support exact agreement expansion); agreement expansion based on assignments to top faces of the a complex (before agreement expansion is generally proven only for assignments to low dimensional faces); agreement expansion from one-sided spectral expansion (before, two sided spectral assumption was needed in general settings). Specifically, for down-closed simplicial and Grassmannian complexes, we prove an exact agreement theorem between any two layers assuming one-sided spectral expansion in links of singletons. As an application, we show that full bases of every rank-k matroid admit exact agreement with soundness O(k2/[h(k-h)]) when tested through h-element independent sets. We also obtain exact agreement on Grassmannian posets under one-sided spectral expansion, with stronger soundness under a local distance guarantee. Our key proof ideas center around non-polarity of the distributions of local assignments, probed via a random exposure of elements.
Create a lesson
Related papers
Semidirect sums of tensors and the matrix multiplication exponent
Baitian Li
On the Role of Geometry in Solving Variational Inequalities
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
The Complexity of ReLU Network Synthesis from a Parameter Multiset
Dimitrios Myrisiotis
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis
A Circuit Complexity Trichotomy For Regular Languages
Stefan Göller, Amaldev Manuel
Determinant boundaries and gaps in determinantal complexity
Karthik Sheshadri