Open AccessArticle

Brauer Analysis of Some Cayley and Nilpotent Graphs and Its Application in Quantum Entanglement Theory

Agustín Moreno Cañadas

^1,*,†

Ismael Gutierrez

^2,*,†

and

Odette M. Mendez

^3,*,†

Departamento de Matemáticas, Universidad Nacional de Colombia, Edificio Yu Takeuchi 404, Kra 30 No. 45-03, Bogotá 11001000, Colombia

Departamento de Matemáticas y Estadística, Universidad del Norte, Kilómetro 5, Via Puerto Colombia, Barranquilla 081007, Colombia

Departamento de Matemáticas, Universidad Nacional de Colombia, Sede, La Nubia, Manizales 170003, Colombia

Authors to whom correspondence should be addressed.

^†

These authors contributed equally to this work.

Symmetry 2024, 16(5), 570; https://doi.org/10.3390/sym16050570

Submission received: 11 February 2024 / Revised: 9 March 2024 / Accepted: 13 March 2024 / Published: 6 May 2024

(This article belongs to the Special Issue Symmetry in Graph Algorithms and Graph Theory III)

Download

Browse Figures

Versions Notes

Abstract

Cayley and nilpotent graphs arise from the interaction between graph theory and algebra and are used to visualize the structures of some algebraic objects as groups and commutative rings. On the other hand, Green and Schroll introduced Brauer graph algebras and Brauer configuration algebras to investigate the algebras of tame and wild representation types. An appropriated system of multisets (called a Brauer configuration) induces these algebras via a suitable bounded quiver (or bounded directed graph), and the combinatorial properties of such multisets describe corresponding indecomposable projective modules, the dimensions of the algebras and their centers. Undirected graphs are examples of Brauer configuration messages, and the description of the related data for their induced Brauer configuration algebras is said to be the Brauer analysis of the graph. This paper gives closed formulas for the dimensions of Brauer configuration algebras (and their centers) induced by Cayley and nilpotent graphs defined by some finite groups and finite commutative rings. These procedures allow us to give examples of Hamiltonian digraph constructions based on Cayley graphs. As an application, some quantum entangled states (e.g., Greenberger–Horne–Zeilinger and Dicke states) are described and analyzed as suitable Brauer messages.

Keywords:

Brauer configuration algebra; Cayley graph; nilpotent graph; path algebra; quantum entanglement; quiver representation

1. Introduction

Cayley and nilpotent graphs are helpful combinatorial tools for the visualization of different algebraic structures [1,2,3,4,5,6]. On the one hand, Cayley graphs were introduced as a consequence of Cayley’s theorem; in such a case, given a group G and a subset

S \subseteq G

, the Cayley graph is an undirected graph

C_{(G, S)} = (V_{C_{(G, S)}}, E_{C_{(G, S)}})

whose set of vertices

V_{C_{(G, S)}} = G

. Furthermore, there is an edge

e_{g_{1}, g_{2}} \in E_{C_{(G, S)}}

connecting two elements

g_{1}, g_{2} \in G

if there is an element

s \in S

such that

g_{1} s = g_{2}

[1].

Investigations regarding Cayley graphs study graph properties such as connectedness, amenability, perfect matchings, algebraic degrees, chromatic and clique numbers or the existence of Hamiltonian paths [7,8,9,10]. The spectrum of the adjacency matrix of a Cayley graph allows interactions between graph, group representation and graph energy theories [11,12]. In particular, Sarmin et al. [12] studied the Seidel energy for Cayley graphs associated with dihedral groups. Moreover, Cayley graphs of groups and semigroups allow applications in cryptography via the construction of provably secure hash functions [13,14,15,16].

Currently, Cayley graphs are used to design good models of network architectures. The pancake and star graphs introduced by Akers and Krishnamurthy are examples of Cayley graphs commonly accepted as models for such architectures. Butterfly networks are also examples of these kinds of graphs.

On the other hand, nilpotent graphs associated with rings have been studied by Chen, Khojasteh et al., Basnet et al. and Riyas et al. [5,6,17]. If R is a ring and

N i l (R) = {x \in R ∣ x^{n} = 0 for some positive integer n}

is a ring R set of nilpotent elements, then the nilpotent graph

N (R) = (V_{N (R)}, E_{N (R)})

of the ring R has

R ∖ N i l (R)

as a set of vertices. Two elements

x, y \in R

x \neq y

are connected by an edge

e_{x, y} \in E_{N (R)}

, if

x + y \in N i l (R)

. Studies dealing with nilpotent graphs are similar to those presented for Cayley graphs [6].

Green and Schroll [18,19] introduced Brauer configuration algebras to investigate algebras of the wild representation type. These algebras are bounded path algebras induced by a suitable collection of multisets

Γ

, i.e., such algebras are generated by paths in a directed graph or quiver

Q_{Γ}

whose vertices correspond to the multisets in

Γ

. In such a case, each element

x \in U \cap V

with

U, V \in Γ

defines an arrow

α_{U, V}^{x}

connecting U and V. Afterwards, Espinosa [20] introduced the Brauer message of a Brauer configuration. Such a definition allowed for the application of the theory of Brauer configuration algebras in different science and mathematics fields. Undirected graphs are mainly examples of Brauer messages. Therefore, Cayley and nilpotent graphs give rise to Brauer configuration algebras, whose associated multisets and the dimensions of their centers are defined by the number of corresponding edges.

Recently, Brauer configuration algebras have been a helpful tool for research on graph energy theory, block cyphers in cryptography, the Yang–Baxter equation and the number of zinc sulfide (ZnS) molecules in clusters of n layers in zinc-blended crystals [21,22,23,24,25].

This paper defines the Brauer configuration algebras induced by some finite groups and finite commutative rings via their associated Cayley and nilpotent graphs. It gives the dimensions of these algebras, the structures of their indecomposable projective modules, the dimensions of their centers and examples of Hamiltonian Brauer quivers. Furthermore, we describe new applications to the Brauer configuration algebra theory in quantum entanglement theory; specifically, we prove that quantum

G H Z

entanglement states of type

G H Z_{n}^{d}

and entanglement Dicke states of type

D_{n}^{m}

, recently realized in the laboratory, can be seen as suitable Brauer messages [26,27,28,29,30].

1.1. Motivations

Cayley and nilpotent graphs are undirected graphs that allow the visualization of algebraic structures as groups and rings. Research on these graphs establishes relationships between algebra and combinatorics. Since undirected graphs are Brauer messages, the Brauer analysis of the corresponding Brauer configuration algebras allows new interactions between representations of algebras, groups and graph theories.

If a given algebraic structure is associated with an undirected graph, it is suitable for a Brauer analysis. For instance, recently, Zeilinger et al. [28,29,30] realized experiments to derive the quantum entanglement states of type

G H Z

and

D_{n}^{m}

; such entanglements give rise to appropriate undirected graphs whose perfect matchings allow their final states.

1.2. Contributions

The main contributions of this paper are Theorem 1, Proposition 2, Corollary 1, Theorem 2, Corollary 2, Theorems 3–5, Corollary 5, Theorems 6–8 and Corollary 6. This paper presents Brauer analyses of nilpotent and Cayley graphs associated with some groups and commutative rings. As an application, some

G H Z

and Dicke states are defined as appropriate Brauer messages.

Theorem 1 proves that the Brauer configuration algebra induced by a Cayley graph defined by a set of generators of a group G satisfies the length grading property (see the fifth item in Remark 2), and closed formulas for the dimensions of these algebras and their centers are also given. Proposition 2 gives similar results for the dimensions of Brauer configuration algebras induced by butterfly graphs. Corollary 1 establishes relationships between star and pancake graphs, which help to design network interconnections. Theorem 2 gives conditions for the construction of Hamiltonian Brauer quivers, and Corollary 2 gives an example of a Hamiltonian directed graph induced by a Cayley graph.

Theorems 3–5 are devoted to the properties of Brauer configuration algebras induced by nilpotent graphs. Theorem 3 proves that Brauer configuration algebras induced by nilpotent graphs

N (Z_{2^{n}})

satisfy the length grading property, and the dimensions of these algebras and their centers can be obtained via some closed formulas. Theorems 4 and 5 give similar results for Brauer configuration algebras induced by nilpotent graphs of the form

N (Z_{2^{n} p_{1} p_{2} \dots p_{t}})

and

N (Z_{p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{t}^{a_{t}}})

, where

p_{j}

denotes an odd prime number and

a_{i}

is a positive integer. Corollary 5 gives closed formulas for the centers of Brauer configuration algebras induced by connected components of some nilpotent graphs.

Theorems 6–8 and Corollary 6 give the main properties of the Brauer configuration algebras induced by quantum entanglements of type

G H Z_{n}^{2}

G H Z_{n}^{3}

W_{n}

and

D_{n}^{n / 2}

. They also prove that the corresponding final states are specialized Brauer messages.

2. Preliminaries

This section gives basic definitions and notations regarding Cayley and nilpotent graphs associated with groups and commutative rings. It also introduces the notion of Brauer configuration algebra. Section 2.5 recalls the basic notations and definitions of quantum entanglement theory.

2.1. Background

The Cayley graph of a group was introduced in 1878 by Cayley [1]; since then, many works have been devoted to its properties and applications. According to Witte and Gallian [7], Rankin’s paper [31] is the pioneering work regarding the existence of Hamiltonian cycles in Cayley digraphs.

Brian Alspach et al. [32] proved that every connected non-bipartite Cayley graph of valency at least three on a generalized dihedral group, whose order is divisible by four, is Hamilton-connected. Pastine and Jaume [33] proved that if S is a generating subset of a dihedral group

D_{n}

such that

D_{n} \cap S \neq ⌀

, then the Cayley graph of

D_{n}

is Hamiltonian.

Riyas and Geetha [8] presented a study on the Cayley graphs over dihedral groups. They gave conditions for subgraphs of Cayley graphs associated with dihedral groups to be bipartite or Hamiltonian.

Applications of Cayley graphs in cryptography have been given by Charles and Lauter [14], Jao et al. [15] and Sosnovski [16], who used Cayley graphs associated with semigroups and groups to define provably secure hash functions.

Palanivel and Chithra [34] studied the energy and Laplacian energy of some Cayley graphs, whereas Sarmin et al. [12] investigated the Seidel energy for Cayley graphs associated with dihedral groups and Lu and Mönius [10] established the properties of the algebraic degree of Cayley graphs over abelian groups and dihedral groups.

The idea of using group theory to design interconnection networks was introduced in 1986 by Akers and Krishnamurthy, who presented some Cayley graphs named pancake and star graphs as examples of network architecture graphs. The butterfly and wrap-around butterfly networks are also examples of Cayley graphs in network design. The hypercube and the augmented cube are examples of the presence of Cayley graphs in networking research.

A vast body of literature is devoted to studying the properties of graphs defined by rings. Beck [2] introduced zero-divisor graphs to investigate the coloring problem in commutative rings. Afterwards, Anderson and Livingston [3] modified the notion of the zero-divisor graph introduced by Beck. Kala and Kavitha [4] also studied non-zero divisor graphs.

The notion of a weakly nilpotent graph of a commutative ring was introduced by Khojasteh and Nikmehr [5], and Basnet et al. [6] introduced nilpotent graphs for commutative rings whose edges connect non-nilpotent elements

x, y

with

x \neq y

x + y

is a nilpotent element. They gave conditions for rings of type

Z_{n}

whose nilpotent graphs are connected, bipartite, regular or complete.

According to Schrödinger, quantum entanglement is the essence of quantum mechanics. Such a notion was introduced in 1935 by Einstein, Podolsky and Rosen to show the incompleteness of quantum mechanics theory. The trio, known as EPR, used perfect correlations of entangled states (called EPR states) to define so-called “elements of the reality”, which were missing in quantum theory, according to them [26].

EPR’s proposal was untestable for almost thirty years, until the introduction of Bell’s inequalities, which revealed that two-particle correlations for the two spin-

\frac{1}{2}

singlet disagree with any local realistic model. Freedman and Clauser realized such an experiment in 1972, followed by Aspect et al. between 1981 and 1982. Meanwhile, the Greenberger–Horne–Zeilinger (GHZ) theorem showed that the concept of EPR’s elements is self-contradictory. We recall that the 2022 Nobel Prize was granted to Clauser, Aspect and Zeilinger for their experiments regarding quantum entanglement theory [27].

The interpretation of perfect matchings’ superposition as quantum entanglements was introduced by Gu, Zeilinger et al. [28,29,30]. They associated suitable undirected graphs with experimental quantum entanglements, so their perfect matchings allowed

G H Z

and Dicke entanglement states.

Green and Schroll [18,19] introduced Brauer graph algebras and Brauer configuration algebras. These algebras are generated by paths in a suitable quiver (digraph). Espinosa [20] introduced the message of a Brauer configuration, proving that any directed graph is the Brauer message of a Brauer configuration. This result proves that any algebraic structure whose elements and operations between them define an unoriented graph also induces a Brauer configuration algebra, and it is suitable for a Brauer analysis.

2.2. Graphs and Multisets

A graph

G

is composed of two types of objects. It has a finite set

V_{G} = {a_{1}, a_{2}, a_{3}, \dots, a_{n}}

of elements called vertices and a set

E_{G}

of pairs of distinct vertices called edges [35]. We let

G = (V_{G}, E_{G})

denote a graph

G

whose vertex set is

V_{G}

, and whose edge set is

E_{G}

, where

E_{G} \subset V_{G}^{2}

. A graph

G

can be graphically represented by drawing a dot for each vertex and linking two of these dots with a line if they constitute an edge. It is considered irrelevant how these dots and lines are drawn. According to Diestel [36], all that matters is the information offered by the picture about the edges of the graph

G

A quiver or digraph Q is a directed graph given by a system of the form

(Q_{0}, Q_{1}, s, t)

, where

Q_{0}

(

Q_{1}

) is the set of vertices (arrows) of Q. s and t are maps

s, t : Q_{1} \to Q_{0}

;

s (a)

(

t (a)

) is said to be the source (target) of an arrow a. The graphical representation of a quiver Q is similar to the construction of a graph. In this case, two vertices (represented by dots) are connected by an arrow a whose starting vertex is the source

s (a)

and the ending vertex is the target

t (a)

. A directed path is a sequence of arrows

P = {a_{0}, a_{1}, \dots, a_{k - 1}, a_{k}}

for which

s (a_{i}) = t (a_{i - 1})

1 \leq i \leq k

If Q is a digraph,

x \in Q_{0}

N_{Q}^{-} (x) = {y \in Q_{0} ∣ (y, x) \in Q_{1}}

, and

N_{Q}^{+} (x) = {y \in Q_{0} ∣ (x, y) \in Q_{1}}

, then the out-degree (in-degree) of x is denoted

d_{Q}^{+} = | N_{Q}^{+} (x) |

(denoted

d_{Q}^{-} = | N_{Q}^{-} (x) |

). The degree of a vertex x in Q is

d_{Q} (x) = d_{Q}^{+} (x) + d_{Q}^{-} (x)

[37].

A Hamilton cycle of a graph G of order n is a cycle of G of length n. Hence, a Hamilton cycle in a graph of order n is a cycle

x_{1} - x_{2} - \dots - x_{n} - x_{1}

of length n, where

x_{1}, x_{2}, \dots, x_{n}

are the n vertices of G in the same order. A Hamilton path in G joining vertices a and b is a path

a = x_{1} - x_{2} - \dots - x_{n} = b

of length

n - 1

of G. Thus, a Hamilton path is given by a permutation of the n vertices of G in which consecutive vertices are joined by an edge. The Hamilton path joins the first vertex of the permutation to the last. The edges of a Hamilton path and of a Hamilton cycle are necessarily distinct [35].

Let Q be a digraph for which

Q_{0} = {x_{0}, x_{1}, x_{2}, \dots, x_{n - 1}, x_{n}}

; then, a directed path P of the form

P = x_{0} \to x_{1} \to x_{2} \to \dots x_{n - 1} \to x_{n}

is a Hamilton path of the digraph Q (each vertex appears just once in P). A digraph Q is Hamiltonian if it contains a Hamiltonian cycle. The decision problem of whether a graph has a Hamilton cycle is NP-complete [38]. This problem appears on Karp’s original list of 21 NP-complete problems.

Currently, there is a plethora of results regarding Hamiltonicity. For instance, Dirac proved that every graph on

n \geq 3

vertices with minimum degree at least

n / 2

contains a Hamilton cycle. Meanwhile, Nash-Williams proved that if Q is a digraph on

n \geq 2

vertices such that, for every vertex x, it holds that

d^{+} (x) \geq n / 2

and

d^{-} (x) \geq n / 2

, then Q is Hamiltonian [39].

A multiset

M

is a pair

M = (M, f)

of a set M and a map

f : M \to N

, where

N

is the set of nonnegative integers. f is said to be the multiplicity function associated with the set M. If

m \in M

, then

f (m)

is the frequency of m in the multiset

M

, i.e.,

f (m)

denotes the number of times that m occurs in

M

. In this work, it is assumed that

f (m) \geq 1

for any

m \in M

. In other words, a multiset is a set with possibly repeated elements [40].

Any finite multiset

M = (M, f)

with

M = {m_{1}, m_{2}, \dots, m_{n}}

can be written as a word

w (M)

with the form

w (M) = m_{1}^{f (m_{1})} m_{2}^{f (m_{2})} \dots m_{n}^{f (m_{n})} .

(1)

A permutation of a multiset (1),

π \in S_{f (m_{1}) + f (m_{2}) + \dots + f (m_{n})}

is a word in which each letter belongs to M and, for each

m \in M

, the number of appearances of m in the word is

f (m)

[40].

As an example, symmetry is a permutation of the multiset

e^{1} m^{2} r^{1} s^{1} t^{1} y^{2}

. Such permutations give rise to labeled multisets of the form

(M, π) = π (w (M))

. According to Espinosa [20], a labeling

(M, f)

of a multiset

M

means that the word

w (M)

can be transformed using a suitable map

φ : M^{*} \to A

, where

A

is an appropriated set and

M^{*}

is the set of words induced by M. In such a case, it is assumed that

(M, φ)

is a multiset

M^{'}

for which

w (M^{'}) = φ (w (M))

. Specifically, multiset permutations define labeled multisets.

M_{1} = (M_{1}, f_{1})

and

M_{2} = (M_{2}, f_{2})

, then the interception

M_{1} \cap M_{2}

is defined in such a way that

M_{1} \cap M_{2} = {m \in M_{1} \cap M_{2} ∣ f (m) = \min {f_{1} (m), f_{2} (m)}} .

(2)

According to Espinosa [20], the message

M (M)

of a system of labeled multisets

M = {(M_{1}, φ_{1}), (M_{2}, φ_{2}), \dots, (M_{n}, φ_{n}) ∣ M_{j} = (M_{j}, f_{j}), M = ⋃_{j = 1}^{n} M_{j}}

(3)

with suitable maps

φ_{j}

1 \leq j \leq k

is the concatenation of their words. That is,

M (M) = w ((M_{1}, φ_{1})) w ((M_{2}, φ_{2})) \dots w ((M_{n}, φ_{n})) .

(4)

Graphs are examples of multiset messages. To see this, let

G = (V_{G}, E_{G})

be the graph for which

V_{G} = {0, 1, 2, 3}

E_{G} = {e_{i} ∣ 0 \leq i \leq 3}

; the edges (multisets) are given by the following identities:

e_{1} = {1, 2}

e_{2} = {2, 3}

e_{3} = {3, 0}

e_{0} = {0, 1}

. The labeled edges are shown in Figure 1, where

a_{i} = i mod 4

(

b_{i} = i + 1 mod 4

The graph shown in Figure 2 is the message

M (G)

defined by the graph

G

and the labeling

{φ_{i}}

0 \leq i \leq 3

Remark 1.

Note that labeled messages of type (4) can be interpreted as elements of suitable algebraic objects. In fact, the first interpretation of such messages is as elements of a monoid determined by word-polygons. However, it is possible to enrich the structure

M (M)

by adding a suitable collection of maps in such a way that

φ_{i} (w (M_{i})) = φ_{i_{j_{i}}} φ_{i_{j_{i} - 1}} \dots φ_{i_{j_{1}}} (w (M_{i})) \in A

, for any

1 \leq i \leq n

, where

A

is an algebra endowed with a set of suitable operations

O_{A} = {O_{i} ∣ 1 \leq i \leq o_{i}}

To obtain a specialized message

M^{e} (M)

from

M (M)

, we consider that

A

is a Hilbert space of type

C^{n}

, where

C

denotes the complex numbers field and n is an appropriate integer number. Then, we define a partition

F = {F_{1}, F_{2}, \dots, F_{p}}

for the set of words induced by

M

F_{j} = {w (M_{j_{t}}) ∣ 1 \leq t \leq t_{j}} .

(5)

For j fixed and

O_{h_{j}} \in O_{A}

, the specialized word

w^{e} (F_{j})

associated with

F_{j}

and

O_{h_{j}} \in O_{A}

is given by an identity of the form

w^{e} (F_{j}) = w (M_{j_{1}}) O_{h_{j}} w (M_{j_{2}}) O_{h_{j}} \dots O_{h_{j}} w (M_{j_{t_{j}} - 1}) O_{h_{j}} w (M_{j_{t_{j}}}) \in B .

(6)

where

B

is a suitable fixed Hilbert space. Often,

B = A

The specialized message

M^{e} (M)

associated with the fixed operations

O_{h_{1}}, O_{h_{2}}, \dots, O_{h_{p}}, O_{s} \in O_{A}

is given by the following identity:

M^{e} (M) = w^{e} (F_{1}) O_{s} w^{e} (F_{2}) O_{s} \dots O_{s} w^{e} (F_{p - 1}) O_{s} w^{e} (F_{p}) \in B .

(7)

A system of multisets as defined in (3) is said to be a Brauer configuration if it is endowed with a multiplicity function,

μ : M \to N^{+}

, and an orientation,

O

, where

N^{+}

is the set of positive integers.

M^{m}

denotes the intersection of all sets

M_{i}

that contain an element

m \in M

M^{m} = M_{1}^{m} \cap M_{2}^{m} \cap \dots \cap M_{h}^{m}

m \in M_{s}^{m}

M_{s}^{m} = M_{i}

for some i,

1 \leq i \leq k

1 \leq s \leq h

. Then, we define a totally ordered set

(S_{m}, <)

with

S_{m} = {M_{j}^{m, n_{j}} ∣ 1 \leq n_{j} \leq f_{j} (m), 1 \leq j \leq h}

. Each element

M_{j}^{m, n_{j}}

corresponds to a copy of the multiset

M_{j}

The valency

v a l (m)

of an element

m \in M

(see (3)) is given by the sum.

v a l (m) = \sum_{j = 1}^{h} f_{j} (m)

(8)

μ (m) v a l (m) = 1

, then m is said to be truncated; otherwise, m is non-truncated. In this work,

μ (m) = 2

v a l (m) = 1

. Thus, the elements

m \in M

in a Brauer configuration of type

M

(also called vertices) are non-truncated. Multisets in Brauer configurations are named polygons by Green and Schroll [18].

The orientation

O

is defined by extending the totally ordered set

(S_{m}, <)

with a new relation of the form

\max S_{m} < \min S_{m}

. Thus,

C_{m} = (S_{m}, <) \cup {\max S_{m} < \min S_{m}}

is a circular ordering associated with the point m.

A chain

S_{x}

is the successor sequence associated with the point x. Note that all the circular orderings defined by

C_{x}

are equivalent. Therefore, the Brauer configuration

(M, μ, O)

defines a new multiset

Γ = ({C_{m_{i}}}, δ_{i})

with

δ_{i} (C_{m_{i}}) = μ (m_{i})

and

w (Γ) = C_{m_{1}}^{μ (m_{1})} C_{m_{2}}^{μ (m_{2})} \dots C_{m_{n}}^{μ (m_{n})}, M = ⋃_{j = 1}^{k} M_{j} = {m_{1}, m_{2}, \dots, m_{n}} .

(9)

As in the case for unoriented graphs, each circular ordering

C_{m}

is labeled with a digraph obtained by assigning to each covering of the form

M_{h}^{m, n_{h}} < M_{j}^{m, n_{j}}

an arrow

M_{h}^{m, n_{h}} \overset{α_{h, j}^{m}}{⟶} M_{j}^{m, n_{j}}

. Such labeling associates each circular ordering with an oriented cycle called a special cycle. Therefore, the word

w (Γ)

is nothing but a bounded quiver or digraph denoted

Q_{Γ}

, called the Brauer quiver, induced by the Brauer configuration

Γ

. For an algebraically closed field k, we let

Λ_{Γ} = k Q_{Γ} / I_{Γ}

(in brief,

Λ = Q / I

) denote the bound quiver algebra generated by all the paths in Q bounded by an admissible ideal

I_{Γ}

generated by the following relations:

\begin{matrix} C_{m_{i}}^{μ (m_{i})} - C_{m_{j}}^{μ (m_{j})} & if m_{i}, m_{j} \in M_{s}, for some 1 \leq s \leq k (see 3) . \\ C_{m_{i}}^{μ (m_{i})} f & if f is the first arrow of C_{m_{i}} . C_{m_{i}}^{2} \in I_{Γ}, if v a l (m_{i}) = 1 . \\ α_{r}^{m_{i}} α_{s}^{m_{j}} & if α_{r}^{m_{i}} α_{s}^{m_{j}} \in k Q_{Γ}, α_{r}^{m_{i}} \in C_{m_{i}}, α_{s}^{m_{j}} \in C_{m_{j}}, and m_{i} \neq m_{j} . \end{matrix}

(10)

We recall [18] that a multiserial algebra is defined to be a finite dimensional algebra

A

such that, for every indecomposable projective left and right

A

-module P, the corresponding radical

r a d (P)

is a sum of uniserial modules (an

A

-module M is said to be uniserial if it has a unique composition series), i.e.,

r a d (P) = \sum_{j = 1}^{m} V_{j}

, where, for some integer m and uniserial modules

V_{j}

, it holds that if

i \neq j

, then

V_{i} \cap V_{j}

is either 0 or a simple

A

-module.

Remark 2.

Green, Schroll and Sierra proved the following results regarding the structure of Brauer configuration algebras (see [18] Theorem B, Proposition 2.7, Theorem 3.10, Corollary 3.12 and [41] Theorem 4.9).

There is a bijective correspondence between the set of indecomposable projective Λ-modules and the polygons in Γ.
P is an indecomposable projective Λ-module corresponding to a polygon V in Γ. Then, $rad P$ 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.
A Brauer configuration algebra is a multiserial algebra.
The number of summands in the heart $h t (P) = rad P / soc P$ of an indecomposable projective Λ-module P such that ${rad}^{2} P \neq 0$ equals the number of non-truncated vertices of the polygons in Γ corresponding to P counting repetitions.
Let Λ be the Brauer configuration algebra associated with a connected Brauer configuration Γ. The algebra Λ has a length grading induced from the path algebra $k Q$ if and only if there is an $N \in Z_{> 0}$ such that, for each non-truncated vertex, $α \in Γ_{0}$ $v a l (α) μ (α) = N$ . In such a case, we say that the algebra Λ has the length grading property.
The formula $\dim_{k} Λ = 2 | M | + \sum_{m_{i} \in M} v a l (m_{i}) (μ (m_{i}) v a l (m_{i}) - 1)$ gives the dimension of the Brauer configuration $Λ = k Q_{Γ} / I_{Γ}$ (see (3) and (8)).
The dimension of the center $Z (Λ)$ of a connected and reduced Brauer configuration algebra Λ is given by the formula $\dim_{k} Z (Λ) = 1 + \sum_{m \in M} μ (m) + | M | - | M | + # (L o o p s Q) - | C_{Γ} |$ , where $| C_{Γ} | = {α \in Γ_{0} ∣ v a l (α) = 1, a n d μ (α) > 1}$ .

2.3. Cayley Graphs

If G is a group and

S \subseteq G

, then the Cayley graph

C_{(G, S)}

induced by the system

(G, S)

is an undirected graph whose set of vertices

V_{C_{(G, S)}} = G

. In such a case, two elements

g_{1}, g_{2} \in G

are connected by an edge e, if there is an element

s \in S

such that

g_{1} s = g_{2}

Cayley graphs are helpful tools in modeling interconnection networks. The vertices of the graph correspond to processing elements such as memory modules or switches, and the edges correspond to communication lines. For example, the Connection Machine has a network architecture that the 12-dimensional binary hypercube can model. Akers and Krishnamurthy introduced star and pancake graphs. They found that networks modeled by these types of graphs are superior to the binary n-cube when measured by degrees, diameter and connectivity. They found that networks based on star graphs possess the maximum connectivity and minimal degradation in the presence of faults [42].

The butterfly network and the cube-connected cycle network are vertex-symmetric graphs that are widely accepted as models for network architectures. An n-dimensional butterfly is a symmetric Cayley graph whose set of vertices

V = {0, 1}^{n} \times {i ∣ 0 \leq i \leq n}

. Two vertices,

(x, i)

and

(y, j)

, are connected if and only if

j = i + 1

and either

x = y

or x and y only differ in the jth bit.

The following result gives the Cayley graph structure induced by group generator sets.

Proposition 1

([42], Proposition 1.1). Let S be a set of generators for a group G. The Cayley graph

C_{(G, S)}

has the following properties:

1.: $C_{(G, S)}$ is a connected regular graph of degree equal to the cardinality of S;
2.: $C_{(G, S)}$ is a vertex-symmetric graph.

Let n be a positive integer and

n = {1, 2, 3, \dots, n - 1, n}

. The n-dimensional pancake graph denoted by

P_{n}

is a graph

(V_{P_{n}}, E_{P_{n}})

whose set of vertices

V_{P_{n}} = {u_{1} u_{2} \dots u_{n} ∣ u_{i} \in n, u_{i} \neq u_{j} if i \neq j}

. Two vertices

U = u_{1} u_{2} \dots u_{n}

and

V = v_{1} v_{2} \dots v_{n}

are connected by an edge

e \in E_{P_{n}}

v_{j} = u_{i - j + 1}

for all

1 \leq j \leq i

2 \leq i \leq n

. A sequence of the form

{U_{1}, U_{2}, \dots, U_{n}}

denotes a sequence of vertices in

P_{n}

; e denotes the vertex

123 \dots n

. A pancake graph

P_{n}

is an

(n - 1)

-regular graph with

n!

vertices.

The star graph

S T_{n}

is defined to be the Cayley graph of the symmetric group

S_{n}

with respect to the generating set of transpositions

S = {(1, 2), (1, 3), \dots, (1, n)}

. Therefore,

S T_{n}

is a vertex transitive graph on

n!

vertices with each vertex having degree

n - 1

The transposition graph

G_{Δ} = (V_{G_{Δ}}, E_{G_{Δ}})

is a tool to represent graphically a set of transpositions

Δ \subset S_{n}

. In such a case,

V_{G_{Δ}} \subseteq {1, 2, \dots, n}

and two vertices i and j are connected if the transposition

(i, j) \in Δ

. Figure 3 shows the transposition graphs of the star graph

S T_{n}

and the pancake graph

P_{n}

As an example, Figure 4 and Figure 5 show the way that the Cayley graph

C_{(K, S)}

(

K = {e, a, b, a b ∣ a^{2} = b^{2} = {(a b)}^{2} = e}

S = {a, b}

) induces a Brauer quiver

Q_{C_{(K, S)}} = C_{a} C_{a b} C_{b} C_{e}

. In this case,

μ (x) = 1

, for any

x \in K

. Oriented cycles

C_{x} = α_{1}^{x} α_{2}^{x}

are attached to each

x \in K

Relations of the form (11) generate the ideal

I_{C_{(K, S)}}

such that

Λ_{C_{K, S}} = k Q_{C_{(K, S)}} / I_{C_{(K, S)}}

is a bound quiver algebra (Brauer configuration algebra). The same procedure can be applied to any graph

G

for which the degree

d e g (x) \geq 2

for any vertex

x \in V_{G}

\begin{matrix} α_{1}^{x} α_{2}^{x} α_{1}^{x}, & α_{2}^{x} α_{1}^{x} α_{2}^{x} . \\ α_{1}^{a} α_{2}^{a} & = α_{1}^{a b} α_{2}^{a b}, α_{1}^{a} α_{2}^{a} = α_{1}^{e} α_{2}^{e} . \\ α_{1}^{b} α_{2}^{b} & = α_{1}^{a b} α_{2}^{a b}, α_{1}^{b} α_{2}^{b} = α_{1}^{e} α_{2}^{e} . \\ α_{i}^{x} α_{j}^{x} α_{i}^{x}, & for all possible values of i, j and x . \end{matrix}

(11)

2.4. Nilpotent Graphs

A nilpotent graph

N (R)

induced by a commutative ring (e.g.,

Z_{n}

) has

V_{N (R)} = R ∖ N i l (R)

as a set of vertices, where

N i l (R)

denotes the set of nilpotent elements of R. Two elements

i, j \in V_{N (R)}

are connected by an edge

e \in E_{N (R)}

provided that

i + j \in N i l (R)

Nilpotent graphs associated with commutative rings have been studied by Chen, Khojasteh et al., Basnet et al. and Riyas et al. [5,6,17]. The following Remark 3 describes some properties of the nilpotent graphs associated with commutative rings of type

Z_{n}

. These results are used to prove Theorems 3–5.

Remark 3.

Basnet et al. (see [6], Lemma 2.1, Corollaries, 2.2, 2.4 and 2.5) proved that if a positive integer n can be written as a product of distinct odd prime numbers with the form

n = p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{t}^{a_{t}}

, then the nilpotent graph

N (Z_{n})

induced by a commutative ring of type

Z_{n}

is bipartite and consists of

⌊ \frac{p_{1} p_{2} \dots p_{t}}{2} ⌋

disjoint complete bipartite subgraphs with

| N i l (Z_{n}) |

vertices of degree

| N i l (Z_{n}) |

, denoted

K_{| N i l (Z_{n}) |, | N i l Z_{n} |}

. Furthermore,

N (Z_{2^{s}})

is complete for

s \geq 1

Basnet et al. [6] also proved that if, in the product

n = p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{t}^{a_{t}}

p_{1} = 2

, and for

2 \leq j \leq t

p_{j}

is an odd prime, then the nilpotent graph

N (Z_{n})

consists of one complete subgraph of order

| N i l (Z_{n}) |

and its complement is bipartite, which is a union of disjoint complete bipartite subgraphs of type

K_{| N i l (Z_{n}) |, | N i l Z_{n} |}

. In particular,

d e g (x) \in {| N i l (Z_{n}) |, | N i l (Z_{n}) | - 1}

x \in V_{N (Z_{n})}

Figure 6 shows the nilpotent graph

N (Z_{8})

whose set of vertices is

Z_{8} ∖ {0, 2, 4, 6} = Z_{8} ∖ N i l (Z_{8})

. The sums

1 + 7

1 + 5

1 + 3

3 + 7

3 + 5

and

5 + 7

define the edges

e_{1} = {1, 7}

e_{2} = {1, 5}

e_{3} = {1, 3}

e_{4} = {3, 7}

e_{5} = {3, 5}

and

e_{6} = {5, 7}

, respectively.

It is easy to see that if

G = (Z_{2^{n}}, +)

is a

2^{n}

-element additive group group (

n \geq 1

) and

S = G ∖ {0}

, then the Cayley graph

C_{(G, S)}

and the nilpotent graph

N (Z_{2^{n + 1}})

coincide as a consequence of Remark 3.

2.5. Quantum Entanglement Theory

A qubit or quantum bit is a quantum system

Q

whose state lies in a two-dimensional Hilbert space H.

A qubit is the most elementary unit of quantum information. It is a generalization of the notion of a bit in classical computing. A qubit can have two indistinguishable orthogonal states, denoted

| 0 〉

and

1 〉

. In such a case, a qubit can be prepared as or transformed into any superposition of these two states, i.e.,

| φ_{q u b i t} 〉 = α_{0} | 0 〉 + α_{1} | 1 〉, α_{i} \in C, α_{1}^{2} + α_{2}^{2} = 1 .

(12)

A photon is an ideal candidate for a qubit.

Q_{1}, Q_{2}, \dots, Q_{n}

are quantum systems with underlying Hilbert spaces

H_{1}, H_{2}, \dots, H_{n}

, respectively. The global quantum system

Q

is defined in such a way that its underlying Hilbert space

H

is given by the following identity:

H = ⨂_{i = 1}^{n} H_{i} .

(13)

The following identities hold:

\begin{matrix} [\begin{matrix} 1 \\ 0 \end{matrix}] & = | 0 〉, \\ [\begin{matrix} 0 \\ 1 \end{matrix}] & = | 1 〉, \\ [\begin{matrix} 1 \\ 0 \end{matrix}] \otimes [\begin{matrix} 1 \\ 0 \end{matrix}] & = | 0 〉 \otimes | 0 〉 = | 00 〉 = | 0 〉 = [\begin{matrix} 1 \\ 0 \\ 0 \\ 0 \end{matrix}], \\ [\begin{matrix} 1 \\ 0 \end{matrix}] \otimes [\begin{matrix} 0 \\ 1 \end{matrix}] & = | 0 〉 \otimes | 1 〉 = | 01 〉 = | 1 〉 = [\begin{matrix} 0 \\ 1 \\ 0 \\ 0 \end{matrix}], \\ [\begin{matrix} 0 \\ 1 \end{matrix}] \otimes [\begin{matrix} 1 \\ 0 \end{matrix}] & = | 1 〉 \otimes | 0 〉 = | 10 〉 = | 2 〉 = [\begin{matrix} 0 \\ 0 \\ 1 \\ 0 \end{matrix}], \\ [\begin{matrix} 0 \\ 1 \end{matrix}] \otimes [\begin{matrix} 0 \\ 1 \end{matrix}] & = | 1 〉 \otimes | 1 〉 = | 11 〉 = | 3 〉 = [\begin{matrix} 0 \\ 0 \\ 0 \\ 1 \end{matrix}] . \end{matrix}

(14)

Entanglement is a property of more than one quantum system such that the state of one system cannot be seen independently of the other’s. It is the main source for many types of quantum information processing (e.g., quantum computing).

n = 2

, we assume that the quantum systems

Q_{1}

and

Q_{2}

have been separately prepared in states

| φ_{1} 〉

and

| φ_{2} 〉

, and that they have been united without interacting. Thus, they lie in distinct Hilbert spaces

H_{1}

and

H_{2}

. In such a case, the physical predictions relating to one of these quantum systems do not depend in any way on the other quantum system.

The global quantum state

Q

is called the juxtaposition of the quantum system

Q_{1}

and

Q_{2}

. The state of the global quantum system

Q

| φ_{1} 〉 \otimes | φ_{2} 〉

. If

Q_{1}

and

Q_{2}

are two qubits separately prepared in the states

\frac{1}{\sqrt{2}} (| 0 〉 + | 1 〉)

and

\frac{1}{\sqrt{2}} (| 0 〉 + | 1 〉)

, then the state

| φ 〉

of the global system

Q

is given by the following identity:

| φ 〉 = \frac{1}{2} (| 00 〉 + | 01 〉 + | 10 〉 + | 11 〉) .

(15)

Greenberger–Horne–Zeilinger (

G H Z

) and Dicke states

D_{n}^{k}

are classes of entangled states defined by the following identities:

\begin{matrix} | G H Z_{n}^{d} 〉 & = \frac{1}{\sqrt{d}} \sum_{i = 0}^{d - 1} {| i 〉}^{\otimes n} . \\ | D_{n}^{k} 〉 & = \frac{1}{\sqrt{(\binom{n}{k})}} \hat{S} {(| 0 〉}^{\otimes (n - k)} {| 1 〉}^{\otimes k}) . \end{matrix}

(16)

where n is the number of particles, k is the number of excitations, d is the dimension for every particle, and

\hat{S}

is the symmetrical operator that gives summation over all distinct permutations of the n particles.

Zeilinger et al. [28,29,30] realized experimental setups based on entanglement by path identity to build

| G H Z_{n}^{2} 〉

and

| D_{n}^{1} 〉 = | W_{n} 〉

states. In the experiment, to create a

| G H Z_{4}^{2} 〉

state, four crystals were pumped coherently (crystals I and II had mode number

| 00 〉

, whereas crystals III and IV had mode number

| 11 〉

), and the pump power was set in such a way that pairs were produced with reasonable probabilities. They generalized the setup to find any

| G H Z_{n}^{d} 〉

state for

n > 1

and

d = 2

The final quantum state was obtained by post-selection on four-fold coincidences, which meant that all four detectors clicked simultaneously. They associated with each of these experiments a suitable undirected graph

G_{| φ 〉}

whose edges were labeled by appropriate quantum states (qubits). They calculated the tensor product of the labels attached to the perfect matchings of

G_{| φ 〉}

and the sum of all these tensor products gave the state of the system (

| G H Z_{n}^{2} 〉

| G H Z_{4}^{3}

| W_{n} 〉

| D_{n}^{n / 2} 〉

| D_{n}^{m} 〉

0 < m < n

Figure 7 and Figure 8 show a setup of type

G H Z_{4}^{2}

, the induced undirected graph

G_{| G H Z_{4}^{2} 〉}

(see [28,29,30]) and its perfect matchings giving the state

| G H Z_{4}^{2} 〉 = | 0000 〉 + | 1111 〉

. Meanwhile, Figure 9 and Figure 10 show a setup of type

W_{4}

and its induced graph

G_{| W_{4} 〉}

| W_{4} 〉 = | 0001 〉 + | 0010 〉 + | 0100 〉 + | 1000 〉

. The general

| W_{n} 〉

state gives rise to the so-called

O l i v e r_{n} = G_{| W_{n} 〉}

graph [30].

In the last few years, quantum entanglement and quantum computing have paved the way for cryptography research. Nowadays, asymmetric cryptographic algorithms, used in key exchange protocols, appear to be most vulnerable to compromise by known quantum algorithms, specifically by Shor’s algorithm. For instance, 2300 logical qubits are required to break the cryptographic system RSA based on the factoring problem. Given this potential threat to cybersecurity, the National Institute of Standards (NIST) began a process in 2016 to select and standardize replacement asymmetric cryptographic algorithms that are quantum-secure. The process was completed in 2022, when it was announced that CRYSTALS-KYBER and CRYSTALS-Dillitium were the new standards for post-quantum cryptography.

Jacques et al. implemented Grover oracles for the quantum key search on the Advanced Encryption Standard (AES). Grover’s search algorithm gives a quantum attack against block cyphers. Furthermore, Yin et al. developed, in a laboratory, a quantum key distribution (QKD) method to share secret keys based on quantum entanglement [43,44,45].

3. Main Results

This section gives the main characteristics of the Brauer configuration algebras associated with Cayley graphs, star graphs, pancake graphs, butterfly graphs and some nilpotent graphs. Section 3.3 is devoted to the study of the Brauer configuration algebras induced by setups of type

G H Z_{n}^{d}

W_{n}

and

D_{n}^{m}

d \in {2, 3}

m = n / 2

n \geq 4

3.1. Brauer Configuration Algebras Induced by Cayley Graphs

The following result provides the algebraic properties of the Brauer configuration algebras induced by some Cayley graphs.

Theorem 1.

The Brauer configuration algebra

Λ_{C_{(G, S)}}

induced by the Cayley graph

C_{(G, S)}

of a group G generated by a set S is connected and

\begin{matrix} \dim_{k} Λ_{C_{(G, S)}} & = {| G | | S |}^{2} . \\ \dim_{k} Z (Λ_{C_{(G, S)}}) & = 1 + \frac{| G | | S |}{2} . \end{matrix}

(17)

Proof.

Λ_{C_{(G, S)}}

is connected as a consequence of Proposition 1, which states that the Cayley graph

C_{(G, S)}

is connected. On the other hand, we note that the Brauer configuration

Γ^{C_{(G, S)}}

induced by the Cayley graph

C_{(G, S)}

has non-truncated vertices, and the number of polygons

| Γ_{1}^{C_{(G, S)}} |

\frac{| G | | S |}{2}

provided that

C_{(G, S)}

| S |

-regular.

Since the Brauer quiver

Q_{C_{(G, S)}}

has no loops, the Formula (17) holds as a consequence of Remark 2. We are finished. □

As an example, we note that (see Figure 5)

\begin{matrix} v a l (x) & = 2 for all x \in K, | Q_{1} | = | Γ_{0}^{C_{(K, {a, b})}} | = 4, # L o o p s (Q_{C_{K, {a, b}}}) = 0 . \\ \dim_{k} Λ_{C_{(K, {a, b})}} & = 2 | Q_{1} | + 2 (1) (4) = 16 . \\ \dim_{k} Z (Λ_{C_{(K, {a, b})}}) & = 1 + | Q_{1} | = 5 . \end{matrix}

(18)

The following proposition gives the properties of the Brauer configuration algebra

Λ_{B_{n}}

induced by the butterfly graph

B_{n}

Proposition 2.

The Brauer configuration algebra

Λ_{B_{n}}

induced by an n-dimensional butterfly graph is connected and it holds that

\begin{matrix} \dim_{k} Λ_{B_{n}} & = 2^{n} (16 n - 10) . \\ \dim_{k} Z (Λ_{B_{n}}) & = 1 + n 2^{n + 1} . \end{matrix}

(19)

Proof.

Since

B_{n}

is connected,

Λ_{B_{n}}

is connected. Furthermore,

Λ_{B_{n}}

is reduced and the Brauer quiver induced by

B_{n}

has no loops. Formula (19) hold considering that if

(w, x) \in V_{B_{n}}

, then

v a l (w, x) = 2

(

v a l (w, x) = 4

) if

x \in {0, n}

(

1 \leq x \leq n - 1

) and

| E_{B_{n}} | = n 2^{n + 1}

. □

Corollary 1 establishes relationships between the Brauer configuration algebras induced by pancake and star graphs.

Corollary 1.

For any

n > 2

, the Brauer configuration algebras

Λ_{P_{n}}

and

Λ_{S_{n}}

induced by the nth pancake graph and the nth star graph defined by the transposition graphs shown in Figure 3 are isomorphic.

Proof.

Since

P_{n}

and

S_{n}

are

(n - 1)

-regular, connected graphs with

n!

vertices, it holds that

\dim_{K} Λ_{P_{n}} = \dim_{k} Λ_{S_{n}}

for any

n > 2

. □

Figure 11 shows the butterfly graph

B_{2}

and its induced Brauer quiver bounded by relations of the following types:

$α_{i}^{a} α_{j}^{a} α_{i}^{a}$ , for all possible values of $i, j$ , $a \in {x_{1}, x_{2}, x_{3}, x_{4}, x_{1}^{''}, x_{2}^{''}, x_{3}^{''}, x_{4}^{''}}$ ;
$α_{i_{1}}^{b} α_{i_{2}}^{b} α_{i_{3}}^{b} α_{i_{4}}^{b} α_{i_{1}}^{b}$ , for all possible values of $i_{1}, i_{2}, i_{3}, i_{4}$ , $b \in {x_{1}^{'}, x_{2}^{'}, x_{3}^{'}, x_{4}^{'}}$ ;
$α_{i}^{x} α_{j}^{y}$ , if $x \neq y$ , for all possible values of $i, j$ ;
$C^{a} - C^{b}$ , if a and b are endings of the same vertex $e \in E_{B_{2}}$ and $C^{x}$ denotes a special cycle associated with the vertex $x \in V_{B_{2}}$ .

The successor sequences are given by the following identities:

\begin{matrix} S_{x_{1}} & = e_{1} < e_{2}, S_{x_{1}^{''}} = e_{9} < e_{11}, \\ S_{x_{2}} & = e_{3} < e_{4}, S_{x_{2}^{''}} = e_{10} < e_{12}, \\ S_{x_{3}} & = e_{5} < e_{6}, S_{x_{3}^{''}} = e_{13} < e_{15}, \\ S_{x_{4}} & = e_{7} < e_{8}, S_{x_{4}^{''}} = e_{14} < e_{16}, \\ S_{x_{1}^{'}} & = e_{1} < e_{5} < e_{9} < e_{10}, \\ S_{x_{2}^{'}} & = e_{3} < e_{7} < e_{11} < e_{12}, \\ S_{x_{3}^{'}} & = e_{2} < e_{6} < e_{13} < e_{14}, \\ S_{x_{4}^{'}} & = e_{4} < e_{8} < e_{15} < e_{16} . \end{matrix}

(20)

Figure 11. Butterfly graph

B_{2}

and its induced Brauer quiver.

Figure 11. Butterfly graph

B_{2}

and its induced Brauer quiver.

Figure 12 shows the star graph

S T_{3}

induced by the transposition graph shown in Figure 3 for

n = 3

The following Theorem 2 defines Hamiltonian Brauer quivers.

Theorem 2.

Let

M = (M, M_{1}, μ, O)

be a Brauer configuration for which

$M_{1}$ is a collection of multisets ${(M_{1}, f_{1}), (M_{2}, f_{2}), \dots, (M_{n}, f_{n})}$ ;
$M = ⋃_{i = 1}^{n} (M_{i}, f_{i})$ ;
$μ (x) = 1$ ( $μ (x) = 2$ ) if $v a l (x) > 1$ ( $v a l (x) = 1$ ) for any $x \in M$ ;
$(M_{i}, f_{i}) < (M_{j}, f_{j})$ if $i < j$ in the successor sequences associated with the vertices;
$N = ⋂_{i = 1}^{n} (M_{i}, f_{i}) \neq ⌀$ . For $1 \leq i \leq n$ , $f_{i} (x) = 1$ if $x \in N$ .

Then, the Brauer quiver

Q_{M}

induced by the Brauer configuration

M

and bounded by relations of type (10) is Hamiltonian, and the number

h_{M}

of Hamilton cycles is

h_{M} = n | N |

Proof.

The successor sequence

S_{x}

x \in N

has the form

S_{x} = M_{1} < M_{2} < \dots < M_{n - 1} < M_{n}

(21)

Then,

S_{x}

induces n non-disjunctive Hamiltonian paths in the Brauer quiver

Q_{M}

. On the other hand, since the product of the arrows in different successor sequences belongs to the ideal

I_{Q_{M}}

, it holds that

h_{M} = n | N |

. We are finished. □

The following result proves that the transposition graph

S_{n}

gives rise to bounded Hamiltonian digraphs.

Corollary 2.

Let

Q_{S_{n}}

be the Brauer quiver induced by the transposition graph of the star graph

S T_{n}

and bounded by relations of type (10) (see Figure 3 and Corollary 1); then,

Q_{S_{n}}

is Hamiltonian.

Proof.

The successor sequence of the vertex

1 \in V_{S_{n}}

has the form

S_{1} = e_{1} < e_{2} \dots < e_{n - 2} < e_{n - 1}

(22)

where

e_{i} = {i, i + 1}

1 \leq i \leq n - 1

S_{1}

induces

n - 1

Hamiltonian paths in the Brauer quiver

Q_{S_{n}}

. □

Corollary 3 gives closed formulas for the dimension of the Brauer configuration algebra induced by a transposition graph.

Corollary 3.

Let

Λ_{S_{n}}

be the Brauer configuration algebra induced by the transposition graph of the star graph

S T_{n}

with

n > 2

; then,

\begin{matrix} \dim_{k} Λ_{S_{n}} & = n^{2} - 1 . \\ \dim_{k} Z (Λ_{S_{n}}) & = 2 n - 1 . \end{matrix}

(23)

Proof.

Note that

Q_{S_{n}}

has

n - 1

vertices and

n - 1

loops,

v a l (1) = n - 1

and

v a l (j) = 1

, for any

j \neq 1

. Thus,

\dim_{k} Λ_{S_{n}} = 2 (n - 1) + (n - 1) (n - 2) + (n - 1) = (n - 1) (2 + n - 2 + 1) = (n - 1) (n + 1)

. Furthermore,

\dim_{k} Z (Λ_{S_{n}}) = 1 + 2 (n - 1) + 1 - n + n - 1 + n - 1 - n + 1 = 2 n - 1

. We are finished. □

3.2. Brauer Configuration Algebras Induced by Nilpotent Graphs

This section gives the properties of Brauer configuration algebras induced by nilpotent graphs defined by commutative rings of type

Z_{n}

Theorem 3 and Corollary 4 give the properties of the Brauer configuration algebra

Λ_{N (Z_{2^{n}})}

for

n > 1

Theorem 3.

Let

Λ_{N (Z_{2^{n}})}

be the Brauer configuration algebra induced by the nilpotent graph

N (Z_{2^{n}})

over the commutative ring

Z_{2^{n}}

n > 1

. Then,

Λ_{N (Z_{2^{n}})}

satisfies the length grading property (see the fifth item of Remark 2) and

\begin{matrix} \dim_{k} Λ_{N (Z_{2^{n}})} & = 2 t_{2^{n - 1} - 1} + 2^{n} t_{2^{n - 1} - 2} . \\ \dim_{k} Z (Λ_{N (Z_{2^{n}})}) & = 1 + t_{2^{n - 1} - 1} . \end{matrix}

(24)

Proof.

Note that

H_{2^{n}} = Z_{2^{n}} ∖ N i l (Z_{2^{n}}) = {2 j - 1 ∣ 1 \leq j < 2^{n - 1}}

; then, if

i, j \in H_{2^{n}}

and

i \neq j

; then,

i = 2 k_{i} - 1

and

j = 2 k_{j} - 1

and

i + j \in N i l (Z_{2^{n}})

. Therefore, they can be connected by an edge

e \in E_{N (Z^{2^{n}})}

. Thus,

N (Z_{2^{n}})

is complete, its induced Brauer quiver is connected and the corresponding Brauer configuration is reduced. Since

v a l (j) = 2^{n - 1} - 1

, for any

j \in V_{N (Z_{2}^{n})}

, then

Λ_{N (Z_{2^{n}})}

has the length grading property.

We also note that a typical successor sequence

S_{2 j - 1}

induced by the Brauer configuration

Γ^{N (Z_{2^{n}})}

has the form

S_{2 j - 1} = (2 j - 1, 1) < \dots < (2 j - 1, 2 j - 3) < (2 j - 1, 2 j + 1) < \dots < (2 j - 1, 2^{n} - 1) .

(25)

where

(2 j - 1, h) \in E_{N (Z_{2^{n}})}

(2 j - 1, h) \in S_{h}

, if

h < 2 j - 1

. Then,

N (Z_{2^{n}})

has

t_{2^{n - 1} - 1}

edges and

2^{n - 1}

vertices. Therefore,

d i m_{k} Λ_{N (Z_{2^{n}})} = 2 t_{2^{n - 1} - 1} + 2^{n - 1} (2^{n - 1} - 1) (2^{n - 1} - 2) = 2 t_{2^{n - 1} - 1} + 2^{n} t_{2^{n - 1} - 2}

. Furthermore,

\dim_{k} Z (Λ_{N (Z_{2^{n}})}) = 1 + t_{2^{n - 1} - 1}

provided that

N (Z_{2^{n}})

has no loops. □

The following Corollary proves that Brauer quivers of type

Q_{N (2^{n})}

are not Hamiltonian.

Corollary 4.

Let

Q_{N (Z_{2^{n}})}

be the Brauer quiver induced by the nilpotent graph

N (Z_{2^{n}})

; then,

Q_{N (Z_{2^{n})}}

is not Hamiltonian for all positive integers n.

Proof.

The longest cycle in

Q_{N (Z_{2^{n})}}

has

2^{n - 1} - 1

arrows and

| V_{Q_{N (Z_{2^{n})}}} | = t_{2^{n - 1} - 1} = \frac{2^{n - 1} (2^{n - 1} - 1)}{2}

. We are finished. □

As an example, the following are the successor sequences induced by the nilpotent graph

N (Z_{8})

shown in Figure 13. Brauer quivers

Q_{N_{Z_{8}}}

and

Q_{N_{Z_{16}}}

induced by

N (Z_{8})

and

N (Z_{16})

are shown in Figure 13 and Figure 14, respectively.

\begin{matrix} S_{1} & = (1, 3) < (1, 5) < (1, 7) . \\ S_{3} & = (3, 1) < (3, 5) < (3, 7) . \\ S_{5} & = (5, 1) < (5, 3) < (5, 7) . \\ S_{7} & = (7, 1) < (7, 3) < (7, 5) . \end{matrix}

(26)

The Brauer quiver

Q_{N (Z_{2^{n}})}

n > 1

, is bounded by relations of the following form.

$α_{i_{1}}^{a} α_{i_{2}}^{a} \dots α_{i_{2^{n - 1} - 1}}^{a} - α_{j_{1}}^{b} α_{j_{2}}^{b} \dots α_{j_{2^{n - 1} - 1}}^{b}$ , for all possible values of $i_{k}, j_{k}$ ,
$k \in {1, 2, \dots, 2^{n - 1} - 1}$ , ${a, b} \in E_{N (Z_{2^{n}})}$ .
$α_{i_{1}}^{a} α_{i_{2}}^{a} \dots α_{i_{2^{n - 1} - 1}}^{a} α_{i_{1}}^{a}$ , for all possible values of $i_{k}$ , $a \in {1, 3, 5, \dots, 2^{n} - 1}$ .
$α_{i}^{a} α_{j}^{b}$ , if $a \neq b$ . $a, b \in {1, 3, 5, \dots, 2^{n - 1} - 1}$ .

Theorem 4 gives a closed formula for the dimension of a Brauer configuration algebra induced by the commutative ring

Z_{2^{n} p_{1} p_{2} \dots p_{s}}

, where

p_{j}

is an odd prime number.

Theorem 4.

Let

Λ_{N (Z_{t})}

be the Brauer configuration algebra induced by the nilpotent graph

N (Z_{t})

with

t = 2^{n} p_{1} p_{2} \dots p_{s}

n > 1

p_{j}

an odd prime number for each

1 \leq j \leq s

p_{i} \neq p_{j}

i \neq j

. Then,

\dim_{k} Λ_{N (Z_{t})} = 2 | Q_{1} | + 2^{n + 1} (p_{1} p_{2} \dots p_{k} - 1) t_{2^{n - 1} - 1} + 2^{n} t_{2^{n - 1} - 2} .

(27)

where

| Q_{1} | = (p_{1} p_{2} \dots p_{s} - 1) 2^{n - 1} + (2 p_{1} p_{2} \dots p_{s} - 1) t_{2^{n - 1} - 1}

Proof.

Firstly, we note that

| N i l (Z_{t}) = 2^{n - 1} |

. In fact, if

h = 2 p_{1} p_{2} \dots p_{s}

, then

N i l (Z_{t}) = {j h ∣ 1 \leq j \leq 2^{n - 1}}

Let

Γ^{N (Z_{t})}

be the Brauer configuration defined by the nilpotent graph

N (Z_{t})

; then, according to Remark 3, it holds that

\begin{matrix} | {α \in Γ_{0}^{N (Z_{t})} ∣ v a l (α) = 2^{n - 1}} | & = 2^{n} (h / 2 - 1) . \\ | {α \in Γ_{0}^{N (Z_{t})} ∣ v a l (α) = 2^{n - 1} - 1} | & = 2^{n - 1} . \\ | E_{N (Z_{t})} | & = | Q_{1} | . \end{matrix}

(28)

| Q_{1} |

can be found by building successor sequences as in the proof of Theorem 3 and enumerating their edges without taking into account repetitions. In such a case, we note that there are

h / 2 - 1

successor sequences with

2^{n - 1}

edges, and

h - 1

sequences with

2^{n - 1} - j

edges,

1 \leq j \leq 2^{n - 1} - 1

. Then,

| Q_{1} | = (h / 2 - 1) 2^{n - 1} + (h - 1) t_{2^{n - 1} - 1} .

(29)

Thus,

\dim_{k} Λ_{N (Z_{t})} = 2 | Q_{1} | + 2^{n} (h / 2 - 1) (2^{n - 1}) (2^{n - 1} - 1) + 2^{n - 1} (2^{n - 1} - 1) (2^{n - 1} - 2) = 2 | Q_{1} | + 2^{n + 1} (h / 2 - 1) t_{2^{n - 1} - 1} + 2^{n} t_{2^{n - 1} - 2}

. We are finished. □

The following result gives a closed formula for the dimension of a Brauer configuration algebra induced by a graph

N (Z_{p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{t}^{a_{t}}})

, where

p_{j}

1 \leq j \leq t

is an odd prime number and

a_{i}

is a positive integer

1 \leq i \leq t

Theorem 5.

Let

Λ_{N (Z_{n})}

be a Brauer configuration algebra induced by the nilpotent graph

N (Z_{n})

, where

p

is a product of the form

n = p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{t}^{a_{t}}

, where, for each

1 \leq j \leq t

a_{j}

is a positive integer and

p_{j}

is an odd prime number,

p_{i} \neq p_{j}

i \neq j

. Then,

\dim_{k} Λ_{N (Z_{n})} = 2 ⌊ \frac{p}{2} ⌋ | N i l (Z_{n}) | (| N i l (Z_{n}) | + 2 t_{| N i l (Z_{n}) | - 1}) .

(30)

where

p = p_{1} p_{2} \dots p_{t}

Proof.

It is a consequence of the results mentioned in Remark 3. Firstly, we note that

| V_{N (Z_{n})} | = 2 | N i l (Z_{n}) | ⌊ \frac{p}{2} ⌋

and

| E_{N (Z_{n})} | = | N i l (Z_{n}) |^{2} ⌊ \frac{p}{2} ⌋

. Since

{v a l (x) = | N i l (Z)}_{n} |

for any

x \in V_{N (Z_{n})} |

, it holds that

\dim_{k} Λ_{N (Z_{n})} = 2 {| N i l (Z_{n}) |}^{2} ⌊ \frac{p}{2} ⌋ + 4 | N i l (Z_{n}) | ⌊ \frac{p}{2} ⌋ t_{| N i l (Z_{n}) | - 1} .

(31)

We are finished. □

The following Corollary gives a closed formula for the dimension of a Brauer configuration algebra induced by components of some disconnected nilpotent graphs.

Corollary 5.

Let

Λ_{κ (N (Z_{n})})

be a Brauer configuration algebra induced by a component of the nilpotent graph

N (Z_{n})

mentioned in Theorem 5. Then,

\dim_{k} Z (Λ_{κ (N (Z_{n})}) = 1 + {| N i l (Z_{n}) |}^{2} .

(32)

Proof.

The Brauer configuration

Γ^{N (Z_{n})}

induced by the nilpotent graph

N (Z_{n})

is reduced and the corresponding Brauer quiver has no loops. The result follows taking into account that

| E (κ (N (Z_{n}))) | = | N i l (Z_{n}) |^{2}

. We are finished. □

3.3. Brauer Configuration Algebras Induced by Quantum Entanglements

This section describes the properties of the Brauer configuration algebras induced by the experimental setups developed by Zeilinger et al. [28,29,30] to derive quantum entanglement states of type

G H Z

W_{n}

and

D_{n}^{m}

The following theorem gives the property of the Brauer configuration algebras induced by setups of type

G H Z_{n}^{2}

given by Zeilinger et al. We let

M^{G H Z_{n}^{d}}

denote the Brauer configuration induced by a setup of type

G H Z_{n}^{d}

and

# C r y s t a l s

the number of crystals in the

G H Z_{n}^{2}

setup.

Theorem 6.

Setups of type

G H Z_{n}^{2}

(

n \geq 4

) induce Brauer configuration algebras

Λ_{G H Z_{n}^{2}}

with the following properties.

1.: $Λ_{G H Z_{n}^{2}}$ is connected.
2.: $Λ_{G H Z_{n}^{2}}$ has the length grading property.
3.: $\dim_{k} Λ_{G H Z_{n}^{2}} = 4 # C r y s t a l s$ , where k is an algebraically closed field.
4.: $\dim_{k} Z (Λ_{G H Z_{n}^{2}}) = 1 + # C r y s t a l s$ .
5.: The Brauer message of a labeled Brauer configuration $M (M^{G H Z_{n}^{2}})$ is the undirected graph $C_{n}$ ( $n \geq 4$ is an even integer), whose edges are labeled by the states $| 00 〉$ and $| 11 〉$ .
6.: If, in Remark 1 and Formulas (5) and (6), it holds that each term $F_{j}$ corresponds to a unique labeled perfect matching of $C_{n}$ obtained by applying a tensor product to its labels (i.e., $O_{h_{j}} = \otimes$ for all $F_{j}$ ) and $O_{s}$ is the usual sum in (6), then $M^{e} (M^{G H Z_{n}^{2}}) / \sqrt{2} = | G H Z_{n}^{2} 〉$ .

Proof.

Firstly, we note that the Brauer configuration $M^{G H Z_{n}^{2}} = (M_{0}^{G H Z_{n}^{2}}, M_{1}^{G H Z_{n}^{2}}, μ, O)$ has particles as a set of vertices $M_{0}^{G H Z_{n}^{2}} = {a_{1}, a_{2}, \dots, a_{n}}$ . The word-polygons in $M_{1}^{G H Z_{n}^{2}}$ are given by path particle coincidences. Therefore, if $M_{j} \in M_{1}^{G H Z_{n}^{2}}$ , then $w (M_{j}) = a_{j_{1}} a_{j_{2}}$ , which means that there are two paths containing particles $a_{j_{1}}, a_{j_{2}} \in M_{0}^{G H Z_{n}^{2}}$ .
$μ (a_{j}) = 1$ for any $a_{j} \in M_{0}^{G H Z_{n}^{2}}$ . Furthermore, if $M_{r} = {a_{r_{1}}, a_{r_{2}}} \in M_{1}^{G H Z_{n}^{2}}$ , $M_{s} = {a_{s_{1}}, a_{s_{2}}} \in M_{1}^{G H Z_{n}^{2}}$ , then $M_{r} < M_{s}$ in the successor sequences if $a_{r_{1}} = a_{s_{1}}$ and $r_{2} < s_{2}$ (the set of indices is endowed with the usual order of natural numbers) or $a_{r_{1}} = a_{s_{2}}$ and $r_{2} < s_{1}$ . Using the same arguments, we adopt ordering ${M_{r}, M_{s}}$ via $a_{r_{2}} \in M_{r}$ . Since the undirected graph associated with the state $| G H Z_{n}^{2} 〉$ is connected and its edges are in correspondence with the polygons in $M_{1}^{G H Z_{n}^{2}}$ , we conclude that $M^{G H Z_{n}^{2}}$ is connected.
$v a l (a_{j}) μ (a_{j}) = 2$ for any particle $a_{j} \in M_{0}^{G H Z_{n}^{2}}$ .
Since the number of crystals $# C r y s t a l s$ used by Zelinger et al. in their $G H Z_{n}^{2}$ setup equals $| M_{1}^{G H Z_{n}^{2}} |$ and $v a l (a_{j}) = 2$ , for any $a_{j} \in M_{0}^{G H Z_{n}^{2}}$ , it holds that $\dim_{k} Λ_{M^{G H Z_{n}^{2}}} = 2 | M_{1}^{G H Z_{n}^{2}} | + 2 (1) | M_{1}^{G H Z_{n}^{2}} | = 4 # C r y s t a l s$ .
The connected Brauer quiver $Q_{M^{G H Z_{n}^{2}}}$ induced by the Brauer configuration $M^{G H Z_{n}^{2}}$ has no loops and $v a l (a_{j}) = 2$ for any $a_{j} \in M_{0}^{G H Z_{n}^{2}}$ . Therefore, $\dim_{k} Z (Λ_{G H Z_{n}^{2}}) = 1 + | M_{1}^{G H Z_{n}^{2}} | = 1 + # C r y s t a l s$ .
Words defined by polygons in $M_{1}^{G H Z_{n}^{2}}$ are given by path particle coincidences. Then, we define an unoriented graph $G_{G H Z_{n}^{2}} = (V_{G H Z_{n}^{2}}, E_{G H Z_{n}^{2}})$ with $V_{G H Z_{n}^{2}} = M_{0}^{G H Z_{n}^{2}}$ and $E_{G H Z_{n}^{2}} = M_{1}^{G H Z_{n}^{2}}$ . In this case, two of these words $w (M_{i}) = a_{i_{1}} a_{i_{2}}$ and $w (M_{j}) = a_{j_{1}} a_{j_{2}}$ are concatenated if $M_{i} \cap M_{j} \neq ⌀$ . In such a case, a two-word concatenation $w (M_{i}) w (M_{j})$ defines a path in $G_{G H Z_{n}^{d}}$ and the message $M (M^{G H Z_{n}^{2}})$ obtained via such concatenation gives $G_{G H Z_{n}^{2}}$ . Since each coincidence corresponds to the mode number of a photon state, it labels the corresponding polygon (edge in $E_{G H Z_{n}^{2}}$ ).
Perfect matching $P M (G_{G H Z_{n}^{2}})$ gives a partition $F = {F_{1}, F_{2}, \dots, F_{p}}$ of $M_{1}^{G H Z_{n}^{2}}$ . Each specialized word $w^{e (F_{j})}$ is the tensor product of its edge labels. Then,

M^{e} (M^{G H Z_{n}^{2}}) = F_{1} + F_{2} + \dots F_{p} = \sqrt{2} | G H Z_{n}^{2} 〉 .

(33)

□

As an example, note that the Brauer quiver

Q_{C (K, S)}

shown in Figure 5 and induced by the four Klein group is isomorphic to the Brauer

Q_{M^{G H Z_{4}^{2}}}

induced by the quantum entanglement setup

G H Z_{4}^{2}

The following result is a version of Theorem 6 for generalized

G H Z_{n}^{3}

setups. We recall that the case

G H Z_{4}^{3}

is the only one that has been experimentally developed.

Theorem 7.

Setups of type

G H Z_{n}^{3}

(

n \geq 4

) induce Brauer configuration algebras

Λ_{G H Z_{n}^{3}}

with the following properties.

1.: $Λ_{G H Z_{n}^{3}}$ is connected.
2.: $Λ_{G H Z_{n}^{3}}$ has the length grading property.
3.: $\dim_{k} Λ_{G H Z_{n}^{3}} = # C r y s t a l s + 6 # p a r t i c l e s$ , where k is an algebraically closed field.
4.: $\dim_{k} Z (Λ_{G H Z_{n}^{3}}) = 1 + # C r y s t a l s$ .
5.: The Brauer message of a labeled Brauer configuration $M (M^{G H Z_{n}^{3}})$ is the undirected graph $G_{G H Z_{n}^{3}}$ obtained via the concatenation of consecutive complete graphs $K_{4}$ (see Figure 15 and Figure 16) whose edges are labeled by the states $| 00 〉$ , $| 11 〉$ and $| 22 〉$ .
6.: If the hypothesis in the sixth item of Theorem 6 holds for the graph $G_{G H Z_{n}^{3}}$ , then $M^{e} / \sqrt{3}$ = $| G H Z_{n}^{3} 〉$ .

Proof.

Similar constructions as those used in the proof of items (1), (2), (4), (5) and (6) prove that the Brauer configuration

M^{G H Z_{n}^{3}} = (M_{0}^{G H Z_{n}^{3}}, M_{1}^{G H Z_{n}^{3}}, μ, O)

is connected, the corresponding algebra

Λ_{G H Z_{n}^{3}}

has the length grading property and

M^{e} (M^{G H Z_{n}^{3}}) / \sqrt{3} = | G H Z_{n}^{3} 〉

. Moreover,

M_{0}^{G H Z_{n}^{3}}

has non-truncated vertices and the Brauer quiver

Q_{M^{G H Z_{n}^{3}}}

has no loops.

We also note that

| M_{1}^{G H Z_{n}^{3}} | = # C r y s t a l s = 6 + 5 (j - 2)

, if

n = 2 j

. Furthermore,

μ (a_{j}) = 1

and

v a l (a_{j}) = 3

, for any

a_{j} \in M_{0}^{G H Z_{n}^{3}}

. □

Figure 15 and Figure 16 show a generalized setup of type

G H Z_{n}^{3}

and its induced graph

G_{G H Z_{n}^{3}}

. The number of perfect matchings

# P M (G_{G H Z_{n}^{3}})

of the graph

G_{G H Z_{n}^{3}}

is given by the so-called Jacobsthal sequence

J_{n} = \frac{2^{n} - {(- 1)}^{n}}{3} = {0, 1, 1, 3, 5, 11, \dots}

n \geq 0

(A001045 in the Online Encyclopedia of Integer Sequences (OEIS) [46]).

Theorem 8 concerns Brauer configuration algebras induced by setups of type

D_{n}^{1} = W_{n}

. We assume the notation

a_{1}, a_{2}, \dots, a_{n}

for particles and that one crystal produces two-photon pairs in states

| 01 〉

and

| 10 〉

Paths associated with particles

a_{1}

and

a_{2}

are the only containing such a crystal. Defining, in this way, two identical word-polygons with different labels

M_{1} = (a_{1} a_{2}; | 10 〉)

and

M_{2} = (a_{1} a_{2}; | 01 〉)

, we let

L_{x}

denote the path length associated with a particle x in a setup of type

W_{n}

Figure 15. Generalized setup of type

G H Z_{n}^{3}

Figure 15. Generalized setup of type

G H Z_{n}^{3}

Figure 16. The graph

G_{G H Z_{n}^{3}}

induced by a generalized setup of type

G H Z_{n}^{3}

Figure 16. The graph

G_{G H Z_{n}^{3}}

induced by a generalized setup of type

G H Z_{n}^{3}

Theorem 8.

Setups of type

W_{n}

(

n \geq 4

) induce Brauer configuration algebras

Λ_{W_{n}}

with the following properties.

1.: $Λ_{W_{n}}$ is connected.
2.: $\dim_{k} Λ_{W_{n}} = 2 (# C r y s t a l s + 1) + 4 t_{# p a r t i c l e s - 1} + 6 (# p a r t i c l e s - 2)$ .
3.: $\dim_{k} Z (Λ_{W_{n}}) = # C r y s t a l s + 2$ .
4.: The Brauer message of a labeled Brauer configuration $M (M^{W_{n}})$ is the undirected graph $P_{2} \times S_{n}$ whose edges are labeled by the states $| 10 〉$ and $| 01 〉$ , where $P_{2}$ is the two-vertex path graph and $S_{n}$ is an n-vertex transposition graph (see Figure 3).
5.: If the hypothesis in the sixth item of Theorem 6 holds for $P_{2} \times S_{n}$ , then $M^{e} (M^{W_{n}}) / \sqrt{n} = | W_{n} 〉$ .

where

t_{j} = \frac{j (j - 1)}{2}

denotes the jth triangular number.

Proof.

The Brauer configuration $M^{W_{n}} = (M_{0}^{W_{n}}, M_{1}^{W_{n}}, μ, O)$ induced by a setup $W_{n}$ ( $n \geq 4$ is a fixed even integer) has the particles as a set of vertices $M_{0}^{W_{n}} = {a_{1}, a_{2}, \dots, a_{n}}$ , and word-polygons are defined by path coincidences. There are two polygons $M_{1} = (a_{1} a_{2}; | 10 〉)$ and $M_{2} = (a_{1} a_{2}; | 01 〉)$ defined by the same words with different labels. Since $(a_{1} a_{i}; | x_{1, 1} x_{1, 2} 〉), (a_{1} a_{j}; | x_{2, 1} x_{2, 2} 〉) \in M_{1}^{W_{n}}$ , with $1 \leq i, j \leq n$ , $| x_{1, 1} x_{1, 2} 〉 = | x_{2, 1} x_{2, 2} 〉 = | 10 〉$ if $i = 2$ and $j = 1$ , $| x_{1, 1} x_{1, 2} 〉 = | x_{2, 1} x_{2, 2} 〉 = | 01 〉$ , otherwise. The remaining word-polygons have the form $(a_{r} a_{s}; | 01 〉)$ , $r, s \notin {1, 2}$ , where $a_{r} a_{s}$ is an edge of the undirected graph induced by the setup. Furthermore, $μ (a_{j}) = 1$ for any $a_{j} \in M_{0}^{W_{n}}$ . The order in the successor sequences is given as in the proof of Theorem 6. These constructions allow us to conclude that the Brauer configuration $M^{W_{n}}$ is connected.
We note that $M_{1}^{W_{n}}$ contains polygon-words of the form $(a_{1} a_{i}; | x_{1, 1} x_{1, 2} 〉)$ , $(a_{2} a_{j}; | x_{2, 1} x_{2, 2} 〉)$ , $1 \leq i, j \leq n$ . Thus, $| M_{1}^{W_{n}} | = # C r y s t a l s + 1$ , $v a l (a_{1}) = v a l (a_{2}) = n = # p a r t i c l e s$ . The remaining $(# p a r t i c l e s - 2)$ -vertices have valency 3 (note that the undirected graph induced by the setup is given by a graph product of the form $P_{2} \times S_{n / 2}$ , where $S_{n / 2}$ is a transposition graph (see Figure 3)). The formula holds provided that $μ (a_{j}) = 1$ for any particle $a_{j} \in M_{0}^{W_{n}}$ .
The Brauer configuration $M^{W_{n}}$ is connected, $M_{0}^{W_{n}}$ consists of non-truncated vertices, and the induced Brauer quiver $Q_{M^{W_{n}}}$ has no loops. The formula follows as a consequence of the seventh item of Remark 2.
Words $a_{i} a_{j}$ associated with polygons of the form $(a_{i} a_{j}; | x_{1, 1} x_{1, 2} 〉) \in M_{1}^{W_{n}}$ are given by path–particle coincidences. Therefore, their concatenation defines an unoriented graph $G_{W_{n}} = (V_{W_{n}}, E_{W_{n}})$ with $V_{W_{n}} = M_{0}^{W_{n}}$ and $E_{W_{n}} = M_{1}^{W_{n}}$ . Since the concatenation is defined as in Theorem 6, it defines the undirected graph of the form $P_{2} \times S_{n}$ whose edges are labeled by photon states $| 10 〉$ and $| 01 〉$ .
This result holds by applying to the graph $G_{W_{n}}$ similar arguments as in the proof of Theorem 6.

□

The following result concerns the

D_{n}^{n / 2}

setups introduced by Zeilinger et al. [28,29,30] to derived Dicke states of type

| D_{n}^{n / 2} 〉

via the perfect matchings of its associated graph.

Corollary 6.

Let

Λ_{D_{n}^{n / 2}}

be the Brauer configuration algebra induced by a setup of type

D_{n}^{n / 2}

and a Brauer configuration

M^{D_{n}^{n / 2}} = (M_{0}^{D_{n}^{n / 2}}, M_{1}^{D_{n}^{n / 2}}, μ, O)

, whose set of vertices

M_{0}^{D_{n}^{n / 2}}

, labeled word-polygons

M_{1}^{D_{n}^{n / 2}}

, vertex-multiplicity μ and orientation

O

are defined as in Theorems 6–8, where labeled words have the forms

(a_{i} a_{j}; | 10 〉)

and

(a_{i} a_{j}; | 01 〉)

1 \leq i, j \leq n

. Then, for

n \geq 4

fixed, the Brauer configuration algebra

Λ_{D_{n}^{n / 2}}

satisfies the following properties.

1.: $Λ_{D_{n}^{n / 2}}$ is connected.
2.: $Λ_{D_{n}^{n / 2}}$ has the length grading property.
3.: $\dim_{k} Λ_{D_{n}^{n / 2}} = 4 (# C r y s t a l s) + (# p a r t i c l e s) t_{2 # p a r t i c l e s - 3})$ .
4.: $\dim_{k} Z (Λ_{D_{n}^{n / 2}}) = 2 # C r y s t a l s + 1$ .
5.: The Brauer message of a labeled Brauer configuration $M (M^{D_{n}^{n / 2}})$ is the undirected complete graph $\underset{̲}{K_{n}}$ whose vertices (particles) are connected by doubled edges (of the complete graph $K_{n}$ ) labeled by the states $| 10 〉$ and $| 01 〉$ .
6.: If the hypothesis in the sixth item of Theorem 6 holds for $\underset{̲}{K_{n}}$ , then $M^{e} (M^{D_{n}^{n / 2}}) / \sqrt{n} = | D_{n}^{n / 2} 〉$ .

Proof.

We note that, by definition, if $a_{i}, a_{j} \in M_{0}^{D_{n}^{n / 2}}$ , then there is a crystal $e_{i, j}$ where their corresponding paths $L_{a_{i}}$ and $L_{a_{j}}$ coincide.
$v a l (a_{i}) μ (a_{i}) = 2 (# p a r t i c l e s - 1)$ , for any particle $a_{i} \in M_{0}^{D_{n}^{n / 2}}$ .
It suffices to note that $| M_{1}^{D_{n}^{n / 2}} | = 2 # C r y s t a l s$ .
The result holds provided that the Brauer quiver $Q_{M^{D_{n}^{n / 2}}}$ has no loops and $v a l (a_{j}) > 1$ for any $a_{j} \in M_{0}^{D_{n}^{n / 2}}$ .
Polygon-words and their concatenation (where two words (edges) are connected provided that they have a common vertex) give an unoriented graph $M (M^{D_{n}^{n / 2}}) = (V_{D_{n}^{n / 2}}, E_{D_{n}^{n / 2}})$ , $V_{D_{n}^{n / 2}} = M_{0}^{D_{n}^{n / 2}}$ and $E_{D_{n}^{n / 2}} = M_{1}^{D_{n}^{n / 2}}$ . Thus, $M (M^{D_{n}^{n / 2}})$ is nothing but the graph induced by the setup $D_{n}^{n / 2}$ .
As in Theorem 6, the labels associated with the perfect matchings of $M (M^{D_{n}^{n / 2}})$ give $| D_{n}^{n / 2} 〉$ .

□

4. Conclusions

Cayley and nilpotent graphs induce Brauer configuration algebras. If a subset S generates a group G, the induced Brauer configuration algebra satisfies the length grading property, and closed formulas for their dimensions and center can be obtained. The same can be proven for Brauer configuration algebras induced by commutative rings of the form

Z_{2^{n}}

. In particular, it is possible to prove that some Cayley graphs give rise to Hamiltonian Brauer quivers.

Although Brauer configuration algebras induced by butterfly graphs do not satisfy the length grading property, such algebras are connected and reduced, and it is possible to obtain closed formulas for their dimensions. These results prove that some Brauer configuration algebras induced by pancake and star graphs are isomorphic.

Since quantum entangled states

G H Z_{n}^{2}

G H Z_{n}^{3}

and

W_{n}

give rise to undirected graphs, we conclude that such quantum states induce Brauer configuration algebras whose dimensions depend on the number of crystals used in the corresponding setups.

Future Work

This paper gives closed formulas for Brauer configuration algebras induced by some nilpotent graphs. It would be an interesting task for the future to give closed formulas (or to perform a Brauer analysis) for the dimensions of all Brauer configuration algebras induced by commutative rings of type $Z_{n}$ .
Another task for the future is to determine which Cayley graphs induce Hamiltonian Brauer quivers.
In the future, the experimental construction of generalized quantum entangled states will allow the existence of suitable Brauer configuration algebras.

Author Contributions

Investigation, writing, review and editing, A.M.C., I.G. and O.M.M. All authors have read and agreed to the published version of the manuscript.

Funding

Convocatoria Nacional para el Establecimiento de Redes de Cooperación bajo el Marco del Modelo Intersedes 2022–2024, Universidad Nacional de Colombia. Proyecto: Interacciones entre el álgebra, la combinatoria y la computación cuántica con aplicaciones en ciberseguridad y análisis topológico de datos. Cod Hermes 59773.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:

$# C r y s t a l s$	Number of crystals in a quantum entanglement setup
$\dim_{k} Λ_{G}$	Dimension of a Brauer configuration algebra
$\| D_{n}^{m} 〉$	Dicke entanglement state
$⌊ x ⌋$	Greatest integer less than an inter number x
$\| G H Z_{n}^{d} 〉$	Greenberger–Horne–Zeilinger entanglement state
$Λ_{G}$	Brauer configuration algebra induced by the graph $G$
$N i l (Z_{n})$	Set of nilpotent elements of the ring $Z_{n}$
$# p a r t i c l e s$	Number of particles in a quantum entanglement setup
$P_{n}$	Pancake graph
$S T_{n}$	Star graph
$\| X \|$	Size of a set X
$t_{i}$	ith triangular number
$v a l (x)$	Valency of a vertex x
$\| W_{n} 〉$	Dicke entanglement state $\| D_{n}^{1} 〉$
$⌊ x ⌋$	Greatest integer less than an inter number x
$Z (Λ_{G})$	Center of a Brauer configuration algebra

References

Cayley, A. Desiderata and suggestions No. 2. The theory of groups: Graphical representation. Am. J. Math. 1878, 1, 174–176. [Google Scholar] [CrossRef]
Beck, I. Coloring of commutative rings. J. Algebra 1988, 116, 208–226. [Google Scholar] [CrossRef]
Anderson, D.F.; Livingston, P.S. The zero-divisor graph of a commutative ring. J. Algebra 1999, 217, 434–477. [Google Scholar] [CrossRef]
Kala, R.; Kavhita, S. A typical graph structure of a ring. Trans. Comb 2015, 116, 37–44. [Google Scholar]
Khojasteh, S.; Nikmehr, M.J. The weakly nilpotent graph of a commutative ring. Canad. Math. Bull. 2017, 60, 319–328. [Google Scholar] [CrossRef]
Basnet, D.K.; Sharma, A.; Dutta, R. Nilpotent graph. Theory Appl. Graphs 2021, 8, 1–9. [Google Scholar] [CrossRef]
Witte, D.; Gallian, J.A. A survey: Hamiltonian cycles in Cayley graphs. Discret. Math. 1984, 51, 293–304. [Google Scholar] [CrossRef]
Riyas, A.; Geetha, K. A study on Cayley graphs over dihedral groups. Int. J. Math. Comb. 2017, 1, 63–70. [Google Scholar]
Tripi, A. Cayley Graphs and Their Applications. Master’s Thesis, Missouri State University, Springfield, MO, USA, 2017. [Google Scholar]
Lu, L.; Mönius, K. Algebraic degree of Cayley graphs over abelian groups and dihedral groups. J. Algebr. Comb. 2023, 57, 753–761. [Google Scholar] [CrossRef]
Babai, L. Spectra of Cayley graphs. J. Comb. Theory 1979, 27, 180–189. [Google Scholar] [CrossRef]
Sarmin, N.H.; Fadzil, A.F.A.; Erfanian, A. Seidel energy for Cayley graphs associated to dihedral groups. J. Phys. Conf. Ser. 2021, 1988, 012066. [Google Scholar] [CrossRef]
Peyerimhoff, N.; Vdovina, A. Cayley graph expanders and groups of finite width. J. Pure Appl. Algebra 2011, 215, 2780–2788. [Google Scholar] [CrossRef]
Charles, D.X.; Lauter, K.E. Cryptographic hash functions from expander graphs. J. Cryptol. 2009, 22, 93–113. [Google Scholar] [CrossRef]
Jao, D.; Miller, S.D. Expander graphs based on GRH with an application to elliptic curve cryptography. J. Number Theory 2009, 129, 1491–1504. [Google Scholar] [CrossRef]
Sosnovski, B. Cayley Graph of Semigroups and Applications to Hashing. Doctoral Dissertation, City University of New York, New York, NY, USA, 2016. [Google Scholar]
Chen, P. A kind of graph structure of rings. Algebra Colloq. 2003, 10, 229–238. [Google Scholar]
Green, E.L.; Schroll, S. Brauer configuration algebras: A generalization of Brauer graph algebras. Bull. Sci. Math. 2017, 121, 539–572. [Google Scholar] [CrossRef]
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]
Espinosa, P.F.F. Categorification of Some Integer Sequences and Its Applications. Doctoral Dissertation, National University of Colombia, Bogotá, Colombia, 2021. [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]
Cañadas, A.M.; Ballester-Bolinches, A.; Gaviria, I.D.M. Solutions of the Yang-Baxter equation arising from Brauer configuration algebras. Computation 2022, 11, 1–17. [Google Scholar] [CrossRef]
Cañadas, A.M.; Rios, G.B.; Serna, R.-J. Snake graphs arising from groves with an application in coding theory. Computation 2022, 10, 1–17. [Google Scholar] [CrossRef]
Cañadas, A.M.; Angarita, M.A.O. Brauer configuration algebras for multimedia based cryptography and security applications. Multimed. Tools. Appl. 2021, 80, 23485–23510. [Google Scholar]
Agudelo, N.; Cañadas, A.M.; Gaviria, I.D.M.; Espinosa, P.F.F. {0, 1}-Brauer configuration algebras and their applications in the graph energy theory. Mathematics 2021, 9, 3042. [Google Scholar] [CrossRef]
Pan, J.W.; Chen, Z.B.; Lu, C.Y.; Weinfurter, H.; Zeilinger, A.; Żukowski, M. Multiphoton entanglement and inteferometry. Rev. Mod. Phys. 2012, 84, 777–838. [Google Scholar] [CrossRef]
The Nobel Prize in Physics 2022. NobelPrize.org. Nobel Prize Outreach AB 2024. Available online: https://www.nobelprize.org/prizes/physics/2022/summary/ (accessed on 1 February 2024).
Krenn, M.; Gu, X.; Zeilinger, A. Quantum experiments and graphs I: Multipartite states as coherent superpositions of perfect matchings. Phys. Rev. Lett. 2017, 119, 240403. [Google Scholar] [CrossRef]
Gu, X.; Erhard, M.; Zeilinger, A.; Krenn, M. Quantum experiments and graphs II: Quantum interference, computation, and state generation. Proc. Natl. Acad. Sci. USA 2019, 116, 4147–4155. [Google Scholar] [CrossRef]
Gu, X.; Chen, L.; Zeilinger, A.; Krenn, M. Quantum experiments and graphs. III. high-dimensional and multiparticle entanglement. Phys. Rev. A. 2019, 99, 032338. [Google Scholar] [CrossRef]
Rankin, R.A. A campanological problem in group theory. Proc. Camb. Philos. Soc. 1948, 44, 17–25. [Google Scholar] [CrossRef]
Brian, A.; Chen, C.C.; Mathew, D. Hamiltonian paths in Cayley graphs on generalized dihedral groups. Filomat 2019, 33, 3599–3613. [Google Scholar]
Pastine, A.; Jaume, D. On Hamiltonian circuits in Cayley digraphs over generalized dihedral groups. Rev. Unión Matemática Argent 2012, 53, 79–87. [Google Scholar]
Palanivel, N.; Chithra, A.V. Energy and Laplacian energy of unitary addition Cayley graphs. Filomat 2019, 33, 3599–3613. [Google Scholar] [CrossRef]
Brualdi, R.A. Introductory Combinatorics; Pearson and Prentice Hall: Old Bridge, NJ, USA, 2010. [Google Scholar]
Diestel, R. Graph Theory, Electronic ed.; Springer: New York, NY, USA, 2000. [Google Scholar]
Kühn, D.; Osthus, D. A survey on Hamilton cycles in directed graphs. Eur. J. Comb. 2012, 33, 750–766. [Google Scholar] [CrossRef]
Darbinyan, S.K. On Hamiltonian and Hamilton-connected digraphs. arXiv 2018, arXiv:1801.05166v1. [Google Scholar]
Nash-Williams, C.S.J.A. Hamilton circuits in graphs and digraphs. In The Many Facets of Graph Theory; Springer: Berlin/Heidelberg, Germany, 1968; Volume 110, pp. 237–243. [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]
Schibell, S.T.; Stafford, R.M. Processor interconnection networks from Cayley graphs. Cryptol. Q. 2011, 3929129, 35–55. [Google Scholar] [CrossRef]
IBM. What Is Quantum Cryptography? Available online: https://www.ibm.com/topics/quantum-cryptography (accessed on 15 November 2023).
Jacques, S.; Naehrig, M.; Roetteler, M.; Virdia, F. Implementing Grover Oracles for Quantum Key Search on AES and LowMC. In Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology, EUROCRYPT 2020, Zagreb, Croatia, 10–14 May 2020; Canteaut, A., Ishai, Y., Eds.; Lecture Notes in Computer Science. Springer: Cham, Switzerland, 2020; Volume 12106. [Google Scholar]
Yin, J.; Li, Y.H.; Liao, S.K.; Yang, M.; Cao, Y.; Zhang, L.; Ren, J.G.; Cai, W.Q.; Liu, W.Y.; Li, S.L.; et al. Entanglement-based secure quantum cryptography over 1,120 kilometres. Nature 2020, 582, 501–505. [Google Scholar] [CrossRef] [PubMed]
Sloane, N.J.A. On-Line Encyclopedia of Integer Sequences. Available online: http://oeis.org/A001045 (accessed on 20 October 2023).

Figure 1. Edges are considered labeled multisets defined by a graph.

Figure 2. Example of a graph viewed as a message of a labeled system of multisets.

Figure 3. Transposition graphs of the star graph

S T_{n}

(above) and the pancake graph

P_{n}

(below).

Figure 3. Transposition graphs of the star graph

S T_{n}

(above) and the pancake graph

P_{n}

(below).

Figure 4. The Cayley graph of the Klein four-group and oriented cycles associated with its vertices.

Figure 5. Construction of a Brauer quiver from the Cayley graph of the Cayley four-group. The oriented cycles associated with vertices in the same edge are identified.

Figure 6. Nilpotent graph

N (Z_{8})

is a complete graph with four vertices and six edges.

Figure 6. Nilpotent graph

N (Z_{8})

is a complete graph with four vertices and six edges.

Figure 7. Setup of type

G H Z_{4}^{2}

with four crystals and four particles.

Figure 7. Setup of type

G H Z_{4}^{2}

with four crystals and four particles.

Figure 8. Graph

G_{| G H Z_{4}^{2} 〉}

induced by a setup of type

G H Z_{4}^{2}

(see Figure 7) and the perfect matchings giving

| G H Z_{4}^{2} 〉

Figure 8. Graph

G_{| G H Z_{4}^{2} 〉}

induced by a setup of type

G H Z_{4}^{2}

(see Figure 7) and the perfect matchings giving

| G H Z_{4}^{2} 〉

Figure 9. Setup of type

W_{4}

with six crystals producing states

| 00 〉

| 10 〉

and

| 01 〉

Figure 9. Setup of type

W_{4}

with six crystals producing states

| 00 〉

| 10 〉

and

| 01 〉

Figure 10. Graph

G_{| W_{4} 〉} = O l i v e r_{4}

induced by a setup of type

W_{4}

(see Figure 9). Its perfect matchings give the state

| W_{4} 〉

Figure 10. Graph

G_{| W_{4} 〉} = O l i v e r_{4}

induced by a setup of type

W_{4}

(see Figure 9). Its perfect matchings give the state

| W_{4} 〉

Figure 12. Star graph

S T_{3}

defined by the transposition graph shown in Figure 3 for

n = 3

Figure 12. Star graph

S T_{3}

defined by the transposition graph shown in Figure 3 for

n = 3

Figure 13. Nilpotent graph

N (Z_{8})

and its induced Brauer quiver

Q_{N (Z_{8})}

Figure 13. Nilpotent graph

N (Z_{8})

and its induced Brauer quiver

Q_{N (Z_{8})}

Figure 14. Brauer quiver

Q_{N (Z_{16})}

induced by the nilpotent graph

N (Z_{16})

Figure 14. Brauer quiver

Q_{N (Z_{16})}

induced by the nilpotent graph

N (Z_{16})

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2024 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/).

Share and Cite

MDPI and ACS Style

Cañadas, A.M.; Gutierrez, I.; Mendez, O.M. Brauer Analysis of Some Cayley and Nilpotent Graphs and Its Application in Quantum Entanglement Theory. Symmetry 2024, 16, 570. https://doi.org/10.3390/sym16050570

AMA Style

Cañadas AM, Gutierrez I, Mendez OM. Brauer Analysis of Some Cayley and Nilpotent Graphs and Its Application in Quantum Entanglement Theory. Symmetry. 2024; 16(5):570. https://doi.org/10.3390/sym16050570

Chicago/Turabian Style

Cañadas, Agustín Moreno, Ismael Gutierrez, and Odette M. Mendez. 2024. "Brauer Analysis of Some Cayley and Nilpotent Graphs and Its Application in Quantum Entanglement Theory" Symmetry 16, no. 5: 570. https://doi.org/10.3390/sym16050570

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Menu

Brauer Analysis of Some Cayley and Nilpotent Graphs and Its Application in Quantum Entanglement Theory

Abstract

1. Introduction

1.1. Motivations

1.2. Contributions

2. Preliminaries

2.1. Background

2.2. Graphs and Multisets

2.3. Cayley Graphs

2.4. Nilpotent Graphs

2.5. Quantum Entanglement Theory

3. Main Results

3.1. Brauer Configuration Algebras Induced by Cayley Graphs

3.2. Brauer Configuration Algebras Induced by Nilpotent Graphs

3.3. Brauer Configuration Algebras Induced by Quantum Entanglements

4. Conclusions

Future Work

Author Contributions

Funding

Data Availability Statement

Conflicts of Interest

Abbreviations

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI