Канал: IAS | PCMI Park City Mathematics Institute

Knotty knits A chat about math and crafts | Knotty knits: a chat about math and crafts

Knotty knits A chat about math and crafts | Knotty knits: a chat about math and crafts

Mathematical Maturity: Story vs. Craft: Why I like to lecture | Tom Garrity

Mathematical Maturity: Story vs. Craft: Why I like to lecture | Tom Garrity

A^1-homotopy and A^1-algebraic Topologie, part 1 I Fabien Morel, University LMU Munich

A^1-homotopy and A^1-algebraic Topologie, part 1 I Fabien Morel, University LMU Munich

Arithmetic properties of local systems | Tom Bachmann, Johannes Gutenberg University of Mainz

Arithmetic properties of local systems | Tom Bachmann, Johannes Gutenberg University of Mainz

Motivic explorations in enumerative geometry, pt4 | Sabrina Pauli, Technische Universität Darmstadt

Motivic explorations in enumerative geometry, pt4 | Sabrina Pauli, Technische Universität Darmstadt

Field arithmetic and the complexity of Galois cohomology, part4 | Daniel Krashen, U of Pennsylvania

Field arithmetic and the complexity of Galois cohomology, part4 | Daniel Krashen, U of Pennsylvania

Field arithmetic and the complexity of Galois cohomology, part3 | Daniel Krashen, U of Pennsylvania

Field arithmetic and the complexity of Galois cohomology, part3 | Daniel Krashen, U of Pennsylvania

Characteristic classes in stable motivic homotopy theory, part 4 | Frédéric Déglise, CNRS, ENS Lyon

Characteristic classes in stable motivic homotopy theory, part 4 | Frédéric Déglise, CNRS, ENS Lyon

Motivic explorations in enumerative geometry, pt3 | Sabrina Pauli, Technische Universität Darmstadt

Motivic explorations in enumerative geometry, pt3 | Sabrina Pauli, Technische Universität Darmstadt

1 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

1 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

4 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

4 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

Characteristic classes in stable motivic homotopy theory pt.3 | Frédéric Déglise, CNRS, ENS Lyon

Characteristic classes in stable motivic homotopy theory pt.3 | Frédéric Déglise, CNRS, ENS Lyon

Motivic explorations in enumerative geometry, pt2 | Sabrina Pauli, Technische Universität Darmstadt

Motivic explorations in enumerative geometry, pt2 | Sabrina Pauli, Technische Universität Darmstadt

Field arithmetic and the complexity of Galois cohomology, part2 | Daniel Krashen, U of Pennsylvania

Field arithmetic and the complexity of Galois cohomology, part2 | Daniel Krashen, U of Pennsylvania

Motivic Homotopy: what's up with that? | Michael Hopkins

Motivic Homotopy: what's up with that? | Michael Hopkins

Motivic explorations in enumerative geometry, pt1 | Sabrina Pauli, Technische Universität Darmstadt

Motivic explorations in enumerative geometry, pt1 | Sabrina Pauli, Technische Universität Darmstadt

Characteristic classes in stable motivic homotopy theory pt.2 | Frédéric Déglise, CNRS, ENS Lyon

Characteristic classes in stable motivic homotopy theory pt.2 | Frédéric Déglise, CNRS, ENS Lyon

How I got into motivic homotopy theory–Contractibility and Spheres: a motivic view | Aravind Asok

How I got into motivic homotopy theory–Contractibility and Spheres: a motivic view | Aravind Asok

Field arithmetic and the complexity of Galois cohomology, part1 | Daniel Krashen, Uof Pennsylvania

Field arithmetic and the complexity of Galois cohomology, part1 | Daniel Krashen, Uof Pennsylvania

Characteristic classes in stable motivic homotopy theory pt.1 | Frédéric Déglise, CNRS, ENS Lyon

Characteristic classes in stable motivic homotopy theory pt.1 | Frédéric Déglise, CNRS, ENS Lyon

A^1-homotopy and A^1-algebraic Topologie, part 2 I Fabien Morel, University LMU Munich

A^1-homotopy and A^1-algebraic Topologie, part 2 I Fabien Morel, University LMU Munich

Representation categories and motives part1 | Markus Spitzweck, University of Osnabrueck

Representation categories and motives part1 | Markus Spitzweck, University of Osnabrueck

Motivic Adams conjecture | Maria Yakerson, Oxford University

Motivic Adams conjecture | Maria Yakerson, Oxford University

A^1-algebraic topology (following F. Morel) part 4 | Joseph Ayoub, Universität Zürich

A^1-algebraic topology (following F. Morel) part 4 | Joseph Ayoub, Universität Zürich

pt 4 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

pt 4 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

Geometry with Seam Allowance | Irena Swanson, Purdue University

Geometry with Seam Allowance | Irena Swanson, Purdue University

Torsors over affine curves part4 | Philippe Gille, Université Claude Bernard, Lyon 1

Torsors over affine curves part4 | Philippe Gille, Université Claude Bernard, Lyon 1

A^1-algebraic topology (following F. Morel) part 3 | Joseph Ayoub, Universität Zürich

A^1-algebraic topology (following F. Morel) part 3 | Joseph Ayoub, Universität Zürich

pt 3 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

pt 3 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

Torsors over affine curves part3 | Philippe Gille, Université Claude Bernard, Lyon 1

Torsors over affine curves part3 | Philippe Gille, Université Claude Bernard, Lyon 1

A^1-algebraic topology (following F. Morel) part 2 | Joseph Ayoub, Universität Zürich

A^1-algebraic topology (following F. Morel) part 2 | Joseph Ayoub, Universität Zürich

pt 2 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

pt 2 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

A^1-algebraic topology (following F. Morel) part 1 | Joseph Ayoub, Universität Zürich

A^1-algebraic topology (following F. Morel) part 1 | Joseph Ayoub, Universität Zürich

Torsors over affine curves part2 | Philippe Gille, Université Claude Bernard, Lyon 1

Torsors over affine curves part2 | Philippe Gille, Université Claude Bernard, Lyon 1

The (motivic) Brouwer degree | Fabien Morel, University LMU Munich

The (motivic) Brouwer degree | Fabien Morel, University LMU Munich

pt 1 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

pt 1 A1-homotopy theory and the Weil conjectures | Kirsten Wickelgren, Duke University

Torsors over affine curves part1 | Philippe Gille, Université Claude Bernard, Lyon 1

Torsors over affine curves part1 | Philippe Gille, Université Claude Bernard, Lyon 1

2 From matrices to motivic homotopy theory | Aravind Asok, University of Southern California (USC)

2 From matrices to motivic homotopy theory | Aravind Asok, University of Southern California (USC)

Algebraic vector bundles over smooth affine varieties | Michael Hopkins, Harvard

Algebraic vector bundles over smooth affine varieties | Michael Hopkins, Harvard

Henry Segerman | Artistic mathematics: Truth and Beauty

Henry Segerman | Artistic mathematics: Truth and Beauty

A-upper motives | Nikita Karpenko (University of Alberta)

A-upper motives | Nikita Karpenko (University of Alberta)

Part 4 Chow groups | Burt Totaro, UCLA

Part 4 Chow groups | Burt Totaro, UCLA

3 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

3 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

3 Local Systems in Arithmetic Geometry | Hélène Esnault, Freie Berlin, Harvard, U of Copenhagen

3 Local Systems in Arithmetic Geometry | Hélène Esnault, Freie Berlin, Harvard, U of Copenhagen

Part 3 Chow groups | Burt Totaro, UCLA

Part 3 Chow groups | Burt Totaro, UCLA

2 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

2 Massey products in Galois cohomology | Alexander Merkurjev and Federico Scavia

2 Arithmetic Properties of Local Systems | Hélène Esnault, Freie U Berlin, Harvard, U of Copenhagen

2 Arithmetic Properties of Local Systems | Hélène Esnault, Freie U Berlin, Harvard, U of Copenhagen

Part 2 Chow groups | Burt Totaro, UCLA

Part 2 Chow groups | Burt Totaro, UCLA

1 Local Systems in Arithmetic Geometry | Hélène Esnault, FU Berlin, Harvard, Copenhagen, B.Church TA

1 Local Systems in Arithmetic Geometry | Hélène Esnault, FU Berlin, Harvard, Copenhagen, B.Church TA

Part 1 Chow groups | Burt Totaro, UCLA

Part 1 Chow groups | Burt Totaro, UCLA

1 From matrices to motivic homotopy theory | Aravind Asok, University of Southern California (USC)

1 From matrices to motivic homotopy theory | Aravind Asok, University of Southern California (USC)

Part 2 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 2 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 5 Algorithmic dual to the adversary method: Quantum query complexity | Yassine Hamoudi

Part 5 Algorithmic dual to the adversary method: Quantum query complexity | Yassine Hamoudi

Part 2 The polynomial method: Quantum query complexity | Yassine Hamoudi (U California Berkeley)

Part 2 The polynomial method: Quantum query complexity | Yassine Hamoudi (U California Berkeley)

Part 3 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)

Part 3 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)

Part 4 Transversal gates: Topological aspects of quantum codes | Jeongwan Haah (Microsoft Research)

Part 4 Transversal gates: Topological aspects of quantum codes | Jeongwan Haah (Microsoft Research)

Part 5 Stoquastic Hamiltonians | Sandy Irani (University of California, Irvine)

Part 5 Stoquastic Hamiltonians | Sandy Irani (University of California, Irvine)

Part 5 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 5 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 3 Circuit complexity of code states | Jeongwan Haah (Microsoft Research)

Part 3 Circuit complexity of code states | Jeongwan Haah (Microsoft Research)

Part 4 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 4 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 4 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 4 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 3 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 3 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 3 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 3 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 2 Codes and homology | Jeongwan Haah (Microsoft Research)

Part 2 Codes and homology | Jeongwan Haah (Microsoft Research)

Part 2 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 2 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 1 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)

Part 1 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)

Part 1 Quantum Singleton bound and consequences | Jeongwan Haah (Microsoft Research)

Part 1 Quantum Singleton bound and consequences | Jeongwan Haah (Microsoft Research)

Part 1 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 1 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)

Part 1 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 1 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)

Part 4 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 4 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 5 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)

Part 5 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)

Quantum Error Correction | Barbara Terhal (Delft University of Technology)

Quantum Error Correction | Barbara Terhal (Delft University of Technology)

Part 3 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 3 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 4 Quantum query complexity: the adversary method | Yassine Hamoudi (U of California, Berkeley)

Part 4 Quantum query complexity: the adversary method | Yassine Hamoudi (U of California, Berkeley)

Part 4 Introducing quantum-inspired linear algebra | Ewin Tang (University of Washington)

Part 4 Introducing quantum-inspired linear algebra | Ewin Tang (University of Washington)

Verifiable Quantum Supremacy: What I Hope Will Be Done | Scott Aaronson (University of Texas)

Verifiable Quantum Supremacy: What I Hope Will Be Done | Scott Aaronson (University of Texas)

Part 2 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 2 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 2 Proving the QSVT | Ewin Tang (University of Washington)

Part 2 Proving the QSVT | Ewin Tang (University of Washington)

Part 3 The recording method–Quantum query complexity| Yassine Hamoudi (U of California, Berkeley)

Part 3 The recording method–Quantum query complexity| Yassine Hamoudi (U of California, Berkeley)

Part 1 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 1 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)

Part 1 Quantum query complexity basics+the hybrid method | Yassine Hamoudi (U California, Berkeley)

Part 1 Quantum query complexity basics+the hybrid method | Yassine Hamoudi (U California, Berkeley)

Part 1 Quantum and quantum-inspired linear algebra | Ewin Tang (University of Washington)

Part 1 Quantum and quantum-inspired linear algebra | Ewin Tang (University of Washington)

Part 4 Learning classes of quantum states | Srinivasan Arunachalam (IBM Quantum)

Part 4 Learning classes of quantum states | Srinivasan Arunachalam (IBM Quantum)

Part 5 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Institute)

Part 5 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Institute)

Part 5 Algorithmic Aspects Of Optimal Channel Coding | Omar Fawzi (École Normale Supérieure de Lyon)

Part 5 Algorithmic Aspects Of Optimal Channel Coding | Omar Fawzi (École Normale Supérieure de Lyon)

Part 3 Overview of results for learning quantum states | Srinivasan Arunachalam (IBM Quantum)

Part 3 Overview of results for learning quantum states | Srinivasan Arunachalam (IBM Quantum)

Part 4 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)

Part 4 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)

Part 4 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)

Part 4 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)

Part 3 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)

Part 3 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)

Part 2 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)

Part 2 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)

Part 3 Data Processing For Quantum Relative Entropy | Omar Fawzi (École Normale Supérieure de Lyon)

Part 3 Data Processing For Quantum Relative Entropy | Omar Fawzi (École Normale Supérieure de Lyon)

Part 1 Discrete and Quantum Fourier Transform | András Gilyén (Alfréd Rényi Institute, Hungary)

Part 1 Discrete and Quantum Fourier Transform | András Gilyén (Alfréd Rényi Institute, Hungary)

Part 2 Distance Measures Between States | Omar Fawzi (École Normale Supérieure de Lyon)

Part 2 Distance Measures Between States | Omar Fawzi (École Normale Supérieure de Lyon)

Part 2 Strengths and weakness for learning functions from quantum examples | Srinivasan Arunachalam

Part 2 Strengths and weakness for learning functions from quantum examples | Srinivasan Arunachalam

Part 1 Overview of quantum learning theory | Srinivasan Arunachalam (IBM Quantum)

Part 1 Overview of quantum learning theory | Srinivasan Arunachalam (IBM Quantum)

Equity Panel–Rehumanizing Mathematics with Rochelle Gutierrez

Equity Panel–Rehumanizing Mathematics with Rochelle Gutierrez

Equity Panel–Rehumanizing Mathematics with Rochelle Gutierrez

Equity Panel–Rehumanizing Mathematics with Rochelle Gutierrez

3/3 Around the inverse Galois problem, Olivier Wittenberg, Institut Galilée-Univ Sorbonne Paris Nord

3/3 Around the inverse Galois problem, Olivier Wittenberg, Institut Galilée-Univ Sorbonne Paris Nord

pt3 Rational points on varieties & the Brauer-Manin obstruction | Bianca Viray, Univ. of Washington

pt3 Rational points on varieties & the Brauer-Manin obstruction | Bianca Viray, Univ. of Washington

4/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

4/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

3/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

3/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

2/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

2/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

1/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

1/4 Arithmetic Statistics | Melanie Matchett Wood, Harvard University

pt1 Rational points on varieties & the Brauer-Manin obstruction | Bianca Viray, Univ. of Washington

pt1 Rational points on varieties & the Brauer-Manin obstruction | Bianca Viray, Univ. of Washington

2/3 Rigid CoCycles & Singular Moduli | Jan Vonk, Leiden University

2/3 Rigid CoCycles & Singular Moduli | Jan Vonk, Leiden University

Pt.3 Counting points on curves over finite fields | David Harvey, University of New South Wales

Pt.3 Counting points on curves over finite fields | David Harvey, University of New South Wales

2/3 Around the inverse Galois problem, Olivier Wittenberg, Institut Galilée-Univ Sorbonne Paris Nord

2/3 Around the inverse Galois problem, Olivier Wittenberg, Institut Galilée-Univ Sorbonne Paris Nord

Technology that Thinks With You Not For You | Eli Luberoff

Technology that Thinks With You Not For You | Eli Luberoff

1/3 Rigid CoCycles & Singular Moduli | Jan Vonk, Leiden University

1/3 Rigid CoCycles & Singular Moduli | Jan Vonk, Leiden University

1/3 Around the inverse Galois problem, Olivier Wittenberg, Institut Galilée-Univ Sorbonne Paris Nord

1/3 Around the inverse Galois problem, Olivier Wittenberg, Institut Galilée-Univ Sorbonne Paris Nord

Pt.2 Counting points on curves over finite fields | David Harvey, University of New South Wales

Pt.2 Counting points on curves over finite fields | David Harvey, University of New South Wales

2/3 Rational points on varieties & the Brauer-Manin obstruction | Bianca Viray, Univ. of Washington

2/3 Rational points on varieties & the Brauer-Manin obstruction | Bianca Viray, Univ. of Washington

Sphere packing and beyond | Maryna Viazovska, École Polytechnique Fédérale de Lausanne

Sphere packing and beyond | Maryna Viazovska, École Polytechnique Fédérale de Lausanne

1.3 Counting points on curves over finite fields | David Harvey, University of New South Wales

1.3 Counting points on curves over finite fields | David Harvey, University of New South Wales

1.2 Counting points on curves over finite fields | David Harvey, University of New South Wales

1.2 Counting points on curves over finite fields | David Harvey, University of New South Wales

1.1 Counting points on curves over finite fields | David Harvey, University of New South Wales

1.1 Counting points on curves over finite fields | David Harvey, University of New South Wales

Vonk-check for dupe

Vonk-check for dupe

Nadia Heninger1 3

Nadia Heninger1 3

Pt.2 Equity Panel in Mathematics

Pt.2 Equity Panel in Mathematics

Pt.1 Equity Panel in Mathematics

Pt.1 Equity Panel in Mathematics

Pt.3 Equity Panel in Mathematics

Pt.3 Equity Panel in Mathematics

Jordan Ellenberg | Outward-facing math | PCMI

Jordan Ellenberg | Outward-facing math | PCMI

3.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

3.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

2.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

2.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

3.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

3.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

2.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

2.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

1.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

1.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

1.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

1.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

Pt.3 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.3 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.2 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.2 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.1 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.1 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

3.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

3.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

2.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

2.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

1.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

1.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.4 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.4 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.3 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.4 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.4 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.5 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.5 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.2 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.1 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.5 Computational tools for number theorists | Andrew V. Sutherland, MIT

5.5 Computational tools for number theorists | Andrew V. Sutherland, MIT

4.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

4.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

4.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

4.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

4.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

4.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

3.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

3.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

3.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

3.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

3.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

3.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

2.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

2.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

2.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

2.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

2.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

2.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

1.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

1.3 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

1.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

1.2 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

1.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

1.1 Algorithms in algebraic number theory| Hendrik Lenstra, Universiteit Leiden

Lecture #1 part 3: Lattices and Hard Lattice Problems | Joseph H. Silverman

Lecture #1 part 3: Lattices and Hard Lattice Problems | Joseph H. Silverman

Lecture #1 part 2: Lattices and Hard Lattice Problems | Joseph H. Silverman

Lecture #1 part 2: Lattices and Hard Lattice Problems | Joseph H. Silverman

Lecture #2 part 1: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman

Lecture #2 part 1: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman

Lecture #2 part 2: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman

Lecture #2 part 2: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman

Lecture #2 part 3: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman

Lecture #2 part 3: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman

Lecture #3 part2: Public Key Cryptography 101: A Brief Introduction | Joseph H. Silverman

Lecture #3 part2: Public Key Cryptography 101: A Brief Introduction | Joseph H. Silverman

Lecture #3 part1: Public Key Cryptography 101: A Brief Introduction | Joseph H. Silverman

Lecture #3 part1: Public Key Cryptography 101: A Brief Introduction | Joseph H. Silverman

Lecture #3 part3: Public Key Cryptography 101: A Brief Introduction | Joseph H. Silverman

Lecture #3 part3: Public Key Cryptography 101: A Brief Introduction | Joseph H. Silverman

Lecture #1 part 1: Lattices and Hard Lattice Problems | Joseph H. Silverman

Lecture #1 part 1: Lattices and Hard Lattice Problems | Joseph H. Silverman

Lecture #5 part 2: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 2: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 4: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 4: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 5: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 5: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 3: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 3: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #4 part 4: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 4: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 2: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 2: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 3: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 3: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 1: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #4 part 1: Lattice-Based Public Key Cryptosystems | Joseph H. Silverman

Lecture #5 part 1: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Lecture #5 part 1: Lattice-Based Digital Signatures and Rejection Sampling | Joseph H. Silverman

Algorithms in algebraic number theory IV - Hendrik Lenstra

Algorithms in algebraic number theory IV - Hendrik Lenstra

Hilbert Reciprocity VIII - Dustin Clausen

Hilbert Reciprocity VIII - Dustin Clausen

Inverse Galois Problem IV - Tim Dokchitser

Inverse Galois Problem IV - Tim Dokchitser

Pt.5 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.5 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Hilbert Reciprocity VII - Dustin Clausen

Hilbert Reciprocity VII - Dustin Clausen

Algorithms in algebraic number theory III - Hendrik Lenstra

Algorithms in algebraic number theory III - Hendrik Lenstra

Pt.4 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Pt.4 Supersingular Isogeny Graphs in Cryptography | Kristin Lauter, Meta (Facebook)

Inverse Galois Problem III - Tim Dokchitser

Inverse Galois Problem III - Tim Dokchitser

Hilbert Reciprocity VI - Dustin Clausen

Hilbert Reciprocity VI - Dustin Clausen

Algorithms in algebraic number theory II - Hendrik Lenstra

Algorithms in algebraic number theory II - Hendrik Lenstra

Hilbert Reciprocity V - Dustin Clausen

Hilbert Reciprocity V - Dustin Clausen

Inverse Galois Problem II - Tim Dokchitser

Inverse Galois Problem II - Tim Dokchitser

Supersingular isogeny graphs in cryptography - Kristin Lauter

Supersingular isogeny graphs in cryptography - Kristin Lauter

Hilbert Reciprocity IV - Dustin Clausen

Hilbert Reciprocity IV - Dustin Clausen

Inverse Galois Problem - Tim Dokchitser

Inverse Galois Problem - Tim Dokchitser

Algorithms in algebraic number theory - Hendrik Lenstra

Algorithms in algebraic number theory - Hendrik Lenstra

Hilbert Reciprocity III - Dustin Clausen

Hilbert Reciprocity III - Dustin Clausen

Visualization for research and exposition - Ingrid Daubechies

Visualization for research and exposition - Ingrid Daubechies

Hilbert Reciprocity II - Dustin Clausen

Hilbert Reciprocity II - Dustin Clausen

Modular Origami - Glen Whitney

Modular Origami - Glen Whitney

Hilbert Reciprocity - Dustin Clausen

Hilbert Reciprocity - Dustin Clausen

The Mathematics of Wirebending - Vernelle Noel

The Mathematics of Wirebending - Vernelle Noel

The Mathematics of Wirebending - Vernelle Noel

The Mathematics of Wirebending - Vernelle Noel

The algebra and the arithmetic of quadratic forms VII - Akhil Mathew

The algebra and the arithmetic of quadratic forms VII - Akhil Mathew

Generating Geometry through Minimization and Play - Daniel Piker

Generating Geometry through Minimization and Play - Daniel Piker

Aspects of motivic cohomology - Matthew Morrow

Aspects of motivic cohomology - Matthew Morrow