Related papers: Structures preserved by primitive actions of $S_\o…

For $n\geq 3$, let $(H_n, E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all…

We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…

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…

We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…

We study the complexity of the valued constraint satisfaction problem (VCSP) for every valued structure with the domain ${\mathbb Q}$ that is preserved by all order-preserving bijections. Such VCSPs will be called temporal, in analogy to…

We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying…

We are interested in semigroups of the form $\langle G,a\rangle\setminus G$, where $G$ is a permutation group of degree $n$ and $a$ a non-permutation on the domain of $G$. A theorem of the first author, Mitchell and Schneider shows that, if…

We study techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems. For certain fundamental algebraic structures Delta, we prove definability dichotomy theorems of the following form: for every…

Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way. Problems of this type are well studied for…

Let $k$ be a field, and suppose that $\Gamma$ is a smooth $k$-group that acts on a connected, reductive $k$-group $\widetilde G$. Let $G$ denote the maximal smooth, connected subgroup of the group of $\Gamma$-fixed points in $\widetilde G$.…

Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…

Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…

Let $K_{exp+}$ be the class of all structures $A$ such that the automorphism group of $A$ has at most $c n^{d n}$ orbits in its componentwise action on the set of $n$-tuples with pairwise distinct entries, for some constants $c,d$ with $d <…

Let $k = \mathbb{F}_p$ or $\mathbb{Z}_p$ (or finite extensions of these). Let $G$ be a $p$-valuable group, and form its completed group algebra $kG$. By analysing the conjugation action of $G$ on itself, we prove two structural results.…

In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. In the context of moving autonomous agent formations,…

Primitive positive constructions have been introduced in recent work of Barto, Opr\v{s}al, and Pinsker to study the computational complexity of constraint satisfaction problems. Let $\mathfrak P_{\operatorname{fin}}$ be the poset which…

If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…

There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…

We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…

The main goal of this note is to provide evidence that the first rational homology of the Johnson subgroup $K_{g,1}$ of the mapping class group of a genus g surface with one marked point is finite-dimensional. Building on work of…