Related papers: The Kadison-Singer Problem in Mathematics and Engi…

Let $X$ be a compact metric space, and let $A$ be a pure $\mathrm{C}^*$-algebra. We show that $C(X,A)$ is pure whenever $A$ is simple; or every quotient of $A$ is stably finite (e.g., $A$ has stable rank one). Using permanence properties of…

Examples of simple, separable, unital, purely infinite $C^*$--algebras are constructed, including: (1) some that are not approximately divisible; (2) those that arise as crossed products of any of a certain class of $C^*$--algebras by any…

From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…

Let G be a finite abelian group. We examine the discrepancy between subspaces of l^2(G) which are diagonalized in the standard basis and subspaces which are diagonalized in the dual Fourier basis. The general principle is that a Fourier…

Since its introduction by Gauss, Matrix Algebra has facilitated understanding of scientific problems, hiding distracting details and finding more elegant and efficient ways of computational solving. Today's largest problems, which often…

For a long time, practitioners of the art of operator algebras always worked over the complex numbers, and nobody paid much attention to real C*-algebras. Over the last thirty years, that situation has changed, and it's become apparent that…

Singularities appear in numerous important mathematical models used in Physics. And in most of such cases singularities are involved in essentially nonlinear contexts. For more than four decades, general enough nonlinear theories of…

In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that…

We consider a version of a famous open problem formulated by Kadison, asking whether bounded representations of operator algebras are automatically completely bounded. We investigate this question in the context of amenable operator…

In this paper we present some basic results of the Universal Algebra of $\mathcal{C}^\infty$-rings which were nowhere to be found in the current literature. The outstanding book of I. Moerdijk and G. Reyes,[24], presents the basic (and…

The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…

For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…

We consider problems associated with the computation of spectra of self-adjoint operators in terms of the eigenvalue distributions of their n x n sections. Under rather general circumstances, we show how these eigenvalues accumulate near…

The universal C*-algebra generated by n projections has been described. As an immediate corollary one obtains structure theorem for a pair of projections and the solution to an associated index problem. This puts the study of a pair of…

Wigner's "unreasonable effectiveness of mathematics" in physics can be understood as a reflection of a deep and unexpected unity between the fundamental structures of mathematics and of physics. Some of the history of evidence for this is…

Integration at a point is a new kind of integration derived from integration over an interval in infinitesimal and infinity domains which are spaces larger than the reals. Consider a continuous monotonic divergent function that is…

We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

The Paulsen Problem in Hilbert space frame theory has proved to be one of the most intractable problems in the field. We will help explain why by showing that this problem is equivalent to a fundamental, deep problem in operator theory.…

In this paper, we present a series of mathematical problems which throw interesting lights on flamenco music. More specifically, these are problems in discrete and computational mathematics suggested by an analytical (not compositional)…