English
Related papers

Related papers: Well quasi-orders arising from finite ordered semi…

200 papers

We realise Buchweitz and Flenner's semiregularity map (and hence a fortiori Bloch's semiregularity map) as the tangent of a morphism of derived moduli functors. An immediate consequence is that it annihilates all obstructions (not just…

Algebraic Geometry · Mathematics 2012-08-17 J. P. Pridham

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

Group Theory · Mathematics 2019-05-13 A. Jamadar , K. Hansda

Man\v{c}inska and Roberson introduced quantum graph homomorphisms as the existence of perfect quantum strategies for graph homomorphism games. The resulting relation is a quasi-order on finite graphs, and hence gives a partial order after…

Combinatorics · Mathematics 2026-05-20 Yangjing Long

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

Combinatorics · Mathematics 2015-02-02 Salvatore Tringali

We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…

Rings and Algebras · Mathematics 2020-02-04 Matthew D G K Brookes

We prove that the epimorphism relation is a complete analytic quasi-order on the space of countable groups. In the process, we obtain the result of independent interest that the epimorphism relation on pointed reflexive graphs is complete.

Logic · Mathematics 2026-04-27 Su Gao , Feng Li , André Nies , Gianluca Paolini

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

Group Theory · Mathematics 2013-11-12 Gil Alon

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

We present some Zermelo-Fraenkel consistency results regarding bi-orderability of groups, as well as a construction of groups with Conradian orders whose every action on metric spaces has bounded orbits. A classical consequence of the…

Group Theory · Mathematics 2021-07-01 Samuel M. Corson

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis (1973) earlier considered such a notion of relative likelihood in the…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern

This paper examines order three elements of finite groups which normalize no nontrivial 2-subgroup. The motivation for finding such elements arises out of a problem in modular representation theory. The question of when these elements…

Group Theory · Mathematics 2016-10-25 Spencer Gerhardt

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

Representation Theory · Mathematics 2017-03-06 Stan Onypchuk

We prove that every finite idempotent semigroup (band) is finitely related, which means that the clone of its term operations (i.e. operations induced by words) is determined by finitely many relations. This solves an open problem posed by…

Group Theory · Mathematics 2017-12-14 Igor Dolinka

Inverse graph semigroups were defined by Ash and Hall in 1975. They found necessary and sufficient conditions for the semigroups to be congruence free. In this paper we give a description of congruences on a graph inverse semigroup in terms…

Group Theory · Mathematics 2018-06-29 Zheng-Pan Wang

It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…

Group Theory · Mathematics 2010-11-04 Vladimir V. Yedynak

This paper is the extended version of some results in [13, 14]. Let H be a subgroup of fundamental group. The first paper of the paper is devoted to studying weaker conditions under which homotopically Hausdorff relative to H becomes…

Algebraic Topology · Mathematics 2023-02-28 Zeynal Pashaei , Necat Gorentas , Roghayeh Abdi

Product systems are the classifying structures for semigroups of endomorphisms of B(H), in that two $E_0$-semigroups are cocycle conjugate iff their product systems are isomorphic. Thus it is important to know that every abstract product…

Operator Algebras · Mathematics 2007-05-23 William Arveson

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

Algebraic Geometry · Mathematics 2017-09-21 Guillaume Tahar

In a very influential paper Gehring and Palka introduced the notions of quasiconformally homogeneous and uniformly quasiconformally homogeneous subsets of Euclidean space. Their motivation was to provide a characterization of quasi-disks,…

Complex Variables · Mathematics 2014-01-16 Petra Bonfert-Taylor , Richard Canary , Edward Taylor