English
Related papers

Related papers: An Improved Homomorphism Preservation Theorem From…

200 papers

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…

Logic in Computer Science · Computer Science 2021-07-01 Manuel Bodirsky , Thomas Feller , Simon Knäuer , Sebastian Rudolph

Let $A$ and $B$ be unital separable simple amenable \CA s which satisfy the Universal Coefficient Theorem. Suppose {that} $A$ and $B$ are $\mathcal Z$-stable and are of rationally tracial rank no more than one. We prove the following:…

Operator Algebras · Mathematics 2012-07-18 Huaxin Lin , Zhuang Niu

Let ${\mathfrak{X}}$ be a class of finite groups closed under taking subgroups, homomorphic images, and extensions. Denote by ${\mathrm{k}}_{\mathfrak{X}}(G)$ the number of conjugacy classes ${\mathfrak{X}}$-maximal subgroups of a finite…

Group Theory · Mathematics 2023-01-02 Wenbin Guo , Danila O. Revin

Let $\mathbf{X}$ be a class of metric spaces and let $\mathbf{P}_{\mathbf{X}}$ be the set of all $f:[0, \infty)\to [0, \infty)$ preserving $\mathbf{X},$ $(Y, f\circ\rho)\in\mathbf{X}$ whenever $(Y, \rho)\in\mathbf{X}.$ For arbitrary subset…

General Topology · Mathematics 2024-04-23 Viktoriia Bilet , Oleksiy Dovgoshey

For every compact, connected manifold $M$, we prove the existence of a sentence $\phi_M$ in the language of groups such that the homeomorphism group of another compact manifold $N$ satisfies $\phi_M$ if and only if $N$ is homeomorphic to…

Group Theory · Mathematics 2025-03-12 Sang-hyun Kim , Thomas Koberda , J. de la Nuez González

The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…

Combinatorics · Mathematics 2017-12-11 Jon Henry Sanders

An order-preserving Freiman 2-isomorphism is a map $\phi:X \rightarrow \mathbb{R}$ such that $\phi(a) < \phi(b)$ if and only if $a < b$ and $\phi(a)+\phi(b) = \phi(c)+\phi(d)$ if and only if $a+b=c+d$ for any $a,b,c,d \in X$. We show that…

Combinatorics · Mathematics 2016-11-28 Gagik Amirkhanyan , Albert Bush , Ernie Croot

Let $R\subset F$ be an extension of real closed fields and ${\mathcal S}(M,R)$ the ring of (continuous) semialgebraic functions on a semialgebraic set $M\subset R^n$. We prove that every $R$-homomorphism $\varphi:{\mathcal S}(M,R)\to F$ is…

Algebraic Geometry · Mathematics 2015-09-16 Jose F. Fernando

We give a proof, based on thermodynamic formalism, of a theorem in bounded cohomology extending a foundational result of Burger and Monod: if $\Gamma$ is an irreducible uniform lattice in a non-compact connected semisimple Lie group of real…

Dynamical Systems · Mathematics 2026-03-31 Pablo D. Carrasco , Federico Rodriguez-Hertz

Many computational problems can be modelled as the class of all finite structures $\mathbb A$ that satisfy a fixed first-order sentence $\phi$ hereditarily, i.e., we require that every (induced) substructure of $\mathbb A$ satisfies $\phi$.…

Logic · Mathematics 2025-07-04 Manuel Bodirsky , Santiago Guzmán-Pro

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

Logic · Mathematics 2026-02-12 Lucy Ham , Marcel Jackson

We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…

Computational Complexity · Computer Science 2018-09-26 Albert Atserias , Joanna Ochremiak

Topoi are categories which have enough structure to interpret higher order logic. They admit two notions of morphism: logical morphisms which preserve all of the structure and therefore the interpretation of higher order logic, and…

Logic · Mathematics 2013-05-15 Shawn J. Henry

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…

Data Structures and Algorithms · Computer Science 2015-03-19 Martin Grohe , Dániel Marx

Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…

Logic in Computer Science · Computer Science 2019-06-05 Albert Atserias , Szymon Toruńczyk

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

Logic · Mathematics 2018-03-20 Ludovic Patey , Keita Yokoyama

We give sufficient conditions for homotopical localization functors to preserve algebras over coloured operads in monoidal model categories. Our approach encompasses a number of previous results about preservation of structures under…

Algebraic Topology · Mathematics 2014-02-26 Carles Casacuberta , Javier J. Gutierrez , Ieke Moerdijk , Rainer M. Vogt

In this article, we prove that Ramsey's theorem for pairs and two colors is $\Pi^1_1$-conservative over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2 + \mathsf{WF}(\epsilon_0)$ and over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2 + \bigcup_n…

Logic · Mathematics 2024-08-30 Quentin Le Houérou , Ludovic Levy Patey , Keita Yokoyama

It is stated equicontinuity and normality of families $\frak{F}^{\Phi}$ of the so--called homeomorphisms with finite distortion on conditions that $K_{f}(z)$ has finite mean oscillation, singularities of logarithmic type or integral…

Complex Variables · Mathematics 2010-12-22 T. Lomako , R. Salimov , E. Sevost'yanov

Let $X \subset \mathbb{P}^{n}$ be a non-empty closed subscheme over an algebraically closed field $k$, and $\mathrm{J}^{[p]}(X) = \mathrm{J}(X,\mathrm{J}(X,\cdots,\mathrm{J}(X,X)\cdots)$ denote the $p$-fold iterated join of $X$ with itself.…

Algebraic Geometry · Mathematics 2020-09-03 Saugata Basu , Deepam Patel