English
Related papers

Related papers: Universal structures with forbidden homomorphisms

200 papers

Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. In this paper we introduce the notion of a subnormal map (the inclusion of a subnormal subgroup into a group being a basic prototype). We then consider factorizations…

Group Theory · Mathematics 2014-05-02 Emmanuel D. Farjoun , Yoav Segev

Let $M$ be a Fra\"{i}ss\'{e} structure (a countably infinite ultrahomogeneous structure). We refer to the class of structures embeddable in $M$ as the $\omega$-age of $M$. We consider the following two properties of $M$: we say that $M$ has…

Logic · Mathematics 2026-04-23 Rob Sullivan , Jeroen Winkel

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

Combinatorics · Mathematics 2023-07-11 Daniel Neuen

We provide a sufficient condition that ensures the nilpotency of endomorphisms universally of trace zero of Schur-finite objects in a category of homological type, i.e., a Q-linear tensor category with a tensor functor to super vector…

K-Theory and Homology · Mathematics 2011-05-02 Alessio Del Padrone , Carlo Mazza

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

It is well known that any model for derived manifolds must form a higher category. In this paper, we propose a universal property for this higher category, classifying it up to equivalence. Namely, the $\infty$-category $\mathbf{DMfd}$ of…

Algebraic Topology · Mathematics 2019-05-16 David Carchedi , Pelle Steffens

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under…

Combinatorics · Mathematics 2013-02-05 Lubomíra Balková , Edita Pelantová , Štěpán Starosta

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

Combinatorics · Mathematics 2024-08-15 Irene Heinrich , Eda Kaja , Pascal Schweitzer

We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…

Logic · Mathematics 2025-10-21 Adam Bartoš , Wiesław Kubiś

In some varieties of algebras one can reduce the question of finding most general unifiers (mgus) to the problem of the existence of unifiers that fulfill the additional condition called projectivity. In this paper we study this problem for…

Logic · Mathematics 2010-12-07 Katarzyna Słomczyńska

We discuss families of hypersurfaces with isolated singularities in projective space with the property that the sum of the ranks of the rational homotopy and the homology groups is finite. They represent infinitely many distinct homotopy…

Algebraic Geometry · Mathematics 2026-02-02 A. Libgober

In this paper, the set of all physical theories is represented by a countable collection of consequence operators. It is established that in the Grundlegend Structure, a nonstandard structure, there exists a function S such that for any…

General Physics · Physics 2007-05-23 Robert A. Herrmann

Voevodsky's univalence axiom is often motivated as a realization of the equivalence principle; the idea that equivalent mathematical structures satisfy the same properties. Indeed, in Homotopy Type Theory, properties and structures can be…

Logic in Computer Science · Computer Science 2022-11-15 Rafaël Bocquet

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

Logic · Mathematics 2016-08-04 Francis Adams , Douglas Cenzer

Various theorems on convergence of general space homeomorphisms are proved and, on this basis, theorems on convergence and compactness for classes of the so-called ring $Q$--homeomorphisms are obtained. In particular, it was established by…

Complex Variables · Mathematics 2012-08-21 Vladimir Ryazanov , Evgeny Sevost'yanov

A partial order is universal if it contains every countable partial order as a suborder. In 2017, Fiala, Hubi\v{c}ka, Long and Ne\v{s}et\v{r}il showed that every interval in the homomorphism order of graphs is universal, with the only…

Combinatorics · Mathematics 2022-01-26 Jan Hubička , Jaroslav Nešetřil , Pablo Oviedo , Oriol Serra

We study two classes of morphisms in infinite type: tamely presented morphisms and morphisms with coherent pullback. These are generalizations of finitely presented morphisms and morphisms of finite Tor-dimension, respectively. The class of…

Algebraic Geometry · Mathematics 2024-01-11 Sabin Cautis , Harold Williams

We introduce a framework for universal algebra in categories of relational structures given by finitary relational signatures and finitary or infinitary Horn theories, with the arity $\lambda$ of a Horn theory understood as a strict upper…

Category Theory · Mathematics 2021-07-09 Chase Ford , Stefan Milius , Lutz Schröder

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Computational Complexity · Computer Science 2025-11-19 Milan Rosko
‹ Prev 1 3 4 5 6 7 10 Next ›