Related papers: The Solution of the Kadison-Singer Problem
The Promise Constraint Satisfaction Problem (PCSP) is a recently introduced vast generalization of the Constraint Satisfaction Problem (CSP). We investigate the computational complexity of a class of PCSPs beyond the most studied cases -…
We review two-dimensional QCD. The report contains: 1. Introduction. 2. QCD$_2$ as a field theory 2.1 The 1/N expansion and spectrum, 2.2 Ambiguity in the self-energy of the quark, 2.3 Polyakov--Wiegmann formula and gauge interactions, 2.4…
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. (The…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
This paper investigates two classes of quasilinear and essentially nonlinear integral equations with a sum-difference kernel on the half-line. Such equations arise in various areas of physics, including the theory of radiative transfer in…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
These are notes from a multi-year learning seminar on the algebraic approach to Constraint Satisfaction Problems (CSPs). The main topics covered are the theory of algebraic structures with few subpowers, the theory of absorbing subalgebras…
This is a survey on the use of low-degree polynomials to predict and explain the apparent statistical-computational tradeoffs in a variety of average-case computational problems. In a nutshell, this framework measures the complexity of a…
A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS problem, which arises naturally in many string-related…
Nowadays massive amount of data are available for analysis in natural and social systems. Inferring system structures from the data, i.e., the inverse problem, has become one of the central issues in many disciplines and interdisciplinary…
These are lectures notes for a 6 hour course given at PCMI, Park City, Utah, in the summer of 2003. The notes are based on a series of joint works of Kenig-Ponce-Vega. Each lecture had problems assigned with it. The lecture notes were…
One challenge (or opportunity!) that many instructors face is how varied the backgrounds, abilities, and interests of students are. In order to simultaneously instill confidence in those with weaker preparations and still challenge those…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
Cadences are complex structures that have been driving music from the beginning of contrapuntal polyphony until today. Detecting such structures is vital for numerous MIR tasks such as musicological analysis, key detection, or music…
Lately there have been novel developments in deep learning towards solving the cocktail party problem. Initial results are very promising and allow for more research in the domain. One technique that has not yet been explored in the neural…
In part I we introduced modified Landweber-Kaczmarz methods and have established a convergence analysis. In the present work we investigate three applications: an inverse problem related to thermoacoustic tomography, a nonlinear inverse…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
The aim of this lecture is to present the concept of C-algebra and to illustrate its applications in two contexts: the study of reflection groups and their folding on the one hand, the structure of rational conformal field theories on the…