Related papers: Ordering groups and validity in lattice-ordered gr…
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…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
For every finitely generated free group we construct an explicit left order extending the lexicographic order on the free monoid generated by the positive letters. The order is defined by a left, free action on the orbit of 0 of a free…
Extending pioneering work by Weinberg, Conrad, McCleary, and others, we provide a systematic way of relating spaces of right orders on a partially ordered group, on the one hand, and spectral spaces of free lattice-ordered groups, on the…
This thesis explores how concepts of formal language theory can be used to study left-orderable groups. It analyses the languages formed by their positive cones and demonstrates how the abstract families of languages (AFLs) in the Chomsky…
We prove that the isomorphism type of the subrack lattice of a finite group determines the nilpotence class. We analyze the problem of estimating the orders of the group elements corresponding to the atoms of the subrack lattice. As a…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…
A number of research articles have established the significant role of lattice-ordered groups (l-groups) in logic. The purpose of the present article is to lay the groundwork for, and provide significant initial contributions to, the…
We prove that an inverse-free equation is valid in the variety LG of lattice-ordered groups (l-groups) if and only if it is valid in the variety DLM of distributive lattice-ordered monoids (distributive l-monoids). This contrasts with the…
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…
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…
A regular left-order on finitely generated group $G$ is a total, left-multiplication invariant order on $G$ whose corresponding positive cone is the image of a regular language over the generating set of the group under the evaluation map.…
We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…
We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.