English
Related papers

Related papers: Left-orderable Computable Groups

200 papers

We show that there is a one-to-one correspondence between compact quantum subgroups of a co-amenable locally compact quantum group $\mathbb{G}$ and certain left invariant C*-subalgebras of $C_0(\mathbb{G})$. We also prove that every compact…

Operator Algebras · Mathematics 2012-01-25 Pekka Salmi

Our aim is to find some new links between linear (circular) orderability of groups and topological dynamics. We suggest natural analogs of the concept of algebraic orderability for topological groups involving order-preserving actions on…

Dynamical Systems · Mathematics 2022-09-29 Michael Megrelishvili

We classify left invariant metrics with nonnegative curvature on SO(3) and U(2).

Differential Geometry · Mathematics 2007-05-23 Nathan Brown , Rachel Finck , Matthew Spencer , Kristopher Tapp , Zhongtao Wu

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Logic in Computer Science · Computer Science 2017-04-11 Arno Pauly

A left order on a magma (e.g., semigroup) is a total order of its elements that is left invariant under the magma operation. A natural topology can be introduced on the set of all left orders of an arbitrary magma. We prove that this…

We define Conradian left-preorders and the space of Conradian left-preorders. We show that this space is either finite or uncountable. We describe conditions that are equivalent to say that the space of Conradian left-preorders is finite.…

Group Theory · Mathematics 2025-07-24 Iván Chércoles-Cuesta

We improve Algorithm 5.1 of [Math. Comp. {\bf 86} (2017), 2519-2534] for computing all non-isomorphic skew left braces, and enumerate left braces and skew left braces of orders up to 868 with some exceptions. Using the enumerated data, we…

Rings and Algebras · Mathematics 2020-08-11 Valeriy G. Bardakov , Mikhail V. Neshchadim , Manoj K. Yadav

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

Logic · Mathematics 2019-02-06 Samuel Coskey , Joel David Hamkins , Russell Miller

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Group Theory · Mathematics 2018-07-04 Matteo Cavaleri

We consider a class of non-locally compact groups on which one may define a left-invariant, finitely additive measure taking values in some finitely generated extension of the field $\mathbb{R}$ of real numbers. In particular, we recover…

Number Theory · Mathematics 2019-02-11 Raven Waller

For each n >1, we construct a left quantum group, i.e., a left Hopf algebra H generated by comatrix units X_{ij} and modeled after SL_q(n), which has a left antipode but no right antipode. The quantum special linear group SL_q(n) is a…

Quantum Algebra · Mathematics 2009-08-27 Aaron Lauve , Earl J. Taft

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

Logic · Mathematics 2018-11-06 Rumen Dimitrov , Valentina Harizanov , Andrey Morozov

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Logic · Mathematics 2018-02-12 Russell Miller , Alexandra Shlapentokh

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…

Logic · Mathematics 2014-08-14 Bjørn Kjos-Hanssen , Frank Stephan , Jason R. Teutsch

We combine harmonic analysis and operator algebraic techniques to give a concise argument that the left regular representation of a locally compact group is cyclic if and only if the group is first countable, a result first proved by…

Operator Algebras · Mathematics 2016-09-16 Zsolt Tanko

In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.

Group Theory · Mathematics 2016-09-14 D. Osin

We show that certain orderable groups admit no isolated left orders. The groups we consider are cyclic amalgamations of a free group with a general orderable group, the HNN extensions of free groups over cyclic subgroups, and a particular…

Group Theory · Mathematics 2018-12-19 Juan Alonso , Joaquin Brum

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

Group Theory · Mathematics 2007-05-23 Arjeh M. Cohen , Sergei Haller , Scott H. Murray

In the 1980s, category theorists introduced the Lawvere-Tierney $(\leq_{\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In…

Logic · Mathematics 2026-05-15 Takayuki Kihara , Ming Ng

In this paper, we introduce the notion of circular orderability for quandles. We show that the set all right (respectively left) circular orderings of a quandle is a compact topological space. We also show that the space of right…

Geometric Topology · Mathematics 2022-04-21 Idrissa Ba , Mohamed Elhamdadi