scholarly journals The monoid structure on homotopy obstructions

2019 ◽  
Vol 540 ◽  
pp. 168-205
Author(s):  
Satya Mandal ◽  
Bibekananda Mishra
Keyword(s):  
2005 ◽  
Vol 174 (1-2) ◽  
pp. 103-122 ◽  
Author(s):  
G KHALEDI ◽  
M MASHINCHI ◽  
S ZIAIE
Keyword(s):  

1998 ◽  
Vol 08 (02) ◽  
pp. 141-152 ◽  
Author(s):  
N. D. Gilbert

We consider properties of a 2-complex associated by Squier to a monoid presentation. We show that the fundamental groupoid admits a monoid structure, and we establish a relationship between its group completion and the fundamental group of the 2-complex. We also treat a modified complex, due to Pride, for monoid presentations of groups, and compute the structure of the fundamental groupoid in this setting.


2002 ◽  
Vol 84 (3) ◽  
pp. 663-685 ◽  
Author(s):  
MARCUS REINEKE

A monoid structure on families of representations of a quiver is introduced by taking extensions of representations in families, that is, subvarieties of the varieties of representations. The study of this monoid leads to interesting interactions between representation theory, algebraic geometry and quantum group theory. For example, it produces a wealth of interesting examples of families of quiver representations, which can be analysed by representation-theoretic and geometric methods. Conversely, results from representation theory, in particular A. Schofield's work on general properties of quiver representations, allow us to relate the monoid to certain degenerate forms of quantized enveloping algebras.2000 Mathematical Subject Classification: 16G20, 14L30, 17B37.


10.37236/919 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
R. Brown ◽  
I. Morris ◽  
J. Shrimpton ◽  
C. D. Wensley

This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of endomorphisms is both a monoid and a graph. We extend Shrimpton's (unpublished) investigations on the morphism digraphs of reflexive digraphs to the undirected case by using an equivalence between a category of reflexive, undirected graphs and the category of reflexive, directed graphs with reversal. In so doing, we emphasise a picture of the elements of an undirected graph, as involving two types of edges with a single vertex, namely 'bands' and 'loops'. Such edges are distinguished by the behaviour of morphisms with respect to these elements.


1995 ◽  
Vol 2 (57) ◽  
Author(s):  
Jaap Van Oosten

This paper is a little mathematical study of some models of concurrency. The most elementary one is the concept of an independence structure, which is nothing but a set L with a binary, irreflexive and symmetric relation on it, the independence relation. This leads to the notion of a trace: a string of elements of L, modulo the equivalence generated by swapping adjacent, independent elements of the string.<br /> There are two aspects of finite traces: they form an order, hence a topology; on the other hand they form a monoid, a quotient of the free monoid on L. Unfortunately, these two points of view are hard to bring together, since the monoid structure can never be continuous or even order-preserving. It is therefore not surprising that many papers on trace theory consist of two, disjoint, parts. In this paper I concentrate on the order-theoretic and topological aspects.


1969 ◽  
Vol 34 ◽  
pp. 35-76 ◽  
Author(s):  
Helmut Röhrl

The aim of this paper is to investigate some applications of a certain universal problem. The universal problem deals with categories C which for every object A have some ‘‘structure” on the set C(A, A) of endomorphisms of A and calls for a universal solution, relative to this structure, that is associated with C(A, A) and centralizes the set of automorphisms of A. The commutative version of this universal problem asks for a universal solution, relative to the said structure, that abelianizes the canonical monoid structure of C(A, A).


1977 ◽  
Vol 18 (2) ◽  
pp. 145-152
Author(s):  
Elyahu Katz

The Eckman–Hilton duality [4] reverses arrows in diagrams, turns products to co-products, and multiplications to co-multiplications, etc. In accordance with this process, Kan [5] obtained the dual of a monoid structure in the category of groups. In this way, we obtain co-monoid structures on topological groups. The main result of this paper is that for kaω groups (see §2), we obtain a one-to-one correspondence between the co-monoid structures, and the free topological bases of the group (§3), thus obtaining topological analogues of the main results of [5].


2003 ◽  
Vol 13 (04) ◽  
pp. 437-461 ◽  
Author(s):  
KEVIN BLOUNT ◽  
CONSTANTINE TSINAKIS

A residuated lattice is an ordered algebraic structure [Formula: see text] such that <L,∧,∨> is a lattice, <L,·,e> is a monoid, and \ and / are binary operations for which the equivalences [Formula: see text] hold for all a,b,c ∈ L. It is helpful to think of the last two operations as left and right division and thus the equivalences can be seen as "dividing" on the right by b and "dividing" on the left by a. The class of all residuated lattices is denoted by ℛℒ The study of such objects originated in the context of the theory of ring ideals in the 1930s. The collection of all two-sided ideals of a ring forms a lattice upon which one can impose a natural monoid structure making this object into a residuated lattice. Such ideas were investigated by Morgan Ward and R. P. Dilworth in a series of important papers [15, 16, 45–48] and also by Krull in [33]. Since that time, there has been substantial research regarding some specific classes of residuated structures, see for example [1, 9, 26] and [38], but we believe that this is the first time that a general structural theory has been established for the class ℛℒ as a whole. In particular, we develop the notion of a normal subalgebra and show that ℛℒ is an "ideal variety" in the sense that it is an equational class in which congruences correspond to "normal" subalgebras in the same way that ring congruences correspond to ring ideals. As an application of the general theory, we produce an equational basis for the important subvariety ℛℒC that is generated by all residuated chains. In the process, we find that this subclass has some remarkable structural properties that we believe could lead to some important decomposition theorems for its finite members (along the lines of the decompositions provided in [27]).


10.37236/8740 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Jean-Christophe Aval ◽  
Théo Karaboghossian ◽  
Adrian Tanasa

In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on hypergraphs. We give a combinatorial interpretation of this invariant on negative integers which leads to a reciprocity theorem on hypergraphs. Finally, we use this invariant to recover well-known invariants on other combinatorial objects (graphs, simplicial complexes, building sets, etc) as well as the associated reciprocity theorems.


Sign in / Sign up

Export Citation Format

Share Document