This is a short summary. ↗ Open original to view full content
Moshe Vardi: What is Theoretical Computer Science?
from blog Combinatorics and more, | ↗ original
Related
More from Combinatorics and more
Jiaoyang Huang, Theo Mckenzie, Horng-Tzer Yau: Ramanujan Property and Edge Universality of Random Regular Graphs
12 Jan 2025 |
original ↗
A central problem in combinatorics, probability theory, and analysis is to understand the spectrum of random d-regular graphs G with vertices. The following paper marks a huge leap in our understanding of this problem. Ramanujan Property and Edge Universality of … Continue reading →
The Answer to TYI (57): In Dimension Three or More, Intuitive Norms are Euclidean
10 Jan 2025 |
original ↗
Consider equipped with a norm. Given a finite set of points and a point , we consider , the sum of distances from to the points in . Next we consider the set of points that attain the minimum of … Continue reading →
Test Your Intuition (57): Are All Norms Nice?
7 Jan 2025 |
original ↗
Consider equipped with a norm. Given a finite set of points and a point , we consider , the sum of distances from to the points in . Next we consider the set of points that attain the minimum of … Continue reading →
Last hours of 2024: One Wish, Reviving(?) Polymath3, Peter Sarnak’s Question, and Quantum Plans
31 Dec 2024 |
original ↗
A wish It is time for the horrible war to end Polymath thoughts: Reviving Polymath3? A question for our readers: Should we revive polymath3? Polymath3 dealt with the following problem: Is there a polynomial such that the graph of every … Continue reading →
Winter School on Expansion in Groups, Combinatorics, and Complexity
29 Dec 2024 |
original ↗
Next week in Weizmann Institute there will be a Winter school in expansion in groups combinatorics and complexity. (The link includes abstracts for the lectures.) Dates: January 5-8, 2025Venue: The beautiful Lopatie conference center, Weizmann Institute of Science, Israel.Registration: Registration … Continue reading →