English
Related papers

Related papers: Definable expansions on countable groups and count…

200 papers

We show that every basis for the countable Borel equivalence relations strictly above $\mathbb{E}_0$ under measure reducibility is uncountable, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push many…

Logic · Mathematics 2020-02-25 Clinton T. Conley , Benjamin D. Miller

Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…

Combinatorics · Mathematics 2021-03-09 István Mezo , Victor H. Moll , José L. Ramírez , Diego Villamizar

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

Logic · Mathematics 2020-01-09 Samuel Coskey , Paul Ellis

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

Logic · Mathematics 2024-07-16 Michael C. Laskowski , Danielle S. Ulrich

It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…

Category Theory · Mathematics 2015-11-25 Dragan Masulovic , Lynn Scow

We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $\lambda$ of countable confinality. Somewhat unexpectedly, the resulting theory is…

Logic · Mathematics 2025-11-21 Vincenzo Dimonte , Luca Motto Ros

We explore the geometric notion of prolongations in the setting of computational algebra, extending results of Landsberg and Manivel which relate prolongations to equations for secant varieties. We also develop methods for computing…

Commutative Algebra · Mathematics 2008-04-03 Jessica Sidman , Seth Sullivant

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…

Logic · Mathematics 2017-08-11 Dino Rossegger

We develop the theory of categories of measurable fields of Hilbert spaces and bounded fields of bounded operators. We examine classes of functors and natural transformations with good measure theoretic properties, providing in the end a…

Category Theory · Mathematics 2007-05-23 D. N. Yetter

We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…

Logic · Mathematics 2019-10-02 Pantelis E. Eleftheriou , Ayhan Günaydin , Philipp Hieronymi

We analyze in full mathematical rigor the most general quartically perturbed invariant probability measure for a random tensor. Using a version of the Loop Vertex Expansion (which we call the mixed expansion) we show that the cumulants…

Mathematical Physics · Physics 2015-06-15 Razvan Gurau

We extend the study of \emph{melonic} quartic tensor models to models with arbitrary quartic interactions. This extension requires a new version of the loop vertex expansion using several species of intermediate fields and iterated…

High Energy Physics - Theory · Physics 2017-06-26 Thibault Delepouve , Razvan Gurau , Vincent Rivasseau

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

Logic · Mathematics 2013-05-14 Luca Motto Ros

Borel summable semiclassical expansions in 1D quantum mechanics are considered. These are the Borel summable expansions of fundamental solutions and of quantities constructed with their help. An expansion, called topological,is constructed…

Quantum Physics · Physics 2008-11-26 Stefan Giller

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

Logic · Mathematics 2018-02-08 Filippo Calderoni , Luca Motto Ros

We show that every countable Borel equivalence relation structurable by $n$-dimensional contractible simplicial complexes embeds into one which is structurable by such complexes with the further property that each vertex belongs to at most…

Logic · Mathematics 2017-09-22 Ruiyuan Chen

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Rings and Algebras · Mathematics 2019-10-31 Juan Orendain

We study Borel systems and continuous systems of measures, with a focus on mapping properties: compositions, liftings, fibred products and disintegration. Parts of the theory we develop can be derived from known work in the literature, and…

Functional Analysis · Mathematics 2011-01-19 Aviv Censor , Daniele Grandini

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…