Related papers: Finite regular semigroups with permutations that m…

Recently we have shown that the equivalence classes of metrics on the double of a metric space $X$ form an inverse semigroup. Here we define an inverse subsemigroup related to a family of isometric subspaces of $X$, which is more…

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

This paper introduces and studies the higher-order group inverse in a ring. We extend known properties of the higher-order group inverse from complex matrices to elements of a ring and, in the process, derive new results. We further…

Finite mixtures of regression models offer a flexible framework for investigating heterogeneity in data with functional dependencies. These models can be conveniently used for unsupervised learning on data with clear regression…

In this survey paper we discuss some recent results and related open questions in additive combinatorics, in particular, questions about sumsets in finite abelian groups.

This paper investigates a novel connection between reductions of companion matrices associated with a symmetric family of certain binomial ideals in the coordinate ring of affine n-space and permutation matrices. Specifically, for fixed…

A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…

In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…

In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.

This paper describes an issue that arises when inverting elements of the homotopy groups of an equivariant commutative ring. Equivariant commutative rings possess an enhanced multiplicative structure arising from the presence of "indexed…

We clarify the notion of effective equivalence and characterize geometrically the effectively equivalent permutation groups. In particular, we present examples showing that the latter do not correspond to affinely equivalent polytopes…

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

Given a surjective ring homomorphism, we study when the induced group homomorphism on unit groups is surjective. To this end, we introduce notions of generalized inverses and units, as well as a class of rings such that the set of closed…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

The X-ray of a permutation is defined as the sequence of antidiagonal sums in the associated permutation matrix. X-rays of permutation are interesting in the context of Discrete Tomography since many types of integral matrices can be…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

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,…