English
Related papers

Related papers: On completely regular and strongly regular ordered…

200 papers

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the…

Number Theory · Mathematics 2012-03-23 Maria Bras-Amorós

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…

Group Theory · Mathematics 2014-03-07 R. A. Borzooei , A. Dvurečenskij , O. Zahiri

Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…

Group Theory · Mathematics 2012-10-05 João Araújo , Peter J. Cameron , James Mitchell , Max Neunhöffer

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

Let $a$ be an element of a semigroup $S$. The local subsemigroup of $S$ with respect to $a$ is the subsemigroup $aSa$ of $S$. The variant of $S$ with respect to $a$ is the semigroup with underlying set $S$ and operation $\star_a$ defined by…

Group Theory · Mathematics 2018-03-05 James East

In this article, we study the cuts of a totally ordered abelian group $\Gamma$. We begin by recalling some results on ordered sets I and on the associated sets IS(I) and FS(I) of initial and final segments of I. For a totally ordered set I…

Commutative Algebra · Mathematics 2025-12-02 Michel Vaquié

In this article, we introduce the concept of partial actions of a group $G$ on quivers and demonstrate that for any given partial action of G on a quiver $\Gamma$, there exists another quiver, $\Gamma'$ with a full $G$-action. This is an…

Representation Theory · Mathematics 2025-10-27 Wagner Cortes , Eduardo N. Marcos

Ehresmann semigroups may be viewed as biunary semigroups equipped with domain and range operations satisfying some equational laws. Motivated by some of the main examples, we here define ordered Ehresmann semigroups, and consider their…

Group Theory · Mathematics 2021-12-17 Tim Stokes

We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…

Functional Analysis · Mathematics 2013-07-01 Roman Drnovšek , Heydar Radjavi

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Rings and Algebras · Mathematics 2008-10-03 F. Cedo , E. Jespers , J. Okninksi

Inverses semigroups and orthodox semigroups are either defined in terms of inverses, or in terms of the set of idempotents E(S). In this article, we study analogs of these semigroups defined in terms of inverses modulo Green's relation H,…

Group Theory · Mathematics 2012-03-19 Xavier Mary

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

Combinatorics · Mathematics 2024-12-20 Marco Barbieri , Valentina Grazian , Pablo Spiga

We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…

Rings and Algebras · Mathematics 2020-06-04 Agata Pilitowska , Anna Zamojska-Dzienio

The order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ associated to a partially ordered set $P$ are studied. In this paper, we introduce the convex polytope $\Gamma(\mathcal{O}(P), -\mathcal{C}(Q))$ which is the convex…

Commutative Algebra · Mathematics 2015-10-08 Takayuki Hibi , Kazunori Matsuda , Akiyoshi Tsuchiya

Purpose: To develop the algebraic foundation of finite commutative ternary $\Gamma$-semirings by identifying their intrinsic invariants, lattice organization, and radical behavior that generalize classical semiring and $\Gamma$-ring…

Rings and Algebras · Mathematics 2026-02-06 Chandrasekhar Gokavarapu , D Madhusudhana Rao

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $\Gamma_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include…

Combinatorics · Mathematics 2025-11-19 Sauvik Poddar , Sucharita Biswas , Angsuman Das

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

Logic in Computer Science · Computer Science 2023-06-22 Zoltan Esik , Dexter Kozen

We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…

Formal Languages and Automata Theory · Computer Science 2011-02-24 Zoltan Esik , Werner Kuich

Olivieri, del R{\'{\i}}o and Sim{\'o}n defined strongly monomial groups and a significant result proved by them is the explicit description of the simple components of the rational group algebra $\mathbb{Q}G$ of a strongly monomial group…

Rings and Algebras · Mathematics 2018-05-02 Gurmeet K. Bakshi , Gurleen Kaur

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Combinatorics · Mathematics 2026-05-25 Connor Phillips