Related papers: Elementary Complexity and von Neumann Algebras
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We use continuous model theory to obtain several results concerning isomorphisms and embeddings between II_1 factors and their ultrapowers. Among other things, we show that for any II_1 factor M, there are continuum many nonisomorphic…
We show that a free product of a II_1-factor and a finite von Neumann algebra with amalgamation over a finite dimensional subalgebra is always a II_1-factor, and provide an algorithm for describing it in terms of free products (with…
In the 1970s, Feldman and Moore classified separably acting von Neumann algebras containing Cartan MASAs using measured equivalence relations and 2-cocycles on such equivalence relations. In this paper, we give a new classification in terms…
Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…
In this work we study Schatten-von Neumann classes of tensor products of invariant operators on Hilbert spaces. In the first part we first deduce some spectral properties for tensors of anharmonic oscillators thanks to the knowledge on…
We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…
We define a notion of complexity, which quantifies the nonlinearity of the computation of a neural network, as well as a complementary measure of the effective dimension of feature representations. We investigate these observables both for…
Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
Although the interpretation of complexity in extended theories of gravity is available in the literature, its illustration in $f(R,L_{m},\mathcal{T})$ theory is still ambiguous. The orthogonal decomposition of the Riemann tensor results in…
Tropical implicitization means computing the tropicalization of a unirational variety from its parametrization. In the case of a hypersurface, this amounts to finding the Newton polytope of the implicit equation, without computing its…
We characterize in terms of inequalities the possible generalized singular numbers of a product AB of operators A and B having given generalized singular numbers, in an arbitrary finite von Neumann algebra. We also solve the analogous…
We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$_1$-factors named $\mathcal{C}_{\rm Rigid}$. For von Neumann algebras in this class we show a unique…