549 research outputs found
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
On Optimization and Counting of Non-Broken Bases of Matroids
Given a matroid M = (E,I), and a total ordering over the elements E, a broken circuit is a circuit where the smallest element is removed and an NBC independent set is an independent set in I with no broken circuit. The set of NBC independent sets of any matroid M define a simplicial complex called the broken circuit complex which has been the subject of intense study in combinatorics. Recently, Adiprasito, Huh and Katz showed that the face of numbers of any broken circuit complex form a log-concave sequence, proving a long-standing conjecture of Rota.
We study counting and optimization problems on NBC bases of a generic matroid. We find several fundamental differences with the independent set complex: for example, we show that it is NP-hard to find the max-weight NBC base of a matroid or that the convex hull of NBC bases of a matroid has edges of arbitrary large length. We also give evidence that the natural down-up walk on the space of NBC bases of a matroid may not mix rapidly by showing that for some family of matroids it is NP-hard to count the number of NBC bases after certain conditionings
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation
Proof-of-Replication (PoRep) plays a pivotal role in decentralized storage networks, serving as a mechanism to verify that provers consistently store retrievable copies of specific data. While PoRep’s utility is unquestionable, its implementation in large-scale systems, such as Filecoin, has been hindered by scalability challenges. Most existing PoRep schemes, such as Fisch’s (Eurocrypt 2019), face an escalating number of challenges and growing computational overhead as the number of stored files increases. This paper introduces a novel PoRep scheme distinctively tailored for expansive decentralized storage networks. At its core, our approach hinges on polynomial evaluation, diverging from the probabilistic checking prevalent in prior works. Remarkably, our design requires only a single challenge, irrespective of the number of files, ensuring both prover’s and verifier’s run-times remain manageable even as file counts soar. Our approach introduces a paradigm shift in PoRep designs, offering a blueprint for highly scalable and efficient decentralized storage solutions
A proof of the Ryser-Brualdi-Stein conjecture for large even
A Latin square of order is an by grid filled using symbols so
that each symbol appears exactly once in each row and column. A transversal in
a Latin square is a collection of cells which share no symbol, row or column.
The Ryser-Brualdi-Stein conjecture, with origins from 1967, states that every
Latin square of order contains a transversal with cells, and a
transversal with cells if is odd. Keevash, Pokrovskiy, Sudakov and
Yepremyan recently improved the long-standing best known bounds towards this
conjecture by showing that every Latin square of order has a transversal
with cells. Here, we show, for sufficiently large ,
that every Latin square of order has a transversal with cells.
We also apply our methods to show that, for sufficiently large , every
Steiner triple system of order has a matching containing at least
edges. This improves a recent result of Keevash, Pokrovskiy, Sudakov and
Yepremyan, who found such matchings with edges, and
proves a conjecture of Brouwer from 1981 for large .Comment: 71 pages, 13 figure
Quadratic Speedups in Parallel Sampling from Determinantal Distributions
We study the problem of parallelizing sampling from distributions related to
determinants: symmetric, nonsymmetric, and partition-constrained determinantal
point processes, as well as planar perfect matchings. For these distributions,
the partition function, a.k.a. the count, can be obtained via matrix
determinants, a highly parallelizable computation; Csanky proved it is in NC.
However, parallel counting does not automatically translate to parallel
sampling, as classic reductions between the two are inherently sequential. We
show that a nearly quadratic parallel speedup over sequential sampling can be
achieved for all the aforementioned distributions. If the distribution is
supported on subsets of size of a ground set, we show how to approximately
produce a sample in time with polynomially
many processors for any constant . In the two special cases of symmetric
determinantal point processes and planar perfect matchings, our bound improves
to and we show how to sample exactly in these cases.
As our main technical contribution, we fully characterize the limits of
batching for the steps of sampling-to-counting reductions. We observe that only
steps can be batched together if we strive for exact sampling, even in
the case of nonsymmetric determinantal point processes. However, we show that
for approximate sampling, steps can be
batched together, for any entropically independent distribution, which includes
all mentioned classes of determinantal point processes. Entropic independence
and related notions have been the source of breakthroughs in Markov chain
analysis in recent years, so we expect our framework to prove useful for
distributions beyond those studied in this work.Comment: 33 pages, SPAA 202
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
We study a new and stronger notion of fault-tolerant graph structures whose
size bounds depend on the degree of the failing edge set, rather than the total
number of faults. For a subset of faulty edges , the
faulty-degree is the largest number of faults in incident to any
given vertex. We design new fault-tolerant structures with size comparable to
previous constructions, but which tolerate every fault set of small
faulty-degree , rather than only fault sets of small size . Our
main results are:
- New FT-Certificates: For every -vertex graph and degree threshold
, one can compute a connectivity certificate with edges that has the following guarantee: for any edge set
with faulty-degree and every vertex pair , it holds that
and are connected in iff they are connected in . This bound on is nearly tight. Since our certificates
handle some fault sets of size up to , prior work did not imply any
nontrivial upper bound for this problem, even when .
- New FT-Spanners: We show that every -vertex graph admits a
-spanner with edges, which
tolerates any fault set of faulty-degree at most . This bound on
optimal up to its hidden dependence on , and it is close to the
bound of that is known for the case where the
total number of faults is [Bodwin, Dinitz, Robelle SODA '22]. Our proof
of this theorem is non-constructive, but by following a proof strategy of
Dinitz and Robelle [PODC '20], we show that the runtime can be made polynomial
by paying an additional factor in spanner size
Stability of Homomorphisms, Coverings and Cocycles I: Equivalence
This paper is motivated by recent developments in group stability, high
dimensional expansion, local testability of error correcting codes and
topological property testing. In Part I, we formulate and motivate three
stability problems: 1. Homomorphism stability: Are almost homomorphisms close
to homomorphisms? 2. Covering stability: Are almost coverings of a cell complex
close to genuine coverings of it? 3. Cocycle stability: Are 1-cochains whose
coboundary is small close to 1-cocycles? We then prove that these three
problems are equivalent.Comment: 32 page
Gap Preserving Reductions Between Reconfiguration Problems
Combinatorial reconfiguration is a growing research field studying problems on the transformability between a pair of solutions for a search problem. For example, in SAT Reconfiguration, for a Boolean formula ? and two satisfying truth assignments ?_? and ?_? for ?, we are asked to determine whether there is a sequence of satisfying truth assignments for ? starting from ?_? and ending with ?_?, each resulting from the previous one by flipping a single variable assignment. We consider the approximability of optimization variants of reconfiguration problems; e.g., Maxmin SAT Reconfiguration requires to maximize the minimum fraction of satisfied clauses of ? during transformation from ?_? to ?_?. Solving such optimization variants approximately, we may be able to obtain a reasonable reconfiguration sequence comprising almost-satisfying truth assignments.
In this study, we prove a series of gap-preserving reductions to give evidence that a host of reconfiguration problems are PSPACE-hard to approximate, under some plausible assumption. Our starting point is a new working hypothesis called the Reconfiguration Inapproximability Hypothesis (RIH), which asserts that a gap version of Maxmin CSP Reconfiguration is PSPACE-hard. This hypothesis may be thought of as a reconfiguration analogue of the PCP theorem. Our main result is PSPACE-hardness of approximating Maxmin 3-SAT Reconfiguration of bounded occurrence under RIH. The crux of its proof is a gap-preserving reduction from Maxmin Binary CSP Reconfiguration to itself of bounded degree. Because a simple application of the degree reduction technique using expander graphs due to Papadimitriou and Yannakakis (J. Comput. Syst. Sci., 1991) does not preserve the perfect completeness, we modify the alphabet as if each vertex could take a pair of values simultaneously. To accomplish the soundness requirement, we further apply an explicit family of near-Ramanujan graphs and the expander mixing lemma. As an application of the main result, we demonstrate that under RIH, optimization variants of popular reconfiguration problems are PSPACE-hard to approximate, including Nondeterministic Constraint Logic due to Hearn and Demaine (Theor. Comput. Sci., 2005), Independent Set Reconfiguration, Clique Reconfiguration, and Vertex Cover Reconfiguration
- …