Все публикации

0:45:28

Fibonacci numbers modulo an odd prime

1:03:01

The Burnside problem

0:21:41

The discrete Fourier uncertainty principle: VIII. Fourier-algebraic proof of Cauchy–Davenport

0:35:00

The discrete Fourier uncertainty principle: VII. Tao's uncertainty principle

0:17:12

The discrete Fourier uncertainty principle: VI. Chebotarëv's lemma

0:40:50

The discrete Fourier uncertainty principle: V. Vandermonde determinants

0:26:48

The discrete Fourier uncertainty principle: IV. Irreducibility of cyclotomic polynomials

0:37:08

Simplicity of the alternating group

0:30:44

The discrete Fourier uncertainty principle: III. Basics of cyclotomic polynomials

0:48:13

The discrete Fourier uncertainty principle: II. Proof of the uncertainty principle

0:38:29

The discrete Fourier uncertainty principle: I. Introduction and examples

0:31:31

The analytic rank of a tensor III: Analytic rank can replace partition rank

0:31:40

The analytic rank of a tensor II: Subadditivity

0:46:11

The analytic rank of a tensor I: Various notions of tensor rank

1:20:15

Tsirelson's space

0:56:36

The number of arithmetic progressions (Real-time mathematics 2.1)

0:39:37

Explaining the formula for 'noodle' trees (Real-time mathematics 1.2)

1:17:57

'Noodle' trees and compositions (Real-time Mathematics 1.1)

1:08:34

Furstenberg multiple recurrence and Szemerédi's theorem

1:01:44

The combinatorial Nullstellensatz

0:39:28

Erdős' solution to the Littlewood-Offord problem for real numbers