Abstract
Snake graphs are connected planar graphs consisting of a finite sequence of adjacent tiles (squares) . In this case, for , two consecutive tiles and share exactly one edge, either the edge at the east (west) of () or the edge at the north (south) of (). Finding the number of perfect matchings associated with a given snake graph is one of the most remarkable problems regarding these graphs. It is worth noting that such a number of perfect matchings allows a bijection between the set of snake graphs and the positive continued fractions. Furthermore, perfect matchings of snake graphs have also been used to find closed formulas for cluster variables of some cluster algebras and solutions of the Markov equation, which is a well-known Diophantine equation. Recent results prove that snake graphs give rise to some string modules over some path algebras, connecting snake graph research with the theory of representation of algebras. This paper uses this interaction to define Brauer configuration algebras induced by schemes associated with some multisets called polygons. Such schemes are named Brauer configurations. In this work, polygons are given by some admissible words, which, after appropriate transformations, permit us to define sets of binary trees called groves. Admissible words generate codes whose energy values are given by snake graphs. Such energy values can be estimated by using Catalan numbers. We include in this paper Python routines to compute admissible words (i.e., codewords), energy values of the generated codes, Catalan numbers and dimensions of the obtained Brauer configuration algebras.
Keywords:
binary tree; coding theory; Brauer configuration algebra; Catalan combinatorics; path algebra; snake graph; string modules MSC:
16G30; 16G60; 05A05; 05E10; 94B65
1. Introduction
Propp [1] introduced snake graphs in his investigations regarding the Laurent phenomenon associated with cluster algebras. Since then, snake graphs have become a helpful tool for research on different topics in several fields of mathematics. For instance, Schiffler and Çanakçi [2,3,4,5,6] developed a complete calculus for these kinds of graphs, achieving new developments in the continued fraction theory, bearing in mind that there is a bijection between the set of abstract snake graphs and the set of positive continued fractions.
According to this approach, perfect matchings of snake graphs give information on the numerator of a continued fraction. It is worth pointing out that perfect matchings of snake graphs were used by Schiffler et al. [7] to find a formula for cluster variables in cluster algebras from surface types, giving a solution to a well-known conjecture (positivity conjecture) regarding these algebras.
Another interpretation of the snake graph calculus was given by Çanakçi and Schroll [8], who proved that, associated with any snake graph, there is a suitable string module whose submodule lattice is in bijection with the perfect matching lattice of the underlying snake graph.
On the other hand, Brauer configuration algebras (BCAs) were introduced by Green and Schroll [9] as a generalization of Brauer graph algebras [10]. They have been used as a tool in research in different scientific fields. Indecomposable projective modules over appropriated Brauer configuration algebras have been interpreted as shadows in visual secret sharing schemes (VSSS) or as subkeys in the key schedule of the advanced encryption standard (AES) [11].
1.1. Motivations
Currently, snake graphs and Brauer configuration algebras are known to be ubiquitous tools in mathematics and their applications. On the one hand, the snake graph combinatorics gives new advances in the theory of continued fractions and rational knots. On the other hand, the combinatorial properties of Brauer configuration algebras have allowed applications of the theory of representation algebras in cryptography and the theory of graph energy, among others.
This paper uses interactions between the theories of snake graphs and Brauer configuration algebras to give a novel application of snake graphs in the coding theory.
The codes that we are interested in have as codewords n-tuples of q-ary vectors whose coordinates belong to an alphabet Q with q letters—namely, . In this case, q is not necessarily the power of a prime number. The main problem associated with these kinds of codes is minimizing the potential energy provided by the cardinality of a fixed code C.
We address the coding problem from the Brauer configuration algebras point of view. First, we prove that n-tile snake graphs define Brauer configurations whose polygons are related to some binary trees. Then, such polygons are interpreted as codes whose minimal energy is given by an appropriated snake graph.
In the sequel, we briefly describe the main results presented in this work and how some previous works are used to obtain them.
1.2. Contributions
This work proves that string modules and their corresponding snake graphs define appropriated Brauer configuration algebras, whose indecomposable projective modules can be interpreted as groves of binary trees. It is proven that the dimensions of string modules are given by suitable words (admissible words) whose letters are positive integers.
We define some operations on these words in such a way that sums of Catalan numbers give the dimensions of these algebras and their centers. In particular, the number of indecomposable projective modules over the constructed algebras is another manifestation of Catalan numbers.
Words associated with polygons define codes of type . Snake graphs give energy values of these codes. We provide, in the Appendix, Python routines to compute admissible words (associated with indecomposable projective modules over such Brauer configuration algebras), Catalan numbers, energy values of the codes , and dimensions of the generated Brauer configuration algebras.
Figure 1 shows how the results introduced in the Background section regarding snake graphs and Brauer configuration algebras (see blue arrows) are used in this paper to obtain the main results (green arrows).
Figure 1.
This graph shows how we use topics described in the Background section to obtain the main results presented in this paper.
We define admissible words in Section 3.1, which induce Brauer configuration algebras of type . Proposition 2 shows a means of building admissible words, and Proposition 3 proves that snake graphs define admissible words.
Corollary 1 enumerates admissible words, and Theorem 3 gives formulas for the dimension of the Brauer configuration algebras induced by admissible words and their corresponding centers. Theorem 4 estimates the energy values of some codes defined by the Brauer configurations . In particular, it is proven that snake graphs give such energy values.
Corollary 2 proves that the distances associated with these codes define the integer partitions of triangular numbers , where denotes the jth Catalan number.
This paper is distributed as follows. In Section 2, we recall definitions and notations used throughout the paper. In particular, we recall the notions of path algebra, string snake graph, and Brauer configuration algebra. In Section 3, we give our main results. We define and enumerate admissible words (Section 3.1). We also give properties of Brauer configuration algebras defined by admissible words (Section 3.2). In Section 3.3, we give properties of a code defined by the Brauer configurations introduced in Section 3.2. Concluding remarks are given in Section 4. Python routines are included in Appendix A.
2. Background and Related Work
This section introduces some definitions, results, and notations to be used throughout the paper. We also recall some background results, which will allow a better understanding of the main results presented in the next section. The authors refer the interested reader to [8,9,10,11,12,13] for a detailed study of the treated topics. Henceforth, () will denote a field (the set of natural numbers).
2.1. Path Algebras
This section recalls some basic notions of path algebras [13].
If is an algebraically closed field, then a path algebra is an algebra generated by the paths of a quiver (oriented graph) , where and are sets and are maps such that , and elements of the set () are said to be the vertices (arrows) of the quiver Q.
If , then the vertex () is the source (target) of the arrow [13].
An ideal I of a path algebra is generated by relations. These relations are nothing but paths with the same starting and ending points. The two-sided ideal generated by the arrows (paths of length greater than or equal to l) of Q is denoted by (). An ideal I is said to be admissible, if there is an integer such that . is said to be the arrow ideal of .
If I is an admissible ideal of , the pair is said to be a bound quiver. The quotient algebra is said to be a bound quiver algebra [13]. It is worth noting that any basic algebra is isomorphic to a bound quiver algebra if I is a suitable admissible ideal.
2.2. Snake Graphs
A tile G is a square in the plane whose sides are parallel or orthogonal to the elements in the standard orthonormal basis of the plane (as in [5], in this work, a tile G is considered as a graph with four vertices and four edges in the obvious way).
A snake graph is called straight if all its tiles lie in one column or row, and a snake graph is called zigzag if no three consecutive tiles are straight. Two snake graphs are isomorphic if they are isomorphic as graphs (cf. [2,3,4,5,6]).
Each snake graph has associated a sign function from the set of edges to the set , which defines an ordered sequence of positive integers . Numbers give rise to the continued fraction
The snake graph of the positive continued fraction is the snake graph with tiles determined by the sign function. In particular, is a single edge.
Schiffler and Çanakçi [3] proved that if denotes the number of perfect matchings of the snake graph , then . Here, is the set of perfect matchings of .
As in [12], for positive integers , we let denote a snake graph, with tiles in the first row, in the first column, tiles in the second row, and so on up to . In this case, the last tile in a given row is the first tile in the next column (if it exists) and, vice versa, the last tile in a given column coincides with the first tile in the next row. As an example, in Figure 2, we show the snake graph .
Figure 2.
Snake graph and its perfect matchings.
Remark 1.
In this paper, we also consider continued fractions associated with rational numbers , with . In such a case, the corresponding continued fraction is associated with a special snake graph . These graphs are given by adding a red point to the first tile of the snake graph associated with the continued fraction of .
2.3. String Modules and Snake Graphs
An abstract string is a word of the form , where, for , . ⌀ is also considered an abstract string. If (←), for any j, then w is said to be a direct string (inverse string).
According to Çanakçi and Schroll [8], the following procedure allows us to build a snake graph with tiles from an abstract string :
- If , then the corresponding abstract snake graph is given by a single tile.
- If there is at least one letter, then is a concatenation of a collection of alternating maximal direct and inverse strings such that . Each might be of length 1.
- For each , we construct a zigzag snake graph with tiles, where is the number of direct or inverse arrows in . Let be the zigzag snake graph with tiles , such that is glued to the right (resp. on top) of if is direct (resp. inverse).
- We now glue to , for all i, by identifying the last tile of and the first tile of , such that , , is a straight piece.
Figure 3 shows an orientation of the Dynkin diagram and its corresponding snake graph. In such a case, w has the following maximal strings:
Figure 3.
Snake graph associated with a four-arrow string. The string module over the corresponding Dynkin algebra of type is obtained by replacing every vertex with a copy of a field . In such a case, arrows correspond to identity morphism.
- , which defines the zigzag snake graph containing the tiles, and 4.
- , which defines the straight snake graph containing the tiles 4 and 5.
Note that snake graphs and are glued in a natural way.
Çanakçi and Schroll proved that if is a bound quiver algebra and is a string module over A with string w and with associated snake graph , then the perfect matching lattice of is in bijection with the canonical submodule lattice of .
We recall that a string module M is given by the orientation of a type Dynkin diagram where every vertex is replaced by a copy of and the arrows correspond to the identity maps. This paper interprets arrows as operations between suitable words consisting of positive integers.
2.4. Brauer Configuration Algebras
Green and Schroll introduced Brauer configuration algebras as a generalization of Brauer graph algebras [9,10,11,12]. Its definition goes as follows:
A Brauer configuration algebra (or simply if no confusion arises) is a bound quiver algebra induced by a Brauer configuration , where:
- is a finite set of vertices.
- is a collection of polygons, which are labeled multisets consisting of vertices (vertices repetition allowed). Each polygon contains more than one vertex.
- is a map from the set of vertices to the set of positive integers ,
- is a choice for each vertex , of a cyclic ordering of the polygons in which occurs as a vertex including repetitions (see [9] for more details). For instance, if a vertex occurs in polygons , for suitable indices , then the cyclic order is obtained by linearly ordering the list, saywhere means that vertex occurs times in polygon , denoted . The cyclic order is completed by adding the relation . Note that if is the chosen ordering at vertex , then the same ordering can be represented by any cyclic permutation.The sequence (2) is said to be the successor sequence at vertex denoted , which is unique up to permutations.Henceforth, this paper assumes the notation used in [12] for successor sequences and special cycles. Namely, if a vertex belongs to some polygons ordered according to the already defined cyclic ordering associated with the vertex , then we will assume that, up to permutations, the cyclic ordering associated with the vertex is built, taking into account that polygons inherit the order given by the successor sequence .
If , then the valency of is given by the identity
If is such that , then is said to be truncated (it occurs once in only one polygon). Otherwise, is a non-truncated vertex. It is worth pointing out that each polygon in a Brauer configuration has at least one non-truncated vertex. A Brauer configuration without truncated vertices is said to be reduced.
Later on, we will assume that successor sequences associated with non-truncated vertices are of the form (2). As Green and Schroll mentioned in [9], if is a non-truncated vertex and , then there is only one choice for the associated cyclic ordering.
From now on, if no confusion arises, we will assume notations Q, I, and instead of , , and , for a quiver, an admissible ideal, and the Brauer configuration algebra induced by a fixed Brauer configuration .
Since polygons in Brauer configurations are multisets, we will often assume that such polygons are given by words w of the form
where, for each i, , is an element of the polygon called vertex and is the frequency of the vertex . In other words, is the number of times that a vertex occurs in a polygon [14].
In [11], Cañadas et al. introduced an algorithm to build a Brauer configuration algebra . is a quiver, whose set of vertices is in bijective correspondence with the set of polygons in . Arrows are induced by the orientation by identifying each cover in a cyclic ordering with an arrow .
The bound quiver algebra is a path algebra bounded by an admissible ideal generated by relations of the following types:
- Identify special cycles associated with non-truncated vertices in the same polygon (i.e., if with , then ).
- If is a special cycle associated with a non-truncated vertex , then a product of the form , if a is the first arrow of .
- Quadratic monomial relations of the form in , where is not a subpath of any special cycle unless and a is a loop associated with a vertex of valency 1 and .
The following Theorem 1 gives some properties of Brauer configuration algebras [9,15].
Theorem 1
([9], Theorem B). The following results hold for a Brauer configuration algebra induced by a Brauer configuration .
- 1.
- There is a bijection between and the set of indecomposable projective Λ-modules.
- 2.
- If P is a projective indecomposable Λ-module corresponding to a polygon V in Γ, then is a sum of r indecomposable uniserial modules, where r is the number of (non-truncated) vertices of V and where the intersection of any two of the uniserial modules is a simple Λ-module.
Proposition 1 and Theorem 2 give formulas for the dimensions , and of a Brauer configuration algebra and its center [9,15].
Proposition 1
(Proposition 3.13, [9]). Let Λ be a Brauer configuration algebra associated with the Brauer configuration Γ and let be a full set of equivalence class representatives of special cycles. Assume that for , is a special -cycle where is a non-truncated vertex in Γ. Then,
where denotes the number of vertices of Q; denotes the number of arrows in the -cycle , and .
Theorem 2
(Theorem 4.9, [15]). Let be the Brauer configuration algebra associated with the connected and reduced Brauer configuration Γ. Then,
where .
3. Main Results
In this section, we follow some of Loday’s ideas [16] to prove that string snake graphs induce binary trees, Brauer configuration algebras, and codes.
3.1. Admissible Words
An admissible word w has positive integers as letters. It can be written in the form:
where, for each , is a positive integer, , denotes the length of w. If , then , for any . Moreover, if , with , , then . For , we let denote the set of all admissible words of length n, , is the empty word, . For example, , , whereas 131 and 4123 are admissible words in and , respectively.
Any admissible word is obtained by applying the operations •, ⊥, ⊤, ∝, ∪, →, ←, and ↔, defined as follows:
- • is the usual concatenation of words. If no confusion arises, later on, we will write .
- If, for fixed , then . Moreover, .
- If , then . In such a case, we write , . In particular, , . Thus, any admissible word w can be written in the form .
- If , then . If , then . Moreover, .
- , where , and . In particular, if (), then ().
- , .
12 (21) is the unique admissible word w for which ().
, , . Note that → and ← are not associative. For instance, , and . ↔ is not commutative , .
Proposition 2.
For any fixed, it holds that .
Proof.
We note that , , . □
If the theorem holds for , then . Thus,
3.2. Brauer Configuration Algebras Associated with Snake Graphs
This section proves that an n-tile snake graph induces a Brauer configuration whose vertices are positive integers and word polygons consist of admissible words as defined in the previous section.
Proposition 3.
String modules associated with n-tile snake graphs define .
Proof. (Induction) If is the dimension of a string module associated with an orientation for which , then, according to the operations defined in Section 3.1, if , , if , , if has 21 as a source. if has 12 as a source.
() if , , ().
We note that, for fixed, , if , , , , , . Meanwhile, , if , and . Thus, for , it holds that the th arrow of a string module gives rise to . We are finished. □
Corollary 1.
For , , where is the nth Catalan number.
Proof. (Induction) Note that , , . If it is assumed that the statement is true for , then =2. □
Henceforth, for each , we will assume that each admissible word is a multiset of the form , denotes the occurrence of h in , and denotes a permutation of the letters.
For , the set of n-tile snake graphs defines a Brauer configuration algebra induced by a Brauer configuration , where
If belongs to the polygons , where is a subchain of , then the corresponding successor sequence has the form .
Figure 4 shows the Brauer quiver associated with the Brauer configuration , for which , , , .
Figure 4.
Example of the Brauer quiver defined by the Brauer configuration . Relations , , , , , , (where denotes the special cycle associated with the vertex j in polygon , ) generate the admissible ideal for which the Brauer configuration algebra .
Successor sequence (associated with the vertex 1) defines the arrow . The successor sequence (associated with the vertex 2) defines the arrow . Arrows and complete the special cycles and .
We note that,
Figure 5 shows the structure of the indecomposable projective modules (associated with the vertex 1) and (associated with the vertex 2) over the Brauer configuration algebra . Arrows in define the corresponding composition series.
Figure 5.
Indecomposable projective -modules. Note that the number of composition series equals the number of non-truncated vertices in the corresponding polygon.
The following result regards Brauer configuration algebras of type .
Theorem 3.
For fixed, it holds that
- 1.
- If is an indecomposable projective module over associated with the polygon . Then, the number of summands in is i, .
- 2.
- ,
- 3.
- ),
- 4.
- .
where () denotes the hth Catalan number (hth triangular number). Moreover,
Proof.
Note that each polygon has i vertices. Furthermore, for each vertex , the size of the associated successor sequence contains at least two different polygons. Consider the following Table 1.
Table 1.
Valencies of vertices , and 3 in , .
Note that
In general,
Since , then the result follows from item 2 and Proposition 1. By definition, the number of loops provided by the vertex j in is given by . Furthermore, . Therefore, the result is a consequence of Theorem 2. □
Following Loday’s construction of binary trees [16], it is possible to associate a binary tree with each admissible word defined by a snake graph. In such a case, a word w of the form defines a binary tree whose left (right) leaf is given by ().
Figure 6 shows the binary trees defined by the admissible words 0, , , which has the binary tree 1 at the left leaf. Moreover, , which has the binary tree 1 at the right leaf.
Figure 6.
Admissible words and their corresponding binary trees.
The following Figure 7 shows the binary trees associated with three-tile snake graphs.
Figure 7.
The grove consisting of binary trees associated with three-tile snake graphs.
The Tamari lattice arises from the order defined on the set of admissible words, such that
3.3. The Associated Code
Let be the alphabet of q symbols, and .
The Hamming distance between two elements equals the number of coordinates in which they differ. The inner product is defined in such a way that .
The h-energy or potential energy of a code C is given by the identity
where h is a function (for convenience, often, h is considered absolutely monotone). According to Boyvalenkov et al. [17], energy minimizing codes for the potential function , are maximizing the minimum distance .
We recall that the main problem associated with these codes is minimizing the potential energy provided by the cardinality of a fixed code C, i.e., finding .
To address the coding problem from the Brauer configurations algebras point of view, we note that, by definition, for fixed, a Brauer configuration defines a code of admissible words associated with polygons in . The alphabet is given by . The purpose of this section is to give the potential energy of a code for any and . Actually, we have the following result:
Theorem 4.
For and fixed, the energy is given by a snake graph. In particular, is given by a zigzag special snake graph of the form (see Figure 2). Moreover,
where denotes the ith Catalan number, and . Furthermore, for fixed, it holds that
Proof.
We note that, for all , it holds that . In addition, , . Thus,
is a rational number. In particular, if , then , . Moreover, . Since (where is the ith triangular number), for any , the result follows. We are finished. □
Corollary 2.
For , numbers , and constitute an integer partition of the triangular number.
Proof.
Since , then . We are finished. □
Table 2 shows a table giving the number of times , , , that a distance occurs in a code . The entry at the jth row and ith column, , gives the number of times that the distance i appears in code .
Table 2.
Distances associated with a code , .
Table 3 shows a table with the energy values of codes , by using , . Columns are labeled by , whereas rows are labeled by pairs . In this case, an entry gives the energy value .
Table 3.
Energy values of codes , given by functions of the form , .
Figure 8 shows special snake graphs giving for and , , and .
Figure 8.
Examples of special snake graphs giving the minimal energy , for , .
Figure 9.
Snake graphs associated with the energy values , , , and .
4. Concluding Remarks and Future Work
String snake graphs induce admissible words related to binary trees. Such admissible words give rise to Brauer configuration algebras of type , , with indecomposable projective modules. Catalan numbers are helpful to obtain the dimensions of these algebras and their centers. Brauer configurations define codes of type , in the sense of Boyvalenkov et al., whose energy values are given by snake graphs. Distances associated with these codes allow integer partitions of the triangular numbers indexed by Catalan numbers.
Future Work
We note that , where . It is an open problem to give a closed formula for numbers , as well as the number of perfect matchings of the associated snake graphs.
Another interesting task for the future consists of giving a generalization of the presented results to arbitrary codes.
Author Contributions
Investigation, A.M.C., G.B.R. and R.-J.S.; writing—review and editing, A.M.C., G.B.R. and R.-J.S. All authors have read and agreed to the published version of the manuscript.
Funding
Seminar Alexander Zavadskij on Representation of Algebras and their Applications, Universidad Nacional de Colombia. The third author was supported by Minciencias (Conv. 891).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| (jth Catalan number) | |
| (Dimension of a Brauer configuration algebra) | |
| (Dimension of the center of a Brauer configuration algebra) | |
| (Energy of a code ) | |
| (Field) | |
| (Set of vertices of a Brauer configuration ) | |
| (ith triangular number) | |
| (Number of occurrences of a vertex in a polygon V) | |
| (The word associated with a polygon V) | |
| (Ordered sequence of polygons) | |
| (Valency of a vertex ) |
Appendix A. Python Routines
In this section, we give Python routines to compute the word product ∝ (routine [2]), Catalan numbers (routine [3]), admissible words (routine [4]), dimensions of the Brauer configuration algebras (routine 5), and energy values of the defined codes (routine [6]).






References
- Propp, J. The combinatorics of frieze patterns and Markoff numbers. Integers 2020, 20, 1–38. [Google Scholar]
- Çanakçi, I.; Schiffler, R. Cluster algebras and continued fractions. Compos. Math. 2018, 54, 565–593. [Google Scholar] [CrossRef] [Scilit]
- Çanakçi, I.; Schiffler, R. Snake graphs and continued fractions. Eur. J. Combin. 2020, 86, 1–19. [Google Scholar] [CrossRef] [Scilit]
- Çanakçi, I.; Schiffler, R. Snake graphs calculus and cluster algebras from surfaces. J. Algebra 2013, 382, 240–281. [Google Scholar] [CrossRef] [Scilit]
- Çanakçi, I.; Schiffler, R. Snake graphs calculus and cluster algebras from surfaces II: Self-crossings snake graphs. Math. Z. 2015, 281, 55–102. [Google Scholar] [CrossRef] [Scilit]
- Çanakçi, I.; Schiffler, R. Snake graphs calculus and cluster algebras from surfaces III: Band graphs and snake rings. Int. Math. Res. Not. IMRN 2017, rnx157, 1–82. [Google Scholar] [CrossRef] [Scilit]
- Musiker, G.; Schiffler, R.; Williams, L. Posiivity for cluster algebras from surfaces. Adv. Math. 2011, 227, 2241–2308. [Google Scholar] [CrossRef] [Scilit]
- Çanakçi, I.; Schroll, S. Lattice bijections for string modules snake graphs and the weak Bruhat order. Adv. Appl. Math. 2021, 126, 102094. [Google Scholar] [CrossRef] [Scilit]
- Green, E.L.; Schroll, S. Brauer configuration algebras: A generalization of Brauer graph algebras. Bull. Sci. Math. 2017, 121, 539–572. [Google Scholar] [CrossRef] [Scilit]
- Schroll, S. Brauer Graph Algebras. In Homological Methods, Representation Theory, and Cluster Algebras, CRM Short Courses; Assem, I., Trepode, S., Eds.; Springer: Cham, Switzerland, 2018; pp. 177–223. [Google Scholar]
- Cañadas, A.M.; Gaviria, I.D.M.; Vega, J.D.C. Relationships between the Chicken McNugget Problem, Mutations of Brauer Configuration Algebras and the Advanced Encryption Standard. Mathematics 2021, 9, 1937. [Google Scholar] [CrossRef] [Scilit]
- Cañadas, A.M.; Espinosa, P.F.F.; Muñetón, N.A. Brauer configuration algebras defined by snake graphs and Kronecker modules. Electron. Res. Arch. 2022, 30, 3087–3110. [Google Scholar] [CrossRef] [Scilit]
- Assem, I.; Skowronski, A.; Simson, D. Elements of the Representation Theory of Associative Algebras; Cambridge University Press: Cambridge, UK, 2006. [Google Scholar]
- Andrews, G.E. The Theory of Partitions; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
- Sierra, A. The dimension of the center of a Brauer configuration algebra. J. Algebra 2018, 510, 289–318. [Google Scholar] [CrossRef] [Scilit]
- Loday, J.L. Arithmetree. J. Algebra 2002, 258, 275–309. [Google Scholar] [CrossRef] [Scilit]
- Boyvalenkov, P.; Dragnev, P.D.; Hardin, P.D.; Saff, E.B.; Stoyanova, M.M. Energy bounds for codes and designs in Hamming spaces. Des. Codes Cryptogr. 2017, 82, 411–433. [Google Scholar] [CrossRef] [Scilit]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).








