Classifications of quasitrivial semigroups

11/27/2018
by   Jimmy Devillet, et al.
0

We investigate classifications of quasitrivial semigroups defined by certain equivalence relations. The subclass of quasitrivial semigroups that preserve a given total ordering is also investigated. In the special case of finite semigroups, we address and solve several related enumeration problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2023

Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings

We consider the posets of equivalence relations on finite sets under the...
research
02/05/2018

Unary negation fragment with equivalence relations has the finite model property

We consider an extension of the unary negation fragment of first-order l...
research
02/09/2019

Universal optimal configurations for the p-frame potentials

Given d, N≥ 2 and p∈ (0, ∞] we consider a family of functionals, the p-f...
research
01/25/2022

A Special Case of Schematic Syntactic Unification

We present a unification problem based on first-order syntactic unificat...
research
11/28/2019

Equivalence Relations for Computing Permutation Polynomials

We present a new technique for computing permutation polynomials based o...
research
04/15/2019

Efficiently Exploring Ordering Problems through Conflict-directed Search

In planning and scheduling, solving problems with both state and tempora...
research
08/04/2014

Estimating Maximally Probable Constrained Relations by Mathematical Programming

Estimating a constrained relation is a fundamental problem in machine le...

Please sign up or login with your details

Forgot password? Click here to reset