English
Related papers

Related papers: Definable expansions on countable groups and count…

200 papers

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

In 1981, Andr\'e Joyal provided a combinatorial interpretation of the algebra of formal power series, a central gadget in the toolkit of enumerative combinatorics. In Joyal's theory of species of structures, combinatorial species (like…

Combinatorics · Mathematics 2023-06-07 Arthur Gonçalves Fidalgo

In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…

Representation Theory · Mathematics 2018-05-22 Eivind Eriksen

We give, for each countable ordinal $\xi \geq 1$, an example of a ${\bf\Delta}^0_2$ countable union of Borel rectangles that cannot be decomposed into countably many ${\bf\Pi}^0_\xi$ rectangles. In fact, we provide a graph of a partial…

Logic · Mathematics 2013-08-22 Dominique Lecomte , Miroslav Zeleny

We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of…

Logic · Mathematics 2024-09-23 Danielle Ulrich

This is a sequel to our paper "Permute, Graph, Map, Derange", involving decomposable combinatorial labeled structures in the exp-log class of type a=1/2, 1, 3/2, 2. As before, our approach is to establish how well existing theory matches…

Combinatorics · Mathematics 2022-01-25 Steven Finch

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

Group Theory · Mathematics 2017-01-09 Florent Jouve , Jean-Sébastien Sereni

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

Combinatorics · Mathematics 2025-06-03 Arkabrata Ghosh , Sayan Goswami , Sourav Kanti Patra

Consider a definable complete d-minimal expansion $(F, <, +, \cdot, 0, 1, \dots,)$ of an oredered field $F$. Let $X$ be a definably compact definably normal definable $C^r$ manifold and $2 \le r <\infty$. We prove that the set of definable…

Logic · Mathematics 2024-08-28 Masato Fujita , Tomohiro Kawakami

In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…

Logic · Mathematics 2026-03-03 Alberto Marcone , Antonio Montalbán , Andrea Volpi

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

Combinatorics · Mathematics 2008-04-01 Martin Klazar

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

Logic · Mathematics 2026-03-23 Mahmood Etedadialiabadi , Su Gao , Feng Li , Ruiwen Li

Let $C,A$ be countable abelian groups. In this paper we determine the complexity of classifying extensions $C$ by $A$, in the cases when $C$ is torsion-free and $A$ is a $p$-group, a torsion group with bounded primary components, or a free…

Commutative Algebra · Mathematics 2025-06-24 Martino Lupini

This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.

Logic · Mathematics 2020-07-02 William Chan

We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…

Logic · Mathematics 2015-12-16 Pedro Sánchez Terraf

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Logic · Mathematics 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

We describe the role of algebraic extensions in the theory of commutative, unital normed algebras, with special attention to uniform algebras. We shall also compare these constructions and show how they are related to each other.

Functional Analysis · Mathematics 2007-05-23 Thomas William Dawson

We develop a representation theory of categories as a means to explore characteristic structures in algebra. Characteristic structures play a critical role in isomorphism testing of groups and algebras, and their construction and…

Group Theory · Mathematics 2025-11-20 Peter A. Brooksbank , Heiko Dietrich , Joshua Maglione , E. A. O'Brien , James B. Wilson

In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our…

Formal Languages and Automata Theory · Computer Science 2016-02-11 Michel Rigo