English
Related papers

Related papers: Uniformly Super McDuff II$_1$ Factors

200 papers

We consider the notion of strong self-absorption for continuous actions of locally compact groups on the hyperfinite II$_1$-factor and characterize when such an action is tensorially absorbed by another given action on any separably acting…

Operator Algebras · Mathematics 2024-01-30 Gábor Szabó , Lise Wouters

We show that there are $\mathrm{II}_1$ factors $M$ and elementary embeddings $M \to M^{\mathcal{U}}$ which do not lift to sequences of UCP maps, and in fact $M$ can be chosen from any given elementary equivalence class. Furthermore, under…

Operator Algebras · Mathematics 2025-12-12 David Gao , David Jekel

We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…

High Energy Physics - Theory · Physics 2024-08-09 Dmitry Galakhov , Alexei Morozov , Nikita Tselousov

The theory of subfactors of groups, together with the associated notions of subindices and index stability for groupsandtheirsubsets, hasrecentlybeenintroducedandsystematicallydeveloped. Theseconceptsexhibitdeepconnections with additive…

Group Theory · Mathematics 2026-04-13 Mohammad Hadi Hooshmand

We call a von Neumann algebra with finite dimensional center a multifactor. We introduce an invariant of bimodules over $\rm II_1$ multifactors that we call modular distortion, and use it to formulate two classification results. We first…

Operator Algebras · Mathematics 2025-06-06 Marcel Bischoff , Ian Charlesworth , Samuel Evington , Luca Giorgetti , David Penneys

Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…

Optimization and Control · Mathematics 2018-12-04 Matthias Köppe , Jiawei Wang

Guionnet et al. gave a construction of a II_1 factor associated to a subfactor planar algebra. In this paper we define an unshaded planar algebra. To any unshaded planar algebra P we associate a finite von Neumann algebra M_P. We prove that…

Operator Algebras · Mathematics 2012-02-08 Arnaud Brothier

Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…

Number Theory · Mathematics 2025-09-09 José Cuevas Barrientos , Hector Pasten

We show that for every finite set of prime numbers S, there are at most finitely many singular moduli that are S-units. The key new ingredient is that for every prime number p, singular moduli are p-adically disperse. We prove analogous…

Number Theory · Mathematics 2023-09-07 Sebastián Herrero , Ricardo Menares , Juan Rivera-Letelier

This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of…

Logic in Computer Science · Computer Science 2021-03-25 Edward Hermann Haeusler

We prove that the spectrum of Van Douwen families is closed under singular limits. For any maximal eventually different family Raghavan defined in an associated ideal which measures how far the family is from being Van Douwen. Under CH we…

Logic · Mathematics 2026-02-25 Lukas Schembecker

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

Logic in Computer Science · Computer Science 2025-06-27 Amirhossein Akbar Tabatabai , Raheleh Jalali

We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…

Disordered Systems and Neural Networks · Physics 2007-05-23 N. Berger , C. Borgs , J. T. Chayes , R. M. D'Souza , R. D. Kleinberg

Let G_1,...,G_q be algebraic varieties over a finite field k. We show that, if q >1, the finiteness of the tensor product of G_1, ...,G_q as Mackey functors. We apply this to prove the finiteness of a relative Chow group and an abelian…

K-Theory and Homology · Mathematics 2013-04-04 Toshiro Hiranouchi

We consider the family of CIFSs of generalized complex continued fractions with a complex parameter space. This is a new interesting example to which we can apply a general theory of infinite CIFSs and analytic families of infinite CIFSs.…

Dynamical Systems · Mathematics 2020-02-27 Kanji Inui , Hikaru Okada , Hiroki Sumi

We extend a technique, originally due to the first author and Poonen, for proving cases of the Strong Uniform Boundedness Principle (SUBP) in algebraic dynamics over function fields of positive characteristic. The original method applied to…

Number Theory · Mathematics 2022-12-20 John R. Doyle , Xander Faber

We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…

Logic · Mathematics 2025-07-11 Kai Ino , Omar Leon Sanchez

On page 43 in \cite{Po83} Sorin Popa asked whether the following property holds: \emph{If $\omega$ is a free ultrafilter on $\mathbb N$ and $\mathcal R_1\subseteq \mathcal R$ is an irreducible inclusion of hyperfinite II$_1$ factors such…

Operator Algebras · Mathematics 2018-04-19 Ionut Chifan , Sayan Das

We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…

Combinatorics · Mathematics 2015-10-29 Anna E. Frid

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

Logic · Mathematics 2022-02-25 Jeffrey Bergfalk , Vera Fischer , Corey Bacal Switzer