Related papers: Extrapolation and Factorization
Quantitatively explaining the strength of arguments under gradual semantics has recently received increasing attention. Specifically, several works in the literature provide quantitative explanations by computing the attribution scores of…
These are the notes of the three lectures I delivered at the mini-workshop "Knot Theory and Number Theory around the A-Polynomial" at the Instituto Superior Tecnico (IST) in Lisbon in January 2014. The goal of the lectures was to…
This article is based on recent works done in collaboration with M. Mintchev, E. Ragoucy and P. Sorba. It aims at presenting the latest developments in the subject of factorization for integrable field theories with a reflecting and…
These are lecture notes of a course taken in Leipzig 2023, spring semester. It deals with extremal combinatorics, algebraic methods and combinatorial geometry. These are not meant to be exhaustive, and do not contain many proofs that were…
These lecture notes have been developed for the course Computational Social Choice of the Artificial Intelligence MSc programme at the University of Groningen. They cover mathematical and algorithmic aspects of voting theory.
This is (the English translation of) a lecture given at a one day conference in memory of F. Bruhat held at the Institut Poincar\'e, Paris. We discuss the history and significance of the Bruhat decomposition of a reductive group.
Jones and Boston conjectured that the factorization process for iterates of irreducible quadratic polynomials over finite fields is approximated by a Markov model. In this paper, we find unexpected and intricate behavior for some quadratic…
The present text provides the lecture notes for the course "noise sensitivity and percolation" given at the 2010 Clay Summer School in Buzios, Brazil.
This paper is a set of lecture notes of my course "Special functions, KZ type equations, and representation theory" given at MIT during the spring semester of 2002. The notes do not contain new results, and are an exposition (mostly without…
Physically relevant field-theoretic quantities are usually derived from perturbation techniques. These quantities are solved in the form of an asymptotic series in powers of small perturbation parameters related to the physical system, and…
These notes were originally prepared as additional material for the lessons I have given at the summer school Gamma-ray Astrophysics and Multifrequency: Data analysis and astroparticle problems, organized by the Department of Physics of the…
Informal lecture notes with examples on sheaf theory and the derived category of sheaves; sheaves and Morse theory; perverse sheaves, and some applications to representation theory. Added Oct 2021: cellular perverse sheaves. Proofs are…
These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of poset topology. These notes include introductory material, as well as recent developments and open problems. Some…
We perform an extrapolative analysis of "fast-growth" free-energy-difference (DF) estimates of a computer-modeled, fully-solvated ethane<->methanol transformation. The results suggest that extrapolation can greatly reduce the systematic…
These are extended lecture notes of a PhD course that the author gave at the Universita degli studi di Torino in Italy in spring 2013.
The alignment of large language models with human values presents a critical challenge, particularly when balancing conflicting objectives like helpfulness and harmlessness. Existing approaches, such as Reinforcement Learning from Human…
These are notes from a three-lecture mini-course on free probability given at MSRI in the Fall of 2010 and repeated a year later at Harvard. The lectures were aimed at mathematicians and mathematical physicists working in combinatorics,…
These notes contain an introduction to proofs of Farrell-Jones Conjecture for some groups and are based on talks given in Ohio, Oxford, Berlin, Shanghai, M\"unster and Oberwolfach in 2011 and 2012.
The probabilistic learning on manifolds (PLoM) introduced in 2016 has solved difficult supervised problems for the ``small data'' limit where the number N of points in the training set is small. Many extensions have since been proposed,…
Scribe notes from the 2012 Barbados Workshop on Computational Complexity. A series of lectures on Analysis of Boolean Functions by Ryan O'Donnell, with a guest lecture by Per Austrin.