Why Pigeons at Rest Are at the Center of Complexity Theory

By January 2021, Papadimiturau had been thinking about the Korathaol policy for 30 years. So he was surprised when a intriguing conversation with a colleague frequently took their policy into a simple wrap that they never considered: What if there was less pigeon than the hole? In that case any system of pigeon must leave some empty holes. Again, it seems to be obvious. But has any interesting mathematical consequences of reversing the kothaole policy?

It can be heard as if this “empty-pigionhole” principle is only original by other names. However, it is not, and its subtle character has created a new and rewarding tool to classify the problems of the calculation.

To understand the empty-pigonhole policy, let’s go back to the example of the bank-card, a small number of movements from a football stadium to a concert with 3,000 seats, a smaller number than a possible four-digit pin. The empty-pigonhole policy indicates that some potential pins do not represent at all. If you want to find one of these missing pins, each person does not seem better than just asking their pin. So far, the empty-pigonhole policy is similar to its more famous part.

The difference is in the inconvenience of checking the solutions. Imagine someone who said that they found two specific people at the Football Stadium who had the same PIN. In this case, there is an easy way to verify that claim, which is related to the original kothaole scene: just check with the two in the question. However, in the case of the concert hall, imagine that someone has a view that no person has a 5926 PIN, then here, it is impossible to verify that everyone in the audience is not asking what their pin is. It makes the empty-pigonhole policy much more worrying for complex theorists.

Two months after Papadimituu started thinking about the empty-pigonhole policy, he brought in a conversation with a potential graduate student. He clearly remembers this, because it proved to be his last person conversation with someone before the Covid -19 lockdown. In the next months, at home, he wrestle the impact of the problem for the theory of complexity. Finally he and his colleagues have revealed a Paper About the solution guaranteed search issues due to the empty-pigionhol policy. They are especially interested in problems where pigeons are abundant – it is where they are much higher than pigeons. Hold a tradition Unattrace In the theory of complexity, they “they dubb the problems of this class for a large amount of perennial empty-pigionhole policy.”

One of the problems of this class was inspired by a famous Proof of 70 years old By the leading computer scientist Clad shannonThe Shannon has proved that most calculating problems must be solved by using an argument that depends on the empty-pigonhol policy (though he hasn’t called it). Yet for decades, computer scientists have tried and failed to prove that specific problems are really difficult. The bank-card pins are missing, even if we cannot identify them, strict problems must be out.

.This, researchers did not think about the process of looking for strict problems as search problems that can be mathematically analyzed. The procedure of Papadimitrio, which was associated with other searches associated with the empty-pigonhol policy, had its self-relaxed flavored features Many recent jobs The theory of complexity – it provided a new way to argue about the difficulty of proveing ​​countable difficulties.