Publication

Computer-assisted proof of kernel inequalities

Name: Computer-assisted proof of kernel inequalities
Published: 2023

Maryna Viazovska
2023
Datasets

Abstract

This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, Miller, Radchenko, and Viazovska). It includes both our original proof using Mathematica and a revised proof using Sage.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Computer-assisted proof of kernel inequalities

Chat with Graph Search

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus

Interpolation and Quantifiers in Ortholattices

Non-planarity of Markoff graphs mod p