Previous Conferences & Workshops

We consider two classes of \(n \times n\) sample covariance matrices arising in quantum informatics. The first class consists of matrices whose data matrix has \(m\) independent columns each of which is the tensor product of \(k\) independent \(d\)...

I will explain how Pitman's theorem on Brownian motion and the three dimensional Bessel process can be extended to several dimensions, and the connection with random matrices, and combinatorial representation theory, notably the Littelmann path...

The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem are based on the arithmetization technique, which transforms a...

Constant mean curvature (CMC) tori in \(S^3\), \(R^3\) or \(H^3\) are in bijective correspondence with spectral curve data, consisting of a hyperelliptic curve, a line bundle on this curve and some additional data, which in particular determines the...

An error-correcting code is called locally decodable if there exists a decoding algorithm that can recover any symbol of the message with high probability by reading only a small number of symbols of the corrupted codeword. There is a fundamental...

The work of Green, Tao and Ziegler can be used to prove existence and approximation properties for rational solutions of the Diophantine equations that describe representations of a product of norm forms by a product of linear polynomials. One can...

In 1896, Frobenius obtained a remarkable character-theoretic formula for the number of solutions to the equation \(xyx^{-1}y^{-1}=g\), for any finite group \(G\) and element \(g \in G\). While more than a century has since passed, our understanding...