in this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. we show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

In this paper, we show how certain metabelian groups can be found within polynomial evaluation groupoids. We show that every finite abelian group can beobtained as a polynomial evaluation groupoid.

The aim of this paper is to introduce the notion of cat$^{bf {1}}-$groupoids which are the groupoid version of cat$^{bf {1}}-$groups and to prove the categorical equivalence between crossed modules over groupoids and cat$^{bf {1}}-$groupoids. In section 4 we introduce the notions of crossed squares over groupoids and of cat$^{bf {2}}-$groupoids, and then we show their categories are equivalent....

We present a formalism for Petri nets based on polynomial-style finite-set configurations and etale maps. The supports both geometric semantics in the style of Goltz Reisig (processes are maps from graphs) an algebraic Meseguer Montanari, terms free coloured props, allows following unification: P net, Segal space P-processes is shown to be prop-in-groupoids P. There also unfolding \`a la Winske...

We study the algorithmic complexity of determining whether a system of polynomial equations over a finite algebra admits a solution. We prove that the problem has a dichotomy in the class of finite groupoids with an identity element. By developing the underlying idea further, we present a dichotomy theorem in the class of finite algebras that admit a non-trivial idempotent Maltsev condition. Th...

We study precontact groupoids whose infinitesimal counterparts are Dirac-Jacobi structures. These geometric objects generalize contact groupoids. We also explain the relationship between precontact groupoids and homogeneous presymplectic groupoids. Finally, we present some examples of precontact groupoids.

Polynomial functors (over Set or other locally cartesian closed categories) are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect is often prominent and justifies the terminology. For example, Tambara’s theorem states that the cate...

in this paper, we introduce a considerable machinery which permits us to characterize a number of special (fuzzy) subsets in ag -groupoids. generalizing the concepts of (,q) -fuzzy bi-ideals (interior ideal), we define ( , ) k q -fuzzy bi-ideals, ( , ) k q -fuzzy left (right)-ideals and ( , ) k q -fuzzy interior ideals in ag -groupoids and discuss some fundamental aspects of these i...

We consider circuits and expressions whose gates carry out multiplication in a non-associative groupoid such as loop. We deene a class we call the polyabelian groupoids, formed by iterated quasidirect products of Abelian groups. We show that a loop can express arbitrary Boolean functions if and only if it is not polyabelian, in which case its Expression Evaluation and Circuit Value problems are...

We discuss two generalizations of Lie groupoids. One consists of Lie n-groupoids defined as simplicial manifolds with trivial πk≥n+1. The other consists of stacky Lie groupoids G ⇒ M with G a differentiable stack. We build a 1–1 correspondence between Lie 2-groupoids and stacky Lie groupoids up to a certain Morita equivalence. We prove this in a general set-up so that the statement is valid in ...