English
Related papers

Related papers: Voiculescu's Theorem in Properly Infinite Factors

200 papers

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

Computational Complexity · Computer Science 2018-11-13 Iddo Tzameret , Stephen A. Cook

We study the nature of applicative bisimilarity in $\lambda$-calculi endowed with operators for sampling from continuous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide…

Logic in Computer Science · Computer Science 2022-07-22 Gilles Barthe , Raphaëlle Crubillé , Ugo Dal Lago , Francesco Gavazzo

It is shown that the countably infinite dimensional pointed vector space (the vector space equipped with a constant) over a finite field has infinitely many first order definable reducts. This implies that the countable homogeneous…

Logic · Mathematics 2021-04-06 Bertalan Bodor , Peter J. Cameron , Csaba Szabó

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…

Logic in Computer Science · Computer Science 2021-06-15 Ana Sokolova , Harald Woracek

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable…

Logic · Mathematics 2011-07-20 Isaac Goldbring

In two and three dimensions, we analyze a finite element method to approximate the solutions of an eigenvalue problem arising from neutron transport. We derive the eigenvalue problem of interest, which results to be non-symmetric. Under a…

Numerical Analysis · Mathematics 2025-10-08 Nicolás A. Barnafi , Felipe Lepe , Francisca Muñoz Riquelme

We study certain integer valued length functions on triangulated categories and establish a correspondence between such functions and cohomological functors taking values in the category of finite length modules over some ring. The…

Representation Theory · Mathematics 2013-05-22 Henning Krause

We present an alternative organizational scheme for developing effective theories of 2- and 3-body systems that is systematic, accurate, and efficient with controlled errors. To illustrate our approach we consider the bound state and…

Nuclear Theory · Physics 2009-09-08 J. R. Shepard , J. A. McNeil

We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…

Logic · Mathematics 2018-08-23 Vasco Brattka , Guido Gherardi , Rupert Hölzl , Arno Pauly

We characterise absolutely dilatable completely positive maps on the space of all bounded operators on a Hilbert space that are also bimodular over a given von Neumann algebra as rotations by a suitable unitary on a larger Hilbert space…

Operator Algebras · Mathematics 2025-04-25 Alexandros Chatzinikolaou , Ivan G. Todorov , Lyudmila Turowska

Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…

Complex Variables · Mathematics 2024-08-06 Stephen Deterding

Building on the work of \.{I}nan and of Almahariq--Peters--Vergili, we develop an axiomatic framework for approximate algebra based on an algebra-compatible closure operator $\Phi^{\!*}$ on a unital ring. The operator is assumed to be…

Commutative Algebra · Mathematics 2026-04-29 Dang Vo Phuc

We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…

Logic · Mathematics 2025-07-11 Quentin Le Houérou , Ludovic Patey

A uniformly continuously integrable sequence of real-valued measurable functions, defined on some probability space, is relatively compact in the $\sigma(L^1,L^\infty)$ topology. In this paper, we link such a result to weak convergence…

Functional Analysis · Mathematics 2021-08-10 Gane Samb Lo , Aladji Babacar Niang

We derive a posteriori error estimators for an optimal control problem governed by a convection-reaction-diffusion equation; control constraints are also considered. We consider a family of low-order stabilized finite element methods to…

Numerical Analysis · Mathematics 2017-04-24 Alejandro Allendes , Enrique Otarola , Richard Rankin

We study the question how quickly products of a fixed conjugacy class in the projective unitary group of a II${}_1$-factor von Neumann algebra cover the entire group. Our result is that the number of factors that are needed is essentially…

Operator Algebras · Mathematics 2015-08-13 Philip A. Dowerk , Andreas Thom

We give a necessary and sufficient condition for symmetric infinitely divisible distribution to have Gaussian component. The result can be applied to approximation the distribution of finite sums of random variables. Particularly, it shows…

Probability · Mathematics 2015-08-25 Lev B. Klebanov , Irina V. Volchenkova , Ashot V. Kakosyan

We expand our effective framework for weak convergence of measures on the real line by showing that effective convergence in the Prokhorov metric is equivalent to effective weak convergence. In addition, we establish a framework for the…

Logic · Mathematics 2021-11-05 Diego A. Rojas

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Data Structures and Algorithms · Computer Science 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Logic · Mathematics 2021-11-02 Juvenal Murwanashyaka