Related papers: Order separability

This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…

The paper is a short survey of recent developments in the area of first order descriptions of linear groups. It is aimed to illuminate the known results and to pose the new problems relevant to logical characterizations of Chevalley groups…

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

We investigate the separability of arbitrary dimensional tripartite sys- tems. By introducing a new operator related to transformations on the subsystems a necessary condition for the separability of tripartite systems is presented.

The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Motivated by the recent result that left-orderability of a group $G$ is intimately connected to circular orderability of direct products $G \times \mathbb{Z}/n\mathbb{Z}$, we provide necessary and sufficient cohomological conditions that…

We study when the fiber product of groups with Property (T) has Property (T).

A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…

We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.

Measure free factors are a generalization of the notion of free factors of a group, in a measure theoretic context. We find new families of cyclic measure free factors of free groups and some virtually free groups, following a question by…

Every left-invariant ordering of a group is either discrete, meaning there is a least element greater than the identity, or dense. Corresponding to this dichotomy, the spaces of left, Conradian, and bi-orderings of a group are naturally…

In this paper we prove the theorem on freedom for free products with a single relation (analogous with the well-known result of Magnus) and a generalized Freiheitssatz for free products (analogous with the well-known result of Romanovski)

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…