Seminars Sorted by Series

Computer Science/Discrete Mathematics Seminar II

Apr
01
2025

Computer Science/Discrete Mathematics Seminar II

Locally Testable Codes with the Multiplication Property from High-dimensional Expanders
10:30am|Simonyi 101 and Remote Access

A locally testable code (LTC) is an error-correcting code equipped with a tester T that, given an input string x, queries only a small number of positions and rejects x with probability proportional to its distance from the code. Classic examples of...

Apr
08
2025

Computer Science/Discrete Mathematics Seminar II

Cosystolic Expansion
10:30am|Simonyi 101 and Remote Access

High dimensional expansion comes in two flavors: spectral, which relates to random walks;  and cosystolic, which relates to chains of linear maps. The later is a more mysterious notion, which turns out related to a variety of applications such as...

May
27
2025

Computer Science/Discrete Mathematics Seminar II

Why Extension-Based Proofs Fail
Faith Ellen
10:30am|Simonyi Hall 101 and Remote Access

A valency argument is an elegant and well-known technique for proving impossibility results in distributed computing. It is an example of an extension-based proof, which is modelled as an interaction between a prover and a protocol. Even though...

Jun
17
2025

Computer Science/Discrete Mathematics Seminar II

Upper Bounds for Multicolour Ramsey Numbers
Marius Tiba
10:30am|Simonyi Hall 101 and Remote Access

The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \ge 2$, that 

$$R_r(k)...

Sep
23
2025

Computer Science/Discrete Mathematics Seminar II

Simulating Time With Square-Root Space (And With Details)
10:30am|Rubenstein Commons | Meeting Room 5

We will go in-depth into the proof that for all functions $t(n) \geq n$, every multitape Turing machine running in time $t$ can be simulated in space only $O(\sqrt{t \log t})$. We will attempt to be completely self-contained. To that end, we will...

Sep
30
2025

Computer Science/Discrete Mathematics Seminar II

Approximate Covers and Cocycle Expansion
10:30am|Simonyi Hall 101 and Remote Access

I will talk about the well known relation between cocycles and covers.  Then, I will discuss the relation of cocycle expansion to approximate covers, and finally how these show up in low-soundness PCP agreement tests.

Oct
07
2025

Computer Science/Discrete Mathematics Seminar II

Algorithms for Solving Random and Semirandom Planted Constraint Satisfaction Problems
10:30am|Simonyi Hall 101 and Remote Access

In this talk, we will discuss new algorithms for solving instances of random and semirandom planted constraint satisfaction problems (CSPs). Random CSP are generated by first choosing a solution x and then sampling constraints so that x satisfies...

Oct
14
2025

Computer Science/Discrete Mathematics Seminar II

From PCPs to Parallel PCPs: Hardness of Approximation in Parameterized Complexity
Karthik C. S.
10:30am|Dilworth Room

In this talk, I will begin with a quick primer to parameterized complexity, present some key insights from recent hardness of approximation results in the area, and end with a proof sketch of the following result: Assuming the Exponential Time...

Oct
21
2025

Computer Science/Discrete Mathematics Seminar II

Aldous-type Spectral Gaps in Unitary Groups, Part I
10:30am|Simonyi 101 and Remote Access

Around 1992, Aldous made the following bold conjecture. Let A be any set of transpositions in the symmetric group Sym(N). Then the spectral gap of the Cayley graph Cay(Sym(N),A) is identical to that of a relatively tiny N-vertex graph defined by A...

Oct
28
2025

Computer Science/Discrete Mathematics Seminar II

Aldous-type Spectral Gaps in Unitary Groups, Part II
10:30am|Simonyi 101 and Remote Access

Around 1992, Aldous made the following bold conjecture. Let A be any set of transpositions in the symmetric group Sym(N). Then the spectral gap of the Cayley graph Cay(Sym(N),A) is identical to that of a relatively tiny N-vertex graph defined by A...

Nov
04
2025

Computer Science/Discrete Mathematics Seminar II

No Exponential Quantum Speedup for SIS^inf Anymore
10:30am|Simonyi 101 and Remote Access

Given linear equations over a finite field and under infinity norm, the Short-Integer-Solution (SIS^inf) problem asks to find a solution where each entry is a small number.

In 2021, Chen, Liu, and Zhandry presented an efficient quantum algorithm for...

Nov
11
2025

Computer Science/Discrete Mathematics Seminar II

Hard Functions from on High: Local List Decoding from HDX
10:30am|Simonyi 101 and Remote Access

Can we encode data in a way that it is recoverable even when 1) most data becomes corrupted, and 2) we can only read a sub-constant fraction of the database? This is the central question of local list decoding, a powerful tool from coding theory...

Nov
18
2025

Computer Science/Discrete Mathematics Seminar II

Local List Decoding from HDX II
10:30am|Simonyi 101 and Remote Access

In this talk we will construct (approximate) locally list decodable codes from high dimensional expanders (HDXs).

Last week we saw that locally list decoding is a powerful tool from coding theory. We also got a subspace-based construction of...

Nov
25
2025

Computer Science/Discrete Mathematics Seminar II

Linial--Meshulam Complexes
10:30am|Simonyi 101 and Remote Access

Inspired by the Erdos--Renyi model for random graphs, Linial and Meshulam devised in 2006 a model for random 2-dimensional simplicial complexes. The goal of this talk (and the next) is to present some nice results about the behavior of these random...

Dec
02
2025

Computer Science/Discrete Mathematics Seminar II

Linial Meshulam Complexes 2
10:30am|Simonyi 101 and Remote Access

Last week we defined the Linial--Meshulam model for random 2 dimensional simplicial complexes and discussed two notions of connectivity for it: Vanishing of its 1st cohomology with F2 coefficients, and vanishing of its fundamental group. This time...

Dec
09
2025

Computer Science/Discrete Mathematics Seminar II

On Turán Numbers of Tight Cycles
10:30am|Simonyi 101 and Remote Access

The study of Turán numbers of graphs and hypergraphs is a rich problem in extremal combinatorics. The Turán problem asks, given a fixed forbidden (hyper)graph F, what is the maximum number of edges in an F-free (hyper)graph in terms of the number of...

Computer Science/Discrete Mathematics Seminar III

Mar
22
2005

Computer Science/Discrete Mathematics Seminar III

Information Theory and Probability Estimation
Alon Orlitsky
11:30am|S-101

Standard information-theoretic results show that data over small, typically binary, alphabets can be compressed to Shannon's entropy limit. Yet most practical sources, such as text, audio, or video, have essentially infinite support. Compressing...

May
06
2005

Computer Science/Discrete Mathematics Seminar III

An O(log n log log n) Space Algorithm for Undirected st-Connectivity
2:00pm|S-101

Undirected st-connectivity (USTCONN) is the problem of checking whether two given vertices of an undirected graph are connected by a path. Solving USTCONN in space O(log n), and even o(log2 n), is a challenging task. A randomized logspace algorithm...

Jun
01
2005

Computer Science/Discrete Mathematics Seminar III

Computing Equilibria
Christos Papadimitriou
11:15am|S-101

There has been some recent excitement and progress in the long-stalled topic of efficient algorithms for finding equilibria in games and other economic contexts. We discuss some of these developments.

Oct
28
2005

Computer Science/Discrete Mathematics Seminar III

Hyperbolic Polynomials and Van der Waerden/Schrijver-Valiant like Conjectures
2:00pm|S-101

The van der Waerden conjecture states that the permanent of N by N doubly stochastic matrix A satisfies the inequality Per(A) >= n! / n^n (VDW bound) and was finally proven (independently) by D.I. Falikman and G.P. Egorychev in 1981. It was for more...

Mar
16
2006

Computer Science/Discrete Mathematics Seminar III

Time-Space Trade-Offs for Predecessor Search
Mikkel Thorup
11:15am|S-101

We develop a new technique for proving cell-probe lower bounds for static data structures. Previous lower bounds used a reduction to communication games, which was known not to be tight by counting arguments. We give the first lower bound for an...

Dec
13
2006

Computer Science/Discrete Mathematics Seminar III

Permanents, Determinants and Non-Commutativity
Alistair Sinclair
11:15am|West Building Lecture Theatre

All known efficient algorithms for computing the determinant of a matrix rely on commutativity of the matrix entries. How important is this property, and could we make use of an algorithm that computes determinants without assuming commutativity? In...

May
16
2008

Computer Science/Discrete Mathematics Seminar III

Reconstruction of Depth-3 Arithmetic Circuits
Amir Shpilka
10:30am|West Bldg. Lecture Hall

Depth-3 arithmetic circuits compute polynomials that can be represented as sums of products of linear functions. In spite of their simple structure, we are far from understanding such circuits. In this talk we will focus on the reconstruction...

Condensed Learning Seminar

Sep
29
2023

Condensed Learning Seminar

Organizational Meeting
2:30pm|Princeton University, Fine Hall 314

This is the introductory talk for a semester-long learning seminar on the notion of solid modules and the resulting 6-functor formalism for coherent cohomology.

Oct
23
2023

Condensed Learning Seminar

Solid Modules and Six Functors for Quasi-Coherent Sheaves
3:30pm|Simonyi Hall 101 and Remote Access

Quasi-coherent sheaves cannot support a six-functor formalism in the same way that e.g. \ell-adic sheaves do. Clausen and Scholze have shown that this can be fixed by extending the category of quasi-coherent sheaves to `solid sheaves’. In this talk...

Nov
03
2023

Condensed Learning Seminar

Analytic Rings
2:30pm|Princeton University, Fine Hall 314

This talk is an introduction to analytic rings. Some examples and non-examples will be covered. Some nice properties of the module categories will be proved.

Nov
10
2023

Condensed Learning Seminar

Solid Abelian Groups
Juan Esteban Rodriguez Camargo
2:30pm|Princeton University, Fine Hall 314

We will discuss the notion of solid abelian groups.

Dec
08
2023

Condensed Learning Seminar

Solid Quasi-Coherent Sheaves
Hanlin Cai
2:30pm|Princeton University, Fine Hall 314

We will globalize the notion of solid modules to an arbitrary scheme/discrete adic space.

Jan
26
2024

Condensed Learning Seminar

Organizational Meeting
2:30pm|Princeton University, Fine Hall 314

The topic of the learning seminar this semester is "Analytic K-theory''. More precisely, the goal is to use condensed mathematics to obtain a notion of quasi-coherent sheaves/complexes in rigid analytic geometry, develop Efimov's approach to K...

Feb
02
2024

Condensed Learning Seminar

Recollections on K-theory
2:30pm|Princeton University, Fine Hall 314

Define the Grothendieck group of a commutative ring. Then define K1 and K2 and 
state Matsumoto’s theorem. Explain the definitions of higher K-theory in terms of the 
+-construction and in terms of the∞-group completion of groupoid of finite...

Feb
09
2024

Condensed Learning Seminar

Dualizable Categories
2:30pm|Princeton University, Fine Hall 314

Introduce the notion of stable compactly generated $\infty$-category and discuss its properties and some examples. In particular, prove that the $\infty$-category of small idempotent complete stable $\infty$-categories is equivalent to the $\infty$...

Feb
16
2024

Condensed Learning Seminar

Efimov K-Theory
2:30pm|Princeton University, Fine Hall 314

Introduce the notion of Verdier sequences of presentable stable $\infty$-categories and then discuss the behavior of dualizable $\infty$-categories in Verdier sequence; in particular, discuss Thomason's trick. Introduce the notion of localizing...

Feb
23
2024

Condensed Learning Seminar

Animated Analytic Rings
2:30pm|Princeton University, Fine Hall 314

Recall the notion of condensed analytic ring, then introduce its animated variant and discuss its properties. Explain the construction of induced analytic structures on animated condensed rings. Introduce the notion of steady maps of analytic rings...

Mar
01
2024

Condensed Learning Seminar

Trace Class Maps and Nuclearity
2:30pm|Princeton University, Fine Hall 314

Introduce the notion of nuclear object in a symmetric monoidal stable ($\infty$-)category and discuss its properties. In particular, prove that if the monoidal unit is compact, then an object is dualizable if and only if it is compact and nuclear...

Mar
22
2024

Condensed Learning Seminar

Analytic Adic Spaces and Descent
2:30pm|Princeton University, Fine Hall 214

For a general complete Huber pair $(A,A^+)$, define the analytic ring $(A,A^+)_\blacksquare$. Prove that the associations $\mathrm{Spa}\, (A,A^+)\mapsto \mathcal{D}((A,A^+)_\blacksquare)$, $\mathrm{Spa}\, (A,A^+)\mapsto \mathcal{D}^\omega((A,A^+)_...

Apr
02
2024

Condensed Learning Seminar

Six Functors
Juan Esteban Rodriguez Camargo
2:00pm|Simonyi Hall 101

Define the category of solid quasi-coherent sheaves $\mathcal{D}_\blacksquare(X)$ on a rigid-analytic varity $X$. Show that this assignment comes with a natural $6$-functor formalism. Finally, prove the Grothendieck--Serre duality in the rigid...

Apr
05
2024

Condensed Learning Seminar

Nuc(X) is Dualizable
2:30pm|Princeton University, Fine Hall 314

Prove that for a qcqs analytic adic space $X$, the category of nuclear sheaves on $X$ is dualizable in two steps. First, establish the result locally over affinoid Tate adic spaces using the notion of weak proregularity and then prove a general...

Apr
12
2024

Condensed Learning Seminar

K-Theory Satisfies Nisnevich Descent
Longke Tang
2:30pm|Princeton University, Fine Hall 314

Review the notion of cd-structure for a Grothendieck topology and explain how it helps check the sheaf conditions. Introduce and discuss the Nisnevich topology for schemes and analytic adic spaces; in particular, discuss their equivalent...

Apr
19
2024

Condensed Learning Seminar

Étale Hyperdescent
2:30pm|Princeton University, Fine Hall 314

Introduce the notion of hypersheaf and discuss its basic properties and equivalent characterizations. In particular, discuss the notions of homotopy and cohomological dimensions and their relation to hyperdescent. Sketch the proof of the fact for...

Apr
26
2024

Condensed Learning Seminar

Grothendieck-Riemann-Roch, Part I
Vadim Vologodsky
2:30pm|Princeton University, Fine Hall 314

Explain the formulation of the Grothendieck–Riemann–Roch theorem for analytic adic spaces: go through [And23, pp. 32-38] and define all relevant objects and maps. Before explaining the construction of the Chern class map, define the sheaf KU∧p on...