English
Related papers

Related papers: Disjoint $n$-amalgamation and pseudofinite countab…

200 papers

We construct classes of ${\cal N}=1$ superconformal theories elements of which are labeled by punctured Riemann surfaces. Degenerations of the surfaces correspond, in some cases, to weak coupling limits. Different classes are labeled by two…

High Energy Physics - Theory · Physics 2015-07-22 Davide Gaiotto , Shlomo S. Razamat

The goal of this paper is threefold. First, we describe the notion of dissociation for closed subgroups of the group of permutations on a countably infinite set and explain its numerous consequences on unitary representations…

Group Theory · Mathematics 2026-04-28 Rémi Barritault , Colin Jahel , Matthieu Joseph

In this paper we show that every non-cycle finite transitive directed graph has a Cuntz-Krieger family whose WOT-closed algebra is $B(\mathcal{H})$. This is accomplished through a new construction that reduces this problem to in-degree…

Operator Algebras · Mathematics 2020-08-25 Adam Dor-On , Christopher Linden

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

Logic · Mathematics 2025-09-05 Nicolás Sevilla Simón

We classify four-dimensional $\mathcal{N}=1$ supersymmetric gauge theories with a simple gauge group admitting a large $N$ limit that flow to non-trivial superconformal fixed points in the infrared. We focus on the cases where the large $N$…

High Energy Physics - Theory · Physics 2025-10-23 Minseok Cho , Ki-Hong Lee , Jaewon Song

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

The theory of associative $n$-categories has recently been proposed as a strictly associative and unital approach to higher category theory. As a foundation for a proof assistant, this is potentially attractive, since it has the potential…

Logic in Computer Science · Computer Science 2022-05-19 Lukas Heidemann , David Reutter , Jamie Vicary

Let N be a simply connected, connected real nilpotent Lie group of finite dimension n. We study subgroups $\Gamma$ in $\Aff (N)=N\rtimes \Aut (N)$ acting properly discontinuously and cocompactly on N. This situation is a natural…

Differential Geometry · Mathematics 2007-05-23 Dietrich Burde , Karel Dekimpe , Sandra Deschamps

Recent progress building on the groundbreaking work of Mabillard and Wagner has shown that there are important differences between the affine and continuous theory for Tverberg-type results. These results aim to describe the intersection…

Combinatorics · Mathematics 2017-02-20 Florian Frick

We prove the global triangulation conjecture for families of refined p-adic representations under a mild condition. That is, for a refined family, the associated family of (phi, Gamma)-modules admits a global triangulation on a Zariski open…

Number Theory · Mathematics 2016-02-29 Ruochuan Liu

In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…

Logic in Computer Science · Computer Science 2008-10-16 Viorica Sofronie-Stokkermans

We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…

Logic in Computer Science · Computer Science 2025-11-24 Benjamin Przybocki , Guilherme V. Toledo , Yoni Zohar

We study expansions of NSOP$_1$ theories that preserve NSOP$_1$. We prove that if $T$ is a model complete NSOP$_1$ theory eliminating the quantifier $\exists^{\infty}$, then the generic expansion of $T$ by arbitrary constant, function, and…

Logic · Mathematics 2018-09-18 Alex Kruckman , Nicholas Ramsey

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…

Logic · Mathematics 2025-10-01 Ali Enayat , Mateusz Łełyk , Albert Visser

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

Functional Analysis · Mathematics 2018-06-29 Krzysztof C. Ciesielski , Juan B. Seoane Sepúlveda

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We…

Logic · Mathematics 2023-09-14 Vince Guingona , Miriam Parnes , Lynn Scow

Let $Z\subset\mathbb{C}^N$ be an $n$-pseudoconcave subset, for $1\leq n<N$, which is locally the graph of a continuous function over a closed subset of $\mathbb{C}^n\times\mathbb{R}$. We show that $Z$ can be realised as the disjoint union…

Complex Variables · Mathematics 2026-03-31 Filippo Valnegri

We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…

Logic · Mathematics 2021-04-08 Sy-David Friedman , Dan Hathaway

The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Johannes Greiner , Jakub Rydval