The subjects of convex and algebraic geometry meet primarily in the theory of toric varieties. Toric geometry is the part of algebraic geometry where all maps are given by monomials in suitable coordinates, and all equations ...

The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of algorithms ...

The past 30 years have not only seen substantial progress and lively activity in various areas within convex geometry, e.g., in asymptotic geometric analysis, valuation theory, the $L_p$-Brunn-Minkowski theory and stochastic ...

We investigate convolution operators in the sequence spaces $d_p$, for 1 $\leqslant p<\infty$. These spaces, for $p$ > 1, arise as dual spaces of the Cesàro sequence spaces $ces_p$ thoroughly investigated by G. Bennett. A ...

A real matrix $A$ is called copositive if $x^TAx \ge 0$ holds for all $x \in \mathbb R^n_+$. A matrix $A$ is called completely positive if it can be factorized as $A = BB^T$ , where $B$ is an entrywise nonnegative matrix. ...

Random quantum systems cover a broad range of mathematical models from random Schrödinger operators to random matrices and quantum spin models with random parameters. Their understanding requires techniques which combine ...

In how many ways can you go for a walk along a lattice grid in such a way that you never meet your own trail? In this snapshot, we describe some combinatorial and statistical aspects of these so-called self-avoiding ...

We consider functions defined on an open subset of a nonsingular, either real or complex, algebraic set. We give criteria for an analytic function to be a Nash (resp. regular, resp. polynomial) function. Our criteria depend ...

The Oberwolfach workshop Cryptography brought together scientists from cryptography with mathematicians specializing in the algorithmic problems underlying cryptographic security. The goal of the workshop was to stimulate ...