English
Related papers

Related papers: On polymorphism-homogeneous relational structures …

200 papers

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

2-Theories are a canonical way of describing categories with extra structure. 2-theory-morphisms are used when discussing how one structure can be replaced with another structure. This is central to categorical coherence theory. We place a…

Category Theory · Mathematics 2007-05-23 Noson S. Yanofsky

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

Combinatorics · Mathematics 2010-11-19 Robert Gray , Dugald Macpherson , Cheryl E. Praeger , Gordon F. Royle

We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…

Combinatorics · Mathematics 2013-11-21 Matthias Hamann

Let $G$ and $H$ be locally compact groups with fixed two-side-invariant Haar measures. A polyhomomorphism $G\to H$ is a closed subgroup $R\subset G\times H$ with a fixed Haar measure, whose marginals on $G$ and $H$ are dominated by the Haar…

Functional Analysis · Mathematics 2021-05-25 Yury A. Neretin

Two graphs $G$ and $H$ are homomorphism indistinguishable over a class of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphisms from $F$ to $H$. Many…

Combinatorics · Mathematics 2024-02-07 Tim Seppelt

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

Combinatorics · Mathematics 2011-04-01 Kari Ragnarsson , Bridget Eileen Tenner

Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…

Statistics Theory · Mathematics 2013-12-03 Frédéric Chazal , Brittany Terese Fasy , Fabrizio Lecci , Alessandro Rinaldo , Larry Wasserman

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

Quantum Physics · Physics 2026-04-21 Tim Seppelt , Gian Luca Spitzer

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

Probability · Mathematics 2023-07-04 Yue Liu

In [1] we defined a new kind of space called 'structured space' which locally resembles, near each of its points, some algebraic structure. We noted in the conclusion of the cited paper that the maps $f_s$ and $h$, which are of great…

Algebraic Topology · Mathematics 2020-04-27 Manuel Norman

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

Algebraic Topology · Mathematics 2014-07-02 Alexander Grigor'yan , Yong Lin , Yuri Muranov , Shing-Tung Yau

The concept of an omnigenous locally finite group was introduced in [2] as a generalization of Hall's universal countable locally finite group. In this paper we show that the class of all countable omnigenous locally finite groups is Borel…

Logic · Mathematics 2025-09-17 Su Gao , Feng Li

Let $V$ be a finite relational vocabulary in which no symbol has arity greater than 2. Let $M$ be countable $V$-structure which is homogeneous, simple and 1-based. The first main result says that if $M$ is, in addition, primitive, then it…

Logic · Mathematics 2015-07-28 Vera Koponen

We generalize to the homotopy case a result of K. Mackenzie and P. Xu on relation between Lie bialgebroids and Poisson geometry. For a homotopy Poisson structure on a supermanifold $M$, we show that $(TM, T^*M)$ has a canonical structure of…

Differential Geometry · Mathematics 2019-09-12 Theodore Voronov

A homogeneous symmetric structure on an associative superalgebra A is a non-degenerate, supersymmetric, homogeneous (i.e. even or odd) and associative bilinear form on A. In this paper, we show that any associative superalgebra with non…

Rings and Algebras · Mathematics 2010-11-15 Imen Ayadi , Saïd Benayadi

The complex projective structures considered is this article are compact curves locally modeled on $\mathbb{CP}^1$. To such a geometric object, modulo marked isomorphism, the monodromy map associates an algebraic one: a representation of…

Differential Geometry · Mathematics 2025-08-28 Titouan Sérandour

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

Rings and Algebras · Mathematics 2015-07-31 Rajesh S. Kulkarni , Yusuf Mustopa , Ian Shipman

A quasihomomorphism is a map that satisfies the homomorphism relation up to bounded error. Fujiwara and Kapovich proved a rigidity result for quasihomomorphisms taking values in discrete groups, showing that all quasihomomorphisms can be…

Group Theory · Mathematics 2026-03-04 Sami Douba , Francesco Fournier-Facio , Sam Hughes , Simon Machado

The task of computing homomorphisms between two finite relational structures $\mathcal{A}$ and $\mathcal{B}$ is a well-studied question with numerous applications. Since the set $\operatorname{Hom}(\mathcal{A},\mathcal{B})$ of all…

Data Structures and Algorithms · Computer Science 2023-05-29 Christoph Berkholz , Harry Vinall-Smeeth