Mutations on Brauer configurations are introduced and associated with some suitable automata to solve generalizations of the Chicken McNugget problem. Additionally, based on marked order polytopes, the new Diophantine equations called Gelfand–Tsetlin equations are also solved. The approach allows algebraic descriptions of some properties of the AES key schedule via some Brauer configuration algebras and suitable non-deterministic finite automata (NFA).

The energy $\mathcal{E}\left(G\right)$ of a graph G is the sum of the absolute values of its adjacency matrix. In contrast, the trace norm of a digraph Q, which is the sum of the singular values of the corresponding adjacency matrix, is the oriented version of the energy of a graph. It is worth pointing out that one of the main problems in this theory consists of determining appropriated bounds of these types of energies for significant classes of graphs, digraphs and matrices, provided that, in general, finding out their exact values is a problem of great difficulty. In this paper, the trace norm of a $\{0,1\}$-Brauer configuration is introduced. It is estimated and computed by associating suitable families of graphs and posets to Brauer configuration algebras.

Currently, researching the Yang–Baxter equation (YBE) is a subject of great interest among scientists of diverse areas in mathematics and other sciences. One of the fundamental open problems is to find all of its solutions. The investigation deals with developing theories such as knot theory, Hopf algebras, quandles, Lie and Jordan (super) algebras, and quantum computing. One of the most successful techniques to obtain solutions of the YBE was given by Rump, who introduced an algebraic structure called the brace, which allows giving non-degenerate involutive set-theoretical solutions. This paper introduces Brauer configuration algebras, which, after appropriate specializations, give rise to braces associated with Thompson’s group F. The dimensions of these algebras and their centers are also given.

We study g-digroup actions by proving some results that are well known in group actions, for example: the orbit stabilizer theorem, the class equation, Burnside’s formula, and we relate g-digroup actions with trioids. We introduce the definition of a representation of a g-digroup into dialgebras and establish a strong connection with g-digroup action, like in the group case.

In this paper it is proved that the algorithms of differentiation VIII-X (introduced by A.G. Zavadskij to classify equipped posets of tame representation type) induce categorical equivalences between some quotient categories, in particular, an algorithm \(A_{z}\) is introduced to build equipped posets with a pair of points \((a, b)\) suitable for differentiation VII such that the subset of strong points related with the weak point \(a\) is not empty.

The enumeration of Dyck paths is one of the most remarkable problems in Catalan combinatorics. Recently introduced categories of Dyck paths have allowed interactions between the theory of representation of algebras and cluster algebras theory. As another application of Dyck paths theory, we present Brauer configurations, whose polygons are defined by these types of paths. It is also proved that dimensions of the induced Brauer configuration algebras and the corresponding centers are given via some integer sequences related to Catalan triangle entries.