A Note on the Permuted Puzzles Toy Conjecture

08/17/2021

∙

In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pass, Wootters, 2017) is false, and propose a new one. Our attack does not falsify the full ("non-toy") conjecture in that work, and it is our hope that this note will help further the analysis of that conjecture. Independently, (Boyle, Holmgren, Ma, Weiss, 2021) have obtained similar results.

READ FULL TEXT

A Note on the Permuted Puzzles Toy Conjecture

Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture

On Bock's Conjecture Regarding the Adam Optimizer

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems

On The "Majority is Least Stable" Conjecture

Distance Metric Ensemble Learning and the Andrews-Curtis Conjecture

On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution

Idealness of k-wise intersecting families

A Note on the Permuted Puzzles Toy Conjecture

Related Research

Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture

On Bock's Conjecture Regarding the Adam Optimizer

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems

On The "Majority is Least Stable" Conjecture

Distance Metric Ensemble Learning and the Andrews-Curtis Conjecture

On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution

Idealness of k-wise intersecting families