Related papers: On groups with finitely many Conradian orderings

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate…

We determine the set of catenary degrees, the set of distances, and the unions of sets of lengths of the monoid of nonzero ideals and of the monoid of invertible ideals of orders in quadratic number fields.

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Let $G$ be a group. Two elements $x,y \in G$ are said to be in the same $z$-class if their centralizers in $G$ are conjugate within $G$. Consider $\mathbb F$ a perfect field of characteristic $\neq 2$, which has a non-trivial Galois…

We consider existentially closed fields with several orderings, valuations, and $p$-valuations. We show that these structures are NTP$_2$ of finite burden, but usually have the independence property. Moreover, forking agrees with dividing,…

We study the classification problem of singularities of function-germs with harmonic leading terms of two variables under the right-equivalence. We study the classification in the cases that the order of function-germs is at most 7.…

Let $S$ be a class of groups and let $f_S (n)$ be the number of isomorphism classes of groups in $S$ of order $n$. Let $f(n)$ count the number of groups of order $n$ up to isomorphism. The asymptotic bounds for $f(n)$ behave differently…

We prove that the full automorphism group and the outer automorphism group of the free group of countably infinite rank are coarsely bounded. That is, these groups admit no continuous actions on a metric space with unbounded orbits, and…

A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…

We study in this paper the remnants of the contact partial order on the orbits of the adjoint action of contactomorphism groups on their Lie algebras. Our main interest is a class of non-compact contact manifolds, called convex at infinity.

We characterize the order of principal congruences of a bounded lattice (also of a complete lattice and of a lattice of length 5) as a bounded ordered set. We also state a number of open problems in this new field.

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

Let W be a Coxeter group and L be a weight function on W. Following Lusztig, we have a corresponding decomposition of W into left cells, which have important applications in representation theory. We study the case where $W$ is an affine…

The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

We show that the Bruschlinsky group with the winding order is a homeomorphism invariant for a class of one-dimensional inverse limit spaces. In particular we show that if a presentation of an inverse limit space satisfies the Simplicity…

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…