Related papers: Nelson's Logical Diagrams
Around 1967, Arveson invented a striking noncommutative generalization of classical $H^\infty$, known as {\em subdiagonal algebras}, which include a wide array of examples of interest to operator theorists. Their theory extends that of the…
Surjective isometries between unital C*-algebras were classified in 1951 by Kadison. In 1972 Paterson and Sinclair handled the nonunital case by assuming Kadison's theorem and supplying some supplementary lemmas. Here we combine an…
This commentary reflects on the 1930 discoveries of L\'eon Rosenfeld in the domain of phase-space constraints. We start with a short biography of Rosenfeld and his motivation for this article in the context of ideas pursued by W. Pauli, F.…
Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two constructions are revisited and two new, block-diagonal hierarchies…
G. Godefroy and the second author of this note proved in 1988 that in duals to Asplund spaces there always exists a projectional resolution of the identity. A few years later, Ch. Stegall succeeded to drop from the original proof a deep…
In a highly influential paper, Bidigare, Hanlon and Rockmore showed that a number of popular Markov chains are random walks on the faces of a hyperplane arrangement. Their analysis of these Markov chains took advantage of the monoid…
While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…
We use the large deviation approach to sum rules pioneered by Gamboa, Nagel and Rouault to prove higher order sum rules for orthogonal polynomials on the unit circle. In particular, we prove one half of a conjectured sum rule of Lukic in…
Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of…
The notion of number line was formed in XX c. We consider the generation of this conception in works by M. Stiefel (1544), Galilei (1633), Euler (1748), Lambert (1766), Bolzano (1830-1834), Meray (1869-1872), Cantor (1872), Dedekind (1872),…
Generalized current algebras introduced by Alekseev and Strobl in two dimensions are reconstructed by a graded manifold and a graded Poisson brackets. We generalize their current algebras to higher dimensions. QP manifolds provide the…
We prove that the heavy symmetric top (Lagrange, 1788) linearizes on a two-dimensional non-compact algebraic group -- the generalized Jacobian of an elliptic curve with two points identified. This leads to a transparent description of its…
A fundamental paper of Elliott Lieb from 1973 has been the basis for much beautiful work on matrix inequalities by many people over the following years. We review a well-connected set of these developments. Some new proofs are provided.
We explore an (unpublished) approach to the famous Jacobian Conjecture by means of identities of algebras, discovered by the brilliant deceased mathematician, Alexander Vladimirovich Yagzhev (1951{2001). This approach also indicates some…
Newton, in notes that he would rather not have seen published, described a process for solving simultaneous equations that later authors applied specifically to linear equations. This method that Euler did not recommend, that Legendre…
The concept of a symplectic structure first appeared in the works of Lagrange on the so-called "method of variation of the constants". These works are presented, together with those of Poisson, who first defined the composition law called…
The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in the graph. Tymoczko extended this definition to faithful group actions on sets; taking the set to be the vertex…
The standard text-book Jacobi equation (equation of geodesic deviation) arises by linearizing the geodesic equation around some chosen geodesic, where the linearization is done with respect to the coordinates and the velocities. The…
We use a "reverse engineering" method, pioneered by George Andrews, to discover an explicit expression for the determinant of a certain tridiagonal matrix discussed by Derrick Henry Lehmer in 1974, that lead to OEIS sequence A039924. Lehmer…
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…