English
Related papers

Related papers: Cores of Countably Categorical Structures

200 papers

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil

A topological commutative ring is said to be rigid when for every set $X$, the topological dual of the $X$-fold topological product of the ring is isomorphic to the free module over $X$. Examples are fields with a ring topology, discrete…

Commutative Algebra · Mathematics 2018-08-21 Laurent Poinsot

The core of an ideal is defined as the intersection of all of its reductions. In this paper we provide an explicit description for the core of a monomial ideal $I$ satisfying certain residual conditions, showing that ${\rm core}(I)$…

Commutative Algebra · Mathematics 2023-03-21 Louiza Fouli , Jonathan Montaño , Claudia Polini , Bernd Ulrich

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C. Laskowski

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

Computational Complexity · Computer Science 2015-07-01 Manuel Bodirsky , Peter Jonsson , Timo von Oertzen

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Logic · Mathematics 2011-12-05 Sy-David Friedman , Luca Motto Ros

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

Logic in Computer Science · Computer Science 2025-10-10 Rémi Morvan

We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…

Computational Complexity · Computer Science 2016-04-27 Manuel Bodirsky , Victor Dalmau , Barnaby Martin , Antoine Mottet , Michael Pinsker

We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of…

Logic in Computer Science · Computer Science 2015-07-01 Hubie Chen , Moritz Müller

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

In this paper, we classify finite categories with two objects such that one of the endomorphism monoids is a group. We prove that having a group on one side affects the structure of the other endomorphism monoid, and we prove that it is…

Category Theory · Mathematics 2022-10-04 Najwa Ghannoum , Carlos Simpson

The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction to the class of all finite structures forms an interesting…

Logic in Computer Science · Computer Science 2024-02-15 Jakub Rydval , Žaneta Semanišinová , Michał Wrona

Let $R\subseteq E$ be two Lie conformal algebras and $Q$ be a given complement of $R$ in $E$. Classifying complements problem asks for describing and classifying all complements of $R$ in $E$ up to an isomorphism. It is known that $E$ is…

Rings and Algebras · Mathematics 2020-10-01 Yanyong Hong

In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…

Logic · Mathematics 2026-05-21 Dragan Mašulović , Veljko Toljić

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld

We start an analysis of geometric properties of a structure relative to a reduct. In particular, we look at definability of groups and fields in this context. In the relatively one-based case, every definable group is isogenous to a…

Logic · Mathematics 2013-05-22 Thomas Blossier , Amador Martin Pizarro , Frank Olaf Wagner

We solve a long standing open problem concerning the structure of finite cycles in the category mod A of finitely generated modules over an arbitrary artin algebra A, that is, the chains of homomorphisms $M_0 \stackrel{f_1}{\rightarrow} M_1…

Representation Theory · Mathematics 2015-04-02 Piotr Malicki , José Antonio de la Peña , Andrzej Skowroński

We devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fra\"{\i}ss\'{e} limit) embeds all countable semigroups. This approach provides us not only…

Group Theory · Mathematics 2014-03-10 Igor Dolinka , Dragan Mašulović

We prove that if two conformal embeddings between Riemann surfaces with finite topology are homotopic, then they are isotopic through conformal embeddings. Furthermore, we show that the space of all conformal embeddings in a given homotopy…

Complex Variables · Mathematics 2019-10-16 Maxime Fortier Bourque
‹ Prev 1 4 5 6 7 8 10 Next ›