Related papers: NIP omega-categorical structures: the rank 1 case

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…

It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…

We define nodal finite dimensional algebras and describe their structure over an algebraically closed field. For a special class of such algebras (type A) we find a criterion of tameness.

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…

Let $G$ be a finite primitive permutation group and let $\kappa(G)$ be the number of conjugacy classes of derangements in $G$. By a classical theorem of Jordan, $\kappa(G) \geqslant 1$. In this paper we classify the groups $G$ with…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if there exists a $G$-chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that $ | G…

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

We classify the finite primitive groups containing a permutation with at most four cycles (including fixed points) in its disjoint cycle representation.

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

This paper, written in 1998, aims to clarify various higher categorical structures, mostly through the theory of generalized operads and multicategories. Chapters I and II, which cover this theory and its application to give a definition of…

For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…

Let $p$ be a prime and let $\mathbb{C}$ be the complex field. We explicitly classify the finite solvable irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ up to conjugacy. That is, we give a complete and irredundant list of…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We explore two constructions of oligomorphic Jordan permutation groups preserving a `limit of betweenness relations' and a `limit of $D$-relations', from \cite{bhattmacph2006jordan} and \cite{almazaydeh2021jordan} respectively. Several…

We give an elementary classification and presentation of the finite quaternionic reflection groups of rank two, based on the notion of a``reflection system''. This simplifies the existing classification, which is shown to be incomplete,…

The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…