Related papers: Embeddable partial groups

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…

We explore the concept of conjugation between subgroupoids, providing several characterizations of the conjugacy relation (Theorem A in {\S}1.2). We show that two finite groupoid-sets, over a locally strongly finite groupoid, are…

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…

A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements. This…

In recent times, there has been a lot of active research on monomial groups in two different directions. While group theorists are interested in the study of their normal subgroups and Hall subgroups, the interest of group ring theorists…

We show that, in certain circumstances, a Boolean ample monoid may be fully embedded into a Boolean inverse monoid in a way that generalizes how right reversible cancellative monoids may be embedded into groups. We use groupoids of…

It was claimed in [4] that for any integer $n\geqslant 2$, a neutral element can be adjoined to an $n$-ary semigroup if and only if the $n$-ary semigroup is reducible to a binary semigroup. We show that the `only if' direction of this…

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…

We construct easy embeddings of relatively free groups (say the free Burnside group, the free solvable group) into finitely presented groups. We introduce a concept of verbal isoperimetric function of a group variety. We prove that if the…

In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss…

The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…

Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

Linguistic similarity is multi-faceted. For instance, two words may be similar with respect to semantics, syntax, or morphology inter alia. Continuous word-embeddings have been shown to capture most of these shades of similarity to some…

We classify irreducible representations of the special linear groups in positive characteristic with small weight multiplicities with respect to the group rank and give estimates for the maximal weight multiplicities. For the natural…

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…