Brauer-Type Configurations Associated with the Boolean Geometry of the Grassmann Algebra

Abstract

We construct and analyze a family of support-defined Brauer-type configurations canonically associated with the Boolean geometry underlying the Grassmann algebra. The construction is governed by an x-support map on monomial labels, which identifies the vertex set with the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$. This identification yields a Boolean support quiver isomorphic to the directed Hasse diagram of $\mathcal{P}\left(\right[n\left]\right)$, equivalently, to an oriented hypercube. We then equip the family with a canonical cyclic ordering at each vertex and obtain a genuine connected reduced Brauer configuration in the standard sense, together with its associated Brauer configuration algebra and its standard Brauer quiver. A ghost-variable mechanism is introduced to obtain a connected realization without altering any support-controlled invariants. We prove that polygon membership, valencies, multiplicities, Boolean stratification, and the support quiver are invariant under support-preserving ghost relabelings. We also give an explicit description of the standard Brauer quiver and show that it is different from the Boolean support quiver. On the algebraic side, we derive closed formulas for the center dimension, the algebra dimension, and the normalization constant of the induced weighted distribution. On the probabilistic side, we distinguish the vertex entropy from the layer entropy, establish an exact decomposition of the former by Hamming layers, and show that the layer distribution is asymptotically concentrated on the middle layers, while extremal vertices and any fixed maximal path contribute a negligible fraction of the total weight. As a consequence, the layer entropy satisfies a logarithmic asymptotic law. We also investigate geometric consequences of the Boolean model transported through the support identification. Coordinate projections produce a rigidity phenomenon for antipodal pairs, providing a combinatorial analogue of Greenberger–Horne–Zeilinger (GHZ)-type fragility, whereas the first Boolean layer exhibits a persistence property analogous to W-type robustness. Together, these results exhibit a concrete bridge between Grassmann combinatorics, Brauer configuration theory, hypercube geometry, and entropy asymptotics.

1. Introduction

The Grassmann (or exterior) algebra occupies a distinguished place in algebra, geometry, and mathematical physics because it provides one of the most elementary settings in which anticommutativity, grading, and combinatorics interact in a genuinely structural way. Let V be an n-dimensional vector space over a field K, and let

$$\Lambda \left(V\right)={\displaystyle \underset{k=0}{\overset{n}{⨁}}}{\Lambda }^k\left(V\right)$$

denote its exterior algebra. After fixing a basis $(e_1,\dots ,e_n)$ of V and writing $x_i$ for the image of $e_i$ in $\Lambda \left(V\right)$, one obtains the familiar relations

$$x_i{x}_j=-x_j{x}_i,x_i^2=0(1\le i,j\le n),$$

which make $\Lambda \left(V\right)$ the universal algebra governing alternating multilinear phenomena. For this reason, exterior algebras permeate the study of determinants, orientations, differential forms, cohomology, and fermionic sign rules; see, for instance, refs. [1,2,3].

A first guiding principle of the present work is that the Grassmann algebra should not be viewed only as a receptacle for alternating tensors, but also as a canonically graded and combinatorially indexed object. On the one hand, $\Lambda \left(V\right)$ is naturally a ${\mathbb{Z}}_2$-graded algebra,

$$\Lambda \left(V\right)={\Lambda }^{\overline{0}}\left(V\right)\oplus {\Lambda }^{\overline{1}}\left(V\right),{\Lambda }^{\overline{0}}\left(V\right)=\underset{k\mathrm{even}}{⨁}{\Lambda }^k\left(V\right),{\Lambda }^{\overline{1}}\left(V\right)=\underset{k\mathrm{odd}}{⨁}{\Lambda }^k\left(V\right),$$

and homogeneous elements satisfy the super-commutation rule

$$ab={(-1)}^{\left|a\right|\left|b\right|}ba.$$

This superalgebra viewpoint is foundational in the theory of Lie superalgebras and in supersymmetry; see [4,5]. On the other hand, recent work shows that even the collection of superalgebra structures carried by the Grassmann algebra is itself a subtle invariant, governed by involutive automorphisms and graded identities [6]. This perspective is relevant for us because it suggests that the Grassmann algebra carries not only algebraic structure in the usual sense, but also an internal combinatorial architecture rich enough to support additional representation-theoretic models.

A second guiding principle is that the canonical monomial basis of the Grassmann algebra is indexed by the Boolean lattice. Every basis monomial

$$x_{i_1}···x_{i_k},i_1<···<i_k,$$

corresponds uniquely to the subset

$$S=\{i_1,\dots ,i_k\}\subseteq \left[n\right]:=\{1,\dots ,n\}.$$

Thus, the natural monomial basis of $\Lambda \left(V\right)$ is indexed by $\mathcal{P}\left(\right[n\left]\right)$, and the homogeneous component of degree k has dimension $\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)$. In other words, the basis combinatorics of the Grassmann algebra is exactly the combinatorics of the n-dimensional hypercube ${\{0,1\}}^n$. This observation is elementary, but it is also remarkably fertile: it imports into the study of $\Lambda \left(V\right)$ the order structure of the Boolean lattice, the geometry of Hamming layers, and the concentration phenomena encoded by binomial coefficients; see [7,8,9]. From a graph-theoretic viewpoint, the hypercube is one of the basic examples of a distance-regular graph, and its algebraic structure has been studied from several complementary directions [10,11].

This Boolean indexing becomes particularly suggestive when viewed through the lens of quantum information. The Hilbert space of n qubits is ${\left({\mathbb{C}}^2\right)}^{\otimes n}$, whose computational basis is again indexed by bitstrings in ${\{0,1\}}^n$, hence by subsets of $\left[n\right]$; see [12]. Under this identification, the natural discrete metric is the Hamming distance

$${\mathrm{dist}}_H(S,T)=|S▵T|,$$

where $S▵T$ denotes symmetric difference. This metric measures the number of local coordinate flips needed to pass from one basis state to another, and it underlies many of the discrete geometric intuitions surrounding locality and multipartite entanglement [13]. In particular, the familiar distinction between Greenberger–Horne–Zeilinger (GHZ)-type and W-type entanglement may be read combinatorially as a distinction between highly global extremal configurations and more robust low-degree layers [14,15]. One of the conceptual aims of this article is to show that this heuristic may be encoded in an explicit Brauer-type framework built from the Boolean geometry inherent in the Grassmann algebra.

The main objective of the paper is therefore to construct and analyze a family of support-defined Brauer-type configurations canonically attached to the Boolean geometry underlying the Grassmann algebra. More precisely, we build a family in which the vertices are controlled by monomial labels in commuting variables, while the incidence pattern is governed entirely by the x-support of those monomials. This support map identifies the vertex set with the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$, and from this identification there emerges a canonical Boolean support quiver, namely the directed Hasse diagram of $\mathcal{P}\left(\right[n\left]\right)$, or equivalently, the oriented hypercube. The first important point is that this support quiver is not yet the standard Brauer quiver of a Brauer configuration algebra. Rather, it is the combinatorial shadow of the support geometry. A separate step is needed in order to endow the family with a genuine Brauer configuration structure in the standard sense.

This distinction is one of the main structural clarifications of the paper. Starting from the support-defined family $\Gamma \left(n\right)=({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right))$, we introduce a canonical cyclic ordering of the polygons incident with each vertex, thereby obtaining a connected reduced Brauer configuration

$${\Gamma }^{\mathrm{std}}\left(n\right)=\left({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right),\mu ,{\mathfrak{o}}_n\right)$$

in the standard sense. This, in turn, determines a genuine Brauer configuration algebra ${\Lambda }_{\Gamma \left(n\right)}$ and its associated standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$. The support quiver and the standard Brauer quiver are thus different but complementary objects: the first records Boolean support inclusions, while the second records successor relations among polygons induced by the cyclic orientation. One of the results of the paper is that these two quivers are not isomorphic, a fact that becomes essential in the computation of global invariants.

This strategy places the present work within the rapidly growing theory of Brauer graph algebras and Brauer configuration algebras. Brauer configuration algebras generalize the Brauer graph algebras by allowing polygons with repeated vertices and more flexible multiplicity data, while retaining a highly computable combinatorial control over the associated algebra [16,17]. Their structure has since been enriched by several complementary developments, including geometric models for Brauer graph algebras [18,19], extensions toward weighted surface algebras [20], and explicit formulas for invariants such as center dimensions [21]. In parallel, Brauer configuration techniques have been adapted to a variety of combinatorial sources, including Dyck paths, snake graphs, $\{0,1\}$-configurations, integer partitions, and graph-theoretic constructions [22,23,24,25,26]. Our contribution fits naturally into this circle of ideas, but its distinctive feature is that the controlling combinatorics is neither Catalan nor partition-theoretic in the usual sense: it is the Boolean geometry already present in the Grassmann algebra itself.

The key combinatorial device in our construction is the x-support map. Working with commuting variables $x_1,\dots ,x_n$ and a small family of auxiliary symbols, we label vertices by monomials w and set

$${Supp}_x\left(w\right):=\{i\in \left[n\right]\mid x_i\mathrm{divides}w\}.$$

The crucial point is that all incidence relations, as well as the valency and multiplicity functions appearing in the configuration, depend only on ${Supp}_x\left(w\right)$ and on its cardinality. Thus, the algebraic data is funneled rigidly through the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$. This support-level description is strong enough to recover the Boolean stratification by Hamming layers, the oriented Hasse diagram, and the recursive doubling behavior in the parameter n.

One of the delicate technical issues is connectedness. In Brauer-configuration theory, connectedness is not a superficial graph-theoretic convenience, but a structural requirement ensuring that the associated algebra reflects the intended global geometry rather than decomposing into unrelated pieces. For this reason, the paper incorporates a ghost-variable principle: we enlarge the ambient monomial system by adjoining a finite collection of auxiliary variables that do not contribute to ${Supp}_x(·)$. As a result, the Boolean support geometry remains unchanged, while the configuration admits a connected realization compatible with the Brauer framework. In particular, the quantities that govern the theory, such as polygon membership, multiplicity and valency counts, Boolean stratification, support quiver structure, and the global sums derived later, remain entirely controlled by the x-support. This separation between support data and auxiliary presentation is one of the conceptual novelties of the paper.

A second major theme of the article is quantitative. Because multiplicities and valencies depend only on the size of the x-support, the principal global sums reduce to binomial expressions over Hamming layers. This allows us to derive explicit formulas for the dimension of the center, the total dimension of the Brauer configuration algebra, and the normalization constant of the weighted distribution induced by multiplicity and valency. One noteworthy consequence of the corrected Brauer-quiver analysis is the formula

$$dimZ\left({\Lambda }_{\Gamma \left(n\right)}\right)=n+3.$$

The weighted distribution also gives rise to two distinct entropy-type quantities: a vertex entropy, defined on the full vertex set, and a layer entropy, defined on the induced distribution over Hamming layers. A key point, emphasized in the present version of the paper, is that these two quantities are not the same. The vertex entropy decomposes exactly into a layer contribution plus an internal contribution coming from the multiplicity of vertices inside each Hamming layer. The layer distribution itself is asymptotically concentrated on the middle layers, while extremal vertices and any fixed maximal path contribute only a negligible fraction of the total mass. As a consequence, the layer entropy satisfies a logarithmic asymptotic law.

A third major theme is geometric. Once the support identification

$${\Gamma }_0\left(n\right)\cong \mathcal{P}\left(\left[n\right]\right)$$

has been established, the hypercube geometry of the Boolean lattice can be transported back to the support-defined family. The resulting statements should be understood as consequences of the Boolean model carried by the support map, rather than as intrinsic properties of the standard Brauer quiver itself. From this viewpoint, coordinate projections produce a rigidity phenomenon for antipodal pairs: maximally separated pairs lose exactly one unit of Hamming distance under each coordinate deletion. At a purely combinatorial level, this mirrors the fragility usually associated with GHZ-type configurations. At the opposite end of the Boolean lattice, the first Hamming layer behaves in a markedly different way: under deletion of any single coordinate, a nontrivial portion of that layer survives through a canonical order-preserving identification with the first layer of $\mathcal{P}\left(\right[n-1\left]\right)$. This persistence provides a combinatorial analogue of W-type robustness. In this way, the Boolean support model captures within a single framework both the fragility of global extremal structures and the persistence of low-degree strata.

Another feature of the family is its clean inductive behavior in the parameter n. Passing from $n-1$ to n amounts to adjoining one new coordinate, hence doubling the Boolean lattice into two copies according to whether the new index n is absent or present. On the level of vertex labels, this operation is realized by the lift map

$$L_n:{\Gamma }_0(n-1)⟶{\Gamma }_0\left(n\right),L_n\left(w\right)=w{x}_n,$$

which identifies the second layer with the labels whose support contains n. This recursive structure is important both conceptually and technically. Conceptually, it shows that the family is not sporadic but hierarchical. Technically, it allows one to propagate support data, valencies, and layer counts across consecutive values of n, in a spirit familiar from other Brauer-configuration families built from combinatorial recursion [24,25].

Taken together, these ideas lead to a threefold synthesis that we regard as the main conceptual contribution of the paper. On the algebraic side, the Grassmann algebra contributes the canonical superalgebra structure and the Boolean indexing of basis monomials [2,3,6]. On the Brauer-theoretic side, standard Brauer configuration theory furnishes a flexible finite-dimensional framework in which this Boolean geometry becomes visible through an explicitly connected reduced Brauer configuration and a computable associated algebra [16,17,21]. On the combinatorial-geometric side, the support identification makes Hamming distance, coordinate projection, antipodal rigidity, W-type persistence, and middle-layer concentration part of a single coherent picture [8,12,13,14,15]. The ghost-variable mechanism ensures that this synthesis is not derailed by connectivity issues, because it provides a connected realization without contaminating the invariant support core.

We close this introduction by indicating the organization of the paper. We begin by defining the monomial system and the x-support map that transfers the Boolean structure of the Grassmann algebra into the language of support-defined Brauer-type configurations. We then construct the vertex and polygon families, prove that the vertex set is canonically identified with the Boolean lattice, and introduce the Boolean support quiver as the directed Hasse diagram of that lattice. After that, we equip the family with a canonical cyclic ordering, obtain a genuine connected reduced Brauer configuration in the standard sense, and describe explicitly the associated standard Brauer quiver. We next establish connectedness, reducedness, ghost invariance, and the inductive lift structure, and then derive formulas for the center dimension, the algebra dimension, and the weighted distributions governing the entropy theory. Finally, we turn to the geometric consequences transported from the Boolean lattice, including the rigidity of antipodal pairs under coordinate projections, the contrast with the persistence of the first Boolean layer, and several open problems suggested by this Brauer-theoretic Boolean model. In this way, the article develops a framework in which the Boolean skeleton of the Grassmann algebra is not only visible, but mathematically operative.

For reference, Appendix A contains low-dimensional realizations of the vertex sets ${\Gamma }_0\left(n\right)$, including explicit diagrams for the cases $\mathrm{GRASS}\left(3\right)$, $\mathrm{GRASS}\left(4\right)$, and $\mathrm{GRASS}\left(5\right)$, together with a complete worked example for $\mathrm{GRASS}\left(4\right)$.

Main Results

We briefly summarize the principal constructions and results established in this paper.

Our starting point is the observation that the Boolean geometry naturally underlying the Grassmann algebra can be transferred into a Brauer-type framework through the x-support map. More precisely, after defining a suitable family of monomial labels and an incidence structure governed entirely by x-supports, we construct for each $n\ge 3$ a support-defined family $\Gamma \left(n\right)$ whose vertex set is canonically identified with the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$ via the support map (Proposition 2). Under this identification, the associated Boolean support quiver is shown to be exactly the directed Hasse diagram of the Boolean lattice, equivalently, the oriented n-dimensional hypercube (Proposition 3).

A second main result is that this support-defined family can be completed into a genuine Brauer configuration in the standard sense. By introducing a canonical cyclic ordering on the polygons incident with each vertex, we obtain a connected reduced Brauer configuration ${\Gamma }^{\mathrm{std}}\left(n\right)$ and hence a well-defined Brauer configuration algebra ${\Lambda }_{\Gamma \left(n\right)}$ (Theorem 1). We then define and compute explicitly the associated standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ (Theorem 2), and we show that it is not isomorphic to the Boolean support quiver (Corollary 1). This distinction is one of the structural points on which the present version of the paper rests.

A third group of results concerns the structural properties of the family. We prove that the incidence graph of $\Gamma \left(n\right)$ is connected (Theorem 3), that the family has no truncated vertices and is therefore reduced (Proposition 7), and that the Boolean support quiver is loop-free (Proposition 8). At the same time, we show that the auxiliary ghost variables used in the construction do not alter any of the support-controlled data: polygon membership, valency, multiplicity, Boolean stratification, and the support quiver all remain invariant under support-preserving ghost relabelings (Proposition 6). In this sense, the ghost mechanism provides a connected realization without contaminating the invariant Boolean core of the theory.

The fourth group of results is quantitative. Because multiplicities and valencies depend only on the size of the x-support, all global sums reduce to binomial expressions over Hamming layers. This allows us to derive explicit closed formulas for the center dimension (Theorem 4), the total dimension of the associated Brauer configuration algebra (Theorem 5), and the normalization constant $d_{\Gamma \left(n\right)}$ (Theorem 6). In particular, one of the consequences of the corrected Brauer-quiver analysis is the formula

$$dimZ\left({\Lambda }_{\Gamma \left(n\right)}\right)=n+3.$$

A fifth main contribution is entropic. We introduce a weighted distribution attached to the support-controlled multiplicity and valency data and distinguish from the outset between the vertex entropy and the layer entropy. We establish an exact decomposition of the vertex entropy by Hamming layers (Proposition 12), compute the layer weights explicitly (Proposition 11), and prove that the induced layer distribution is asymptotically concentrated on the middle Hamming layers (Theorem 7), while the contribution of any fixed maximal directed path is negligible in the limit (Proposition 14). As a consequence, the layer entropy satisfies a logarithmic asymptotic law (Theorem 8).

Finally, we study geometric consequences of the Boolean model transported through the support identification ${\Gamma }_0\left(n\right)\cong \mathcal{P}\left(\left[n\right]\right)$. Using coordinate projections, we prove a rigidity theorem for antipodal pairs: maximally separated pairs are unique and lose exactly one unit of Hamming distance under each coordinate deletion (Theorem 9). This provides a combinatorial analogue of Greenberger–Horne–Zeilinger (GHZ)-type fragility. In contrast, the first Boolean layer is shown to persist nontrivially under every coordinate projection (Proposition 15), reflecting a robustness pattern analogous to that of W-type configurations. We also prove that valency grows strictly along every maximal directed path in the Hasse diagram (Corollary 6), thereby linking the support-quiver orientation with the local support-controlled structure.

Taken together, these results show that the Boolean skeleton of the Grassmann algebra admits a Brauer-theoretic realization that is simultaneously combinatorial, geometric, and representation-theoretic. It yields a connected and computable family of support-defined Brauer-type configurations, a genuine associated standard Brauer configuration algebra, and a natural asymptotic entropy theory governed by the middle layers of the Boolean lattice.

2. Supports and the Map ${\mathbf{Supp}}_{\mathit{x}}$

The combinatorial core of our construction is controlled by the distinguished variables

$$x_1,\dots ,x_n,$$

while a small family of auxiliary symbols will be used only to improve the connectivity properties of the resulting Brauer-type configuration. The purpose of this section is to formalize the support map that extracts the Boolean content of a monomial label and to record the numerical data induced by this support. As will become clear throughout the paper, all support-controlled invariants relevant to our construction factor through this map.

Definition 1 

(x-support and x-degree). Let $n\ge 3$, and let $X_n=\{x_1,\dots ,x_n\}$ be a family of commuting variables. We also fix three additional symbols

$$G=\{y_1,y_2,y_3\},$$

which will be referred to as ghost variables. For any monomial label w built from the alphabet

$$X_n\cup G=\{x_1,\dots ,x_n,y_1,y_2,y_3\},$$

we define its x-support by

$${Supp}_x\left(w\right):=\{i\in \{1,\dots ,n\}\mid x_i\mathit{divides}w\},$$

and its x-degree by

$${deg}_x\left(w\right):=\left|{Supp}_x\left(w\right)\right|.$$

The map ${Supp}_x$ forgets all ghost contributions and retains only the information carried by the distinguished variables $x_1,\dots ,x_n$. In this sense, it extracts from each monomial label its underlying Boolean support in $\mathcal{P}\left(\right[n\left]\right)$, where $\left[n\right]=\{1,\dots ,n\}$. Different monomial labels may therefore determine the same x-support, and from the point of view of the present theory, they are combinatorially indistinguishable whenever their x-supports agree.

Definition 2 

(Valency and multiplicity induced by ${Supp}_x$). For any vertex label w, we define its valency by

$$val\left(w\right):=1+{deg}_x\left(w\right)=1+\left|{Supp}_x\left(w\right)\right|.$$

(1)

We also define its multiplicity by

$$\mu \left(w\right):=\left\{\begin{array}{cc}2,\hfill & {deg}_x\left(w\right)=0,\hfill \\ 1,\hfill & {deg}_x\left(w\right)\ge 1.\hfill \end{array}\right.$$

(2)

These two functions are designed so that the entire numerical structure of the family is governed by the Boolean size of the support. In particular, both $val\left(w\right)$ and $\mu \left(w\right)$ depend only on the subset ${Supp}_x\left(w\right)\subseteq \left[n\right]$, and in fact only on its cardinality. Thus, the combinatorics of the construction is naturally stratified by Hamming layers: all labels with the same x-degree contribute identically to the support-dependent counts that appear later in the dimension formulas and entropy computations.

It is useful to make this observation explicit.

Remark 1 

(Support classes and Boolean layers). For each subset $S\subseteq \left[n\right]$, one may consider the corresponding support class

$${\mathcal{M}}_S:=\{w\mid {Supp}_x\left(w\right)=S\}.$$

These classes are indexed by the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$, and the quantity ${deg}_x\left(w\right)$ records precisely the Hamming layer to which ${Supp}_x\left(w\right)$ belongs. Consequently, the support map organizes all monomial labels into Boolean strata

$$\mathcal{P}\left(\left[n\right]\right)={\displaystyle \underset{k=0}{\overset{n}{⨆}}}{\Gamma }_0^{\left(k\right)},{\Gamma }_0^{\left(k\right)}:=\{S\subseteq \left[n\right]\mid |S|=k\}.$$

Later, this stratification will reappear in the quiver description, in the formulas for global invariants, and in the asymptotic concentration of entropy on the middle layers.

Lemma 1 

(Support invariance of local data). If w and $w^{\prime }$ are two monomial labels such that

$${Supp}_x\left(w\right)={Supp}_x\left(w^{\prime }\right),$$

then

$$val\left(w\right)=val\left(w^{\prime }\right)\mathit{and}\mu \left(w\right)=\mu \left(w^{\prime }\right).$$

In particular, valency and multiplicity depend only on the x-support of a label.

Proof. 

By Definition 2, both $val\left(w\right)$ and $\mu \left(w\right)$ depend only on

$${deg}_x\left(w\right)=\left|{Supp}_x\left(w\right)\right|.$$

Hence, if ${Supp}_x\left(w\right)={Supp}_x\left(w^{\prime }\right)$, then ${deg}_x\left(w\right)={deg}_x\left(w^{\prime }\right)$, and therefore

$$val\left(w\right)=val\left(w^{\prime }\right),\mu \left(w\right)=\mu \left(w^{\prime }\right).$$

This proves the claim. □

The preceding definitions already isolate the basic principle behind the paper: the true invariant content lies in the x-support, whereas the ghost variables serve only an auxiliary structural role.

Remark 2 

(What ghosts can and cannot change). The map ${Supp}_x$ ignores all ghost symbols. Consequently, membership in polygons, all valencies, and all multiplicities depend only on ${Supp}_x$. Ghost variables may influence the way in which we realize the configuration as a connected diagram, but they do not modify the Boolean support classes, nor any of the numerical data governed by those classes. In particular, two labels with the same x-support always have the same valency and the same multiplicity, regardless of their ghost content.

The separation between support data and ghost data is one of the organizing principles of the paper. It allows us to enforce connectedness at the level of the Brauer-type configuration without altering the support-controlled invariants that encode the underlying Boolean geometry. In the next section, we implement this principle in the construction of the connected family $\Gamma \left(n\right)$ and prove that the auxiliary ghost variables leave the ${Supp}_x$-governed combinatorial data unchanged.

3. The Vertex Set and the Polygonal Structure

We now define the finite family of vertex labels from which our Brauer-type configuration will be built. The construction starts from a fixed base layer in three distinguished variables $x_1,x_2,x_3$, together with the three ghost variables introduced in Section 2. For arbitrary $n\ge 3$, this base layer is then extended by multiplication with monomials in the remaining variables $x_4,\dots ,x_n$. In this way, the resulting vertex set retains a rigid ghost component while its x-support ranges over the full Boolean lattice.

Definition 3 

(Base labels at $n=3$). Fix the ghost set

$$G=\{y_1,y_2,y_3\}$$

once and for all. We define the base family of labels by

$${\mathcal{V}}_3=\left\{x_1{x}_2,x_1{x}_3,x_2{x}_3,x_1{x}_2{x}_3,x_1{y}_1,x_2{y}_2,x_3{y}_3,y_1{y}_2{y}_3\right\}.$$

The set ${\mathcal{V}}_3$ is the seed from which all higher-dimensional vertex sets are generated. Its elements are chosen so that the ghost contribution is completely controlled and the distinguished variables $x_1,x_2,x_3$ already exhibit the support patterns that will later propagate through all Boolean layers.

Definition 4  

(Vertex set for general n). Let $n\ge 3$, and set

$$I_n:=\{4,5,\dots ,n\}.$$

For each subset $A\subseteq I_n$, write

$$x_A:=\prod _{i\in A}{x}_i,x_{⌀}:=1.$$

We define the vertex set

$${\Gamma }_0\left(n\right):=\{v{x}_A\mid v\in {\mathcal{V}}_3,A\in \mathcal{P}\left(I_n\right)\}.$$

This description makes the structure of ${\Gamma }_0\left(n\right)$ transparent: every vertex is obtained by taking one of the eight base labels in ${\mathcal{V}}_3$ and adjoining an arbitrary monomial in the variables $x_4,\dots ,x_n$. Since the choice of $v\in {\mathcal{V}}_3$ and the choice of $A\subseteq I_n$ are independent, we immediately obtain the cardinality formula

$$|{\Gamma }_0\left(n\right)|=|{\mathcal{V}}_3\left|\right|\mathcal{P}\left(I_n\right)|=8·2^{n-3}=2^n.$$

Thus, the total number of vertices agrees exactly with the size of the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$, in accordance with the support-based interpretation developed in the previous section.

This cardinality match is not accidental: it reflects the fact that the construction has been designed so that the x-support of vertex labels ranges over all subsets of $\left[n\right]$.

The special role of the ghost variables already appears in the existence of a unique vertex with empty x-support.

Proposition 1  

(Unique vertex with empty x-support). In ${\Gamma }_0\left(n\right)$, the unique label with ${Supp}_x\left(w\right)=⌀$ is

$$w_0:=y_1{y}_2{y}_3.$$

Consequently,

$$\sum _{w\in {\Gamma }_0\left(n\right)}\mu \left(w\right)=2^n+1.$$

Proof. 

Let $w\in {\Gamma }_0\left(n\right)$ satisfy ${Supp}_x\left(w\right)=⌀$. By Definition 4, we may write

$$w=v{x}_A,v\in {\mathcal{V}}_3,A\subseteq I_n.$$

Since $x_i$ does not divide w for any $i\in \{1,\dots ,n\}$, in particular no variable $x_i$ with $i\in I_n$ divides w. Hence $A=⌀$, so $w=v$.

It remains to determine which element of ${\mathcal{V}}_3$ has empty x-support. Inspecting the list in Definition 3, we see that every element except $y_1{y}_2{y}_3$ contains at least one distinguished variable $x_i$. Therefore

$$w=y_1{y}_2{y}_3,$$

which proves uniqueness.

For the multiplicity sum, Definition 2 gives

$$\mu \left(w_0\right)=2,\mu \left(w\right)=1\mathrm{for}\mathrm{all}w\ne w_0.$$

Since $|{\Gamma }_0\left(n\right)|=2^n$, it follows that

$$\sum _{w\in {\Gamma }_0\left(n\right)}\mu \left(w\right)=2+(2^n-1)·1=2^n+1.$$

□

We now define the polygon family. One polygon contains all vertices, while each distinguished variable $x_i$ determines a support-selected subfamily.

Definition 5  

(Polygon family). We define

$${\Gamma }_1\left(n\right):=\{S_1,S_{x_1},\dots ,S_{x_n}\},$$

where

$$S_1:={\Gamma }_0\left(n\right),$$

and, for each $1\le i\le n$,

$$S_{x_i}:=\{w\in {\Gamma }_0\left(n\right)\mid i\in {Supp}_x\left(w\right)\}.$$

Thus, ${\Gamma }_1\left(n\right)$ consists of exactly $n+1$ polygons: one global polygon $S_1$, together with one support polygon for each distinguished variable.

Remark 3.  

For every $w\in {\Gamma }_0\left(n\right)$, the set of polygons containing w is completely determined by ${Supp}_x\left(w\right)$: namely, $w\in S_1$ always, and $w\in S_{x_i}$ if and only if $i\in {Supp}_x\left(w\right)$. Hence, the incidence pattern of the configuration is entirely encoded by the Boolean support and, in particular, is independent of the ghost content of the labels.

By construction, the family ${\Gamma }_1\left(n\right)$ depends only on the x-support structure of the vertex labels. In particular, the ghost variables do not alter polygon membership, since they are invisible to the map ${Supp}_x$.

This support-based definition of polygons is the mechanism through which the Boolean geometry of $\mathcal{P}\left(\right[n\left]\right)$ enters the Brauer-type setting. In the next section, we use it to describe incidences explicitly and to establish the connectedness properties of the resulting configuration.

Proposition 2  

(Boolean identification via the support map). Let $\left[n\right]=\{1,\dots ,n\}$. The map

$${\Phi }_n:{\Gamma }_0\left(n\right)⟶\mathcal{P}\left(\left[n\right]\right),{\Phi }_n\left(w\right)={Supp}_x\left(w\right),$$

is a bijection.

Proof. 

We construct an explicit inverse

$${\Psi }_n:\mathcal{P}\left(\left[n\right]\right)⟶{\Gamma }_0\left(n\right).$$

Let $S\subseteq \left[n\right]$. Write S uniquely as

$$S=S_{123}\bigsqcup S_{\ge 4},S_{123}:=S\cap \{1,2,3\},S_{\ge 4}:=S\cap \{4,5,\dots ,n\}.$$

We define a base label $v\left(S_{123}\right)\in {\mathcal{V}}_3$ by

$$v\left(S_{123}\right)=\left\{\begin{array}{cc}{y}_1{y}_2{y}_3,\hfill & S_{123}=⌀,\hfill \\ x_1{y}_1,\hfill & S_{123}=\left\{1\right\},\hfill \\ x_2{y}_2,\hfill & S_{123}=\left\{2\right\},\hfill \\ x_3{y}_3,\hfill & S_{123}=\left\{3\right\},\hfill \\ x_1{x}_2,\hfill & S_{123}=\{1,2\},\hfill \\ x_1{x}_3,\hfill & S_{123}=\{1,3\},\hfill \\ x_2{x}_3,\hfill & S_{123}=\{2,3\},\hfill \\ x_1{x}_2{x}_3,\hfill & S_{123}=\{1,2,3\}.\hfill \end{array}\right.$$

This is well defined because each subset of $\{1,2,3\}$ appears exactly once in the list, and each chosen label belongs to ${\mathcal{V}}_3$; see Definition 3.

Now define

$${\Psi }_n\left(S\right):=v\left(S_{123}\right)x_{S_{\ge 4}},x_{S_{\ge 4}}:=\prod _{i\in S_{\ge 4}}{x}_i.$$

By Definition 4, we have ${\Psi }_n\left(S\right)\in {\Gamma }_0\left(n\right)$.

We first verify that ${\Phi }_n\circ {\Psi }_n={\mathrm{id}}_{\mathcal{P}\left(\right[n\left]\right)}$. By construction, the label $v\left(S_{123}\right)$ has x-support exactly $S_{123}$, while the factor $x_{S_{\ge 4}}$ contributes precisely the variables indexed by $S_{\ge 4}$. Hence

$${Supp}_x\left({\Psi }_n\left(S\right)\right)=S_{123}\cup S_{\ge 4}=S,$$

so

$${\Phi }_n\left({\Psi }_n\left(S\right)\right)=S.$$

Conversely, let $w\in {\Gamma }_0\left(n\right)$. By Definition 4, we may write

$$w=v{x}_A,v\in {\mathcal{V}}_3,A\subseteq I_n.$$

Set

$$S:={\Phi }_n\left(w\right)={Supp}_x\left(w\right).$$

Then

$$S_{123}=S\cap \{1,2,3\}$$

records exactly which of the variables $x_1,x_2,x_3$ divide the base label v, while

$$S_{\ge 4}=S\cap \{4,\dots ,n\}=A.$$

By construction of the correspondence $S_{123}\mapsto v\left(S_{123}\right)$, we have

$$v\left(S_{123}\right)=v.$$

Therefore

$${\Psi }_n\left({\Phi }_n\left(w\right)\right)={\Psi }_n\left(S\right)=v\left(S_{123}\right)x_{S_{\ge 4}}=v{x}_A=w.$$

Thus ${\Psi }_n\circ {\Phi }_n={\mathrm{id}}_{{\Gamma }_0\left(n\right)}$, and ${\Phi }_n$ is bijective. □

4. Boolean Support Data and the Support Quiver

The support map

$${\Phi }_n:{\Gamma }_0\left(n\right)⟶\mathcal{P}\left(\left[n\right]\right),{\Phi }_n\left(w\right)={Supp}_x\left(w\right),$$

constructed in Proposition 2, transports the Boolean rank structure of $\mathcal{P}\left(\right[n\left]\right)$ to the vertex set ${\Gamma }_0\left(n\right)$. This yields a canonical directed quiver attached purely to the support geometry of the family. We emphasize from the outset that this quiver is not the standard Brauer quiver of a Brauer configuration algebra. It is instead the Boolean support quiver naturally induced by the support relation.

Definition 6  

(Support covering relation). Let $w,w^{\prime }\in {\Gamma }_0\left(n\right)$. We say that $w^{\prime }$ is a support successor of w, and write

$$w{\prec }_{\mathrm{supp}}{w}^{\prime },$$

if

$${Supp}_x\left(w\right)\subset {Supp}_x\left(w^{\prime }\right)\mathit{and}|{Supp}_x\left(w^{\prime }\right)| = |{Supp}_x\left(w\right)|+1.$$

Equivalently, there exists a unique $i\in \left[n\right]\setminus {Supp}_x\left(w\right)$ such that

$${Supp}_x\left(w^{\prime }\right)={Supp}_x\left(w\right)\cup \left\{i\right\}.$$

For notational convenience, we shall write

$$Q\left({\mathrm{G}}_{\mathrm{RASS}}\left(n\right)\right):=Q_{\mathrm{supp}}\left(n\right)$$

for the Boolean support quiver attached to the family $\Gamma \left(n\right)$.

Definition 7 

(Boolean support quiver). We define the Boolean support quiver $Q_{\mathrm{supp}}\left(n\right)$ as follows:

• its vertex set is ${\Gamma }_0\left(n\right)$;
• for every pair $w,w^{\prime }\in {\Gamma }_0\left(n\right)$, there is an arrow

  $$w⟶w^{\prime }$$

  if and only if $w{\prec }_{\mathrm{supp}}{w}^{\prime }$.

Proposition 3  

(Support quiver as an oriented Hasse diagram). Under the Boolean identification

$${\Phi }_n:{\Gamma }_0\left(n\right)⟶\mathcal{P}\left(\left[n\right]\right),$$

the support quiver $Q_{\mathrm{supp}}\left(n\right)$ is isomorphic to the Hasse diagram of the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$, oriented by increasing cardinality.

Proof. 

Let $w,w^{\prime }\in {\Gamma }_0\left(n\right)$, and write

$$S={\Phi }_n\left(w\right)={Supp}_x\left(w\right),T={\Phi }_n\left(w^{\prime }\right)={Supp}_x\left(w^{\prime }\right).$$

By Definition 6, there is an arrow $w\to w^{\prime }$ in $Q_{\mathrm{supp}}\left(n\right)$ if and only if

$$S\subset T\mathrm{and}\left|T\right|=\left|S\right|+1,$$

which is exactly the covering relation in the Boolean lattice $\mathcal{P}\left(\right[n\left]\right)$. Since the orientation is induced by increasing x-degree, it coincides with the standard rank orientation of the Hasse diagram. This proves the claim. □

Remark 4.  

The quiver $Q_{\mathrm{supp}}\left(n\right)$ is the correct combinatorial object for the Boolean geometry carried by the support map. It encodes the hypercube structure on ${\Gamma }_0\left(n\right)$, but by construction it depends only on support inclusions and not on cyclic successor relations at polygons. For this reason, $Q_{\mathrm{supp}}\left(n\right)$ should be regarded as a support-theoretic object rather than as the standard Brauer quiver of the associated Brauer configuration algebra.

5. A Canonical Standard Brauer Configuration Structure

We now complete the support-defined family $\Gamma \left(n\right)=({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right))$ into a genuine Brauer configuration in the standard sense by specifying an explicit cyclic ordering of the polygons incident with each vertex. This is the additional structural datum required in order to speak unambiguously about the associated Brauer configuration algebra and its Brauer quiver.

Definition 8  

(Incident polygon set at a vertex). For $w\in {\Gamma }_0\left(n\right)$, define

$$\mathrm{Pol}\left(w\right):=\{S\in {\Gamma }_1\left(n\right)\mid w\in S\}.$$

By Definition 5 and Remark 3,

$$\mathrm{Pol}\left(w\right)=\left\{S_1\right\}\cup \{S_{x_i}\mid i\in {Supp}_x\left(w\right)\}.$$

In particular,

$$\left|\mathrm{Pol}\left(w\right)\right|=1+|{Supp}_x\left(w\right)|=val\left(w\right).$$

Definition 9  

(Canonical local cyclic ordering). Let $w\in {\Gamma }_0\left(n\right)$, and write

$${Supp}_x\left(w\right)=\{i_1<···<i_k\}.$$

We define the cyclic ordering ${\mathfrak{o}}_w$ on $\mathrm{Pol}\left(w\right)$ by

$$S_1{<}_w{S}_{x_{i_1}}{<}_w{S}_{x_{i_2}}{<}_w···{<}_w{S}_{x_{i_k}}{<}_w{S}_1.$$

If $k=0$, that is, if ${Supp}_x\left(w\right)=⌀$, then $\mathrm{Pol}\left(w\right)=\left\{S_1\right\}$, and ${\mathfrak{o}}_w$ is the unique cyclic ordering on a singleton.

Definition 10  

(Canonical orientation datum). Let

$${\mathfrak{o}}_n:={\left\{{\mathfrak{o}}_w\right\}}_{w\in {\Gamma }_0\left(n\right)}.$$

We call ${\mathfrak{o}}_n$ the canonical support-compatible orientation on $({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right),\mu )$.

Proposition 4  

(Polygon sizes and nontriviality). For every $n\ge 3$, the polygons in ${\Gamma }_1\left(n\right)$ satisfy

$$|S_1|=2^n,\left|S_{x_i}\right|=2^{n-1}(1\le i\le n).$$

In particular, every polygon in ${\Gamma }_1\left(n\right)$ is nonempty and contains at least two vertices.

Proof. 

By Definition 5,

$$S_1={\Gamma }_0\left(n\right),$$

so

$$|S_1|=|{\Gamma }_0\left(n\right)|=2^n$$

by Definition 4.

Fix $i\in \left[n\right]$. Under the Boolean identification

$${\Phi }_n:{\Gamma }_0\left(n\right)⟶\mathcal{P}\left(\left[n\right]\right),$$

the polygon $S_{x_i}$ corresponds exactly to the family of subsets of $\left[n\right]$ containing i. There are $2^{n-1}$ such subsets, since the remaining $n-1$ coordinates may be chosen arbitrarily. Therefore

$$|S_{x_i}|=2^{n-1}.$$

Since $n\ge 3$, we have $2^n\ge 8$ and $2^{n-1}\ge 4$. Hence, every polygon is nonempty and has at least two vertices. □

Theorem 1  

(Standard Brauer configuration). For every $n\ge 3$, the datum

$${\Gamma }^{\mathrm{std}}\left(n\right):=\left({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right),\mu ,{\mathfrak{o}}_n\right)$$

is a connected reduced Brauer configuration in the standard sense. In particular, the Brauer configuration algebra

$${\Lambda }_{\Gamma \left(n\right)}$$

associated with ${\Gamma }^{\mathrm{std}}\left(n\right)$ is well defined.

Proof. 

We show that the support-defined family constructed in the previous sections satisfies all the requirements of a connected reduced Brauer configuration once equipped with the canonical orientation datum ${\mathfrak{o}}_n$.

First, both the vertex set and the polygon family are finite. Indeed, by Definition 4, the set ${\Gamma }_0\left(n\right)$ consists of all labels of the form

$$v{x}_A,v\in {\mathcal{V}}_3,A\subseteq I_n=\{4,\dots ,n\},$$

so

$$|{\Gamma }_0\left(n\right)|=|{\mathcal{V}}_3\left|\right|\mathcal{P}\left(I_n\right)|=8·2^{n-3}=2^n.$$

On the other hand, by Definition 5,

$${\Gamma }_1\left(n\right)=\{S_1,S_{x_1},\dots ,S_{x_n}\},$$

and therefore $|{\Gamma }_1\left(n\right)|=n+1$. Thus, the underlying combinatorial data is finite.

Next, each polygon is a finite multiset of vertices. In fact, in the present construction, each polygon is simply an ordinary finite subset of ${\Gamma }_0\left(n\right)$, so all vertex occurrences inside a given polygon have multiplicity one at the level of incidence. More precisely,

$$S_1={\Gamma }_0\left(n\right),S_{x_i}=\{w\in {\Gamma }_0\left(n\right)\mid i\in {Supp}_x\left(w\right)\}(1\le i\le n).$$

Hence, every polygon is a well-defined finite collection of vertices of ${\Gamma }_0\left(n\right)$. Moreover, every vertex belongs to at least one polygon, because every $w\in {\Gamma }_0\left(n\right)$ lies in the global polygon $S_1$. In particular, the incidence relation is everywhere defined.

We also need the polygons themselves to be nontrivial. This follows from Proposition 4, which shows that

$$|S_1|=2^n,\left|S_{x_i}\right|=2^{n-1}(1\le i\le n).$$

Since $n\ge 3$, each of these cardinalities is at least 2, so every polygon contains at least two vertices. Thus, no polygon degenerates to an empty or singleton incidence object.

The multiplicity function is already part of the support-controlled structure. By Definition 2, we have

$$\mu \left(w\right)=\left\{\begin{array}{cc}2,\hfill & {deg}_x\left(w\right)=0,\hfill \\ 1,\hfill & {deg}_x\left(w\right)\ge 1.\hfill \end{array}\right.$$

This defines a map

$$\mu :{\Gamma }_0\left(n\right)⟶\mathbb{N},$$

so the multiplicity datum required in the definition of a Brauer configuration is fixed.

It remains to specify the orientation. For each $w\in {\Gamma }_0\left(n\right)$, the set of incident polygons is

$$\mathrm{Pol}\left(w\right)=\left\{S_1\right\}\cup \{S_{x_i}\mid i\in {Supp}_x\left(w\right)\},$$

by Definition 8. Writing

$${Supp}_x\left(w\right)=\{i_1<···<i_k\},$$

Definition 9 endows $\mathrm{Pol}\left(w\right)$ with the cyclic ordering

$$S_1{<}_w{S}_{x_{i_1}}{<}_w{S}_{x_{i_2}}{<}_w···{<}_w{S}_{x_{i_k}}{<}_w{S}_1.$$

If $k=0$, then $\mathrm{Pol}\left(w\right)=\left\{S_1\right\}$, and there is a unique cyclic ordering on this singleton. Consequently, for every vertex $w\in {\Gamma }_0\left(n\right)$, we have a well-defined cyclic ordering of the polygons incident with w. Collecting these orderings over all vertices yields the global orientation datum

$${\mathfrak{o}}_n={\left\{{\mathfrak{o}}_w\right\}}_{w\in {\Gamma }_0\left(n\right)}.$$

In particular, since the family has no truncated vertices by Proposition 7, this gives an orientation in the standard Brauer-configuration sense on all nontruncated vertices.

At this point, all local data of a Brauer configuration have been specified. We now turn to the global structural properties. The connectedness follows from Theorem 3: the incidence graph of $\Gamma \left(n\right)$ is connected because every vertex label is incident with the global polygon $S_1$, and every support polygon $S_{x_i}$ is linked to $S_1$ through a vertex containing $x_i$. Hence, the Brauer configuration determined by these data is connected.

Similarly, the reducedness follows from Proposition 7. Indeed, that proposition shows that for every $w\in {\Gamma }_0\left(n\right)$ one has

$$\mu \left(w\right)val\left(w\right)\ge 2,$$

so no vertex is truncated. Therefore, the resulting Brauer configuration is reduced.

Finally, because the family is connected and reduced and all the defining data of a standard Brauer configuration have now been explicitly specified, the datum

$${\Gamma }^{\mathrm{std}}\left(n\right)=\left({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right),\mu ,{\mathfrak{o}}_n\right)$$

is a connected reduced Brauer configuration in the standard sense. It follows that the associated Brauer configuration algebra ${\Lambda }_{\Gamma \left(n\right)}$ is mathematically unambiguously determined by the data of ${\Gamma }^{\mathrm{std}}\left(n\right)$. □

Remark 5.  

The standard Brauer configuration ${\Gamma }^{\mathrm{std}}\left(n\right)$ and the support quiver $Q_{\mathrm{supp}}\left(n\right)$ are attached to the same support-defined family, but they encode different kinds of structure. The first uses the canonical cyclic orderings ${\mathfrak{o}}_n$ and gives rise to the standard Brauer configuration algebra. The second records only the Boolean covering relation on supports.

Definition 11  

(Associated Brauer configuration algebra). For $n\ge 3$, we write

$${\Lambda }_{\Gamma \left(n\right)}$$

for the Brauer configuration algebra associated with the standard Brauer configuration ${\Gamma }^{\mathrm{std}}\left(n\right)$.

6. The Standard Brauer Quiver

We now define the genuine Brauer quiver attached to ${\Gamma }^{\mathrm{std}}\left(n\right)$ and compute its arrow multiplicities explicitly. As expected from the referee’s observation, this quiver is different from the Boolean support quiver $Q_{\mathrm{supp}}\left(n\right)$.

Definition 12  

(Standard Brauer quiver). The Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ of ${\Gamma }^{\mathrm{std}}\left(n\right)$ is defined as follows:

• its vertices are in bijection with the polygons in ${\Gamma }_1\left(n\right)$, namely

  $$v_1,v_{x_1},\dots ,v_{x_n};$$
• for each vertex $w\in {\Gamma }_0\left(n\right)$, and for each polygon $V\in \mathrm{Pol}\left(w\right)$, if $V^{\prime }$ is the successor of V in the cyclic ordering ${\mathfrak{o}}_w$, then $Q_{\mathrm{Br}}\left(n\right)$ contains one arrow

  $$v_V⟶v_{V^{\prime }}.$$

Theorem 2  

(Explicit description of the standard Brauer quiver). For every $n\ge 3$, the Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ has vertex set

$$\{v_1,v_{x_1},\dots ,v_{x_n}\},$$

and its arrows are determined as follows:

(i)

there is exactly one loop at $v_1$;

(ii)

for each $i\in \left[n\right]$, the number of arrows $v_1\to v_{x_i}$ is

$$2^{n-i};$$

(iii)

for each $i\in \left[n\right]$, the number of arrows $v_{x_i}\to v_1$ is

$$2^{i-1};$$

(iv)

for every pair $1\le i<j\le n$, the number of arrows $v_{x_i}\to v_{x_j}$ is

$$2^{i-1}{2}^{n-j};$$

(v)

no other arrows occur.

Proof. 

Recall first that the vertices of $Q_{\mathrm{Br}}\left(n\right)$ are indexed by the polygons of ${\Gamma }_1\left(n\right)$, namely

$$v_1,v_{x_1},\dots ,v_{x_n}.$$

By Definition 12, the arrows of $Q_{\mathrm{Br}}\left(n\right)$ are obtained from the cyclic orderings of the polygons incident with each vertex $w\in {\Gamma }_0\left(n\right)$. Thus, the entire problem reduces to understanding, for a fixed w, which successor relations are produced by the canonical orientation ${\mathfrak{o}}_w$.

Let $w\in {\Gamma }_0\left(n\right)$, and write

$${Supp}_x\left(w\right)=\{i_1<···<i_k\}.$$

Then, by Definition 9, the cyclic ordering at w is

$$S_1{<}_w{S}_{x_{i_1}}{<}_w{S}_{x_{i_2}}{<}_w···{<}_w{S}_{x_{i_k}}{<}_w{S}_1.$$

It follows immediately that the arrows contributed by the single vertex w are exactly

$$v_1\to v_{x_{i_1}},v_{x_{i_1}}\to v_{x_{i_2}},···,v_{x_{i_{k-1}}}\to v_{x_{i_k}},v_{x_{i_k}}\to v_1.$$

In other words, each vertex w contributes the directed cycle obtained by reading the elements of ${Supp}_x\left(w\right)$ in increasing order, inserting $S_1$ at the beginning and at the end.

This description already shows that every arrow in $Q_{\mathrm{Br}}\left(n\right)$ must be of one of the following three types:

$$v_1\to v_{x_i},v_{x_i}\to v_1,v_{x_i}\to v_{x_j}\mathrm{with}i<j.$$

We now count the number of occurrences of each type.

We begin with the loop at $v_1$. Such a loop can only arise when the incident polygon set at a vertex w is the singleton $\left\{S_1\right\}$, because only in that case does the successor of $S_1$ equal $S_1$ itself. By Proposition 1, there is exactly one vertex of ${\Gamma }_0\left(n\right)$ with empty support, namely

$$w_0=y_1{y}_2{y}_3.$$

For this vertex one has

$$\mathrm{Pol}\left(w_0\right)=\left\{S_1\right\},$$

and therefore the cyclic ordering at $w_0$ contributes exactly one loop

$$v_1\to v_1.$$

No other vertex can contribute such a loop, because every vertex with nonempty support is incident with $S_1$ and at least one further polygon $S_{x_i}$. This proves (i).

Next fix $i\in \left[n\right]$. An arrow $v_1\to v_{x_i}$ is contributed by a vertex w if and only if $S_{x_i}$ is the first support polygon after $S_1$ in the cyclic order at w. By the form of ${\mathfrak{o}}_w$, this happens precisely when i is the smallest element of ${Supp}_x\left(w\right)$. Equivalently, the support of w must satisfy the following conditions:

$$i\in {Supp}_x\left(w\right),{Supp}_x\left(w\right)\cap \{1,\dots ,i-1\}=⌀,$$

while the membership of the elements of $\{i+1,\dots ,n\}$ is arbitrary. Thus, once i is forced to belong to the support and the indices $1,\dots ,i-1$ are forced to stay out, the remaining $n-i$ indices can be chosen freely. Hence, the number of such supports, and therefore the number of arrows $v_1\to v_{x_i}$, is

$$2^{n-i}.$$

This proves (ii).

We now count the arrows $v_{x_i}\to v_1$. Such an arrow occurs precisely when $S_{x_i}$ is the last support polygon before returning to $S_1$ in the cyclic order at w. This is equivalent to saying that i is the largest element of ${Supp}_x\left(w\right)$. Therefore, the support must contain i, must contain no element of $\{i+1,\dots ,n\}$, and may contain an arbitrary subset of $\{1,\dots ,i-1\}$. The number of possibilities is therefore

$$2^{i-1},$$

which proves (iii).

Finally, let $1\le i<j\le n$. We claim that an arrow $v_{x_i}\to v_{x_j}$ occurs if and only if i and j both belong to ${Supp}_x\left(w\right)$ and j is the immediate successor of i in the increasing ordering of ${Supp}_x\left(w\right)$. By the explicit description of the cyclic order, this means exactly that

$$i,j\in {Supp}_x\left(w\right),{Supp}_x\left(w\right)\cap \{i+1,\dots ,j-1\}=⌀.$$

At the same time, the indices smaller than i may be chosen arbitrarily, and the indices larger than j may also be chosen arbitrarily. Therefore:

• each subset of $\{1,\dots ,i-1\}$ may be added freely, giving $2^{i-1}$ choices;
• the interval $\{i+1,\dots ,j-1\}$ contributes no choice, since all its elements must be absent;
• each subset of $\{j+1,\dots ,n\}$ may be added freely, giving $2^{n-j}$ choices.

• Multiplying these independent choices, we obtain

$$2^{i-1}{2}^{n-j}$$

such supports, and hence exactly that many arrows $v_{x_i}\to v_{x_j}$. This proves (iv).

It remains only to justify that no further arrows can appear. But this follows immediately from the form of the local cyclic ordering:

$$S_1{<}_w{S}_{x_{i_1}}{<}_w···{<}_w{S}_{x_{i_k}}{<}_w{S}_1.$$

Every arrow either starts at $v_1$, ends at $v_1$, or connects two support polygons whose labels occur consecutively in strictly increasing order. In particular, no arrow $v_{x_i}\to v_{x_j}$ with $j<i$ can occur, and no arrow of any other type is compatible with the canonical cyclic ordering. This proves (v) and completes the proof. □

Corollary 1  

(The two quivers are different). For every $n\ge 3$, the Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ is not isomorphic to the support quiver $Q_{\mathrm{supp}}\left(n\right)$.

Proof. 

The two quivers are built on fundamentally different vertex sets. By Definition 12, the vertices of $Q_{\mathrm{Br}}\left(n\right)$ are indexed by the polygons of ${\Gamma }_1\left(n\right)$, and hence

$$|Q_{\mathrm{Br}}{\left(n\right)}_0|=|{\Gamma }_1\left(n\right)|=n+1.$$

On the other hand, by the definition of the support quiver, the vertices of $Q_{\mathrm{supp}}\left(n\right)$ are precisely the elements of ${\Gamma }_0\left(n\right)$, so

$$|Q_{\mathrm{supp}}{\left(n\right)}_0|=|{\Gamma }_0\left(n\right)|=2^n.$$

Since $2^n\ne n+1$ for every $n\ge 3$, the two quivers cannot be isomorphic. □

Remark 6. 

Corollary 1 is the precise mathematical reason why the Boolean Hasse diagram should not be identified with the standard Brauer quiver. The support quiver records the geometry of the Boolean lattice on vertex labels, whereas the Brauer quiver records successor relations among polygons induced by the canonical cyclic orderings.

7. Incidence Structure, Connectedness, and Ghost Invariance

We now turn from the set-theoretic description of the family $\Gamma \left(n\right)$ to its incidence structure and to the support-controlled properties that will later enter the algebraic computations. The main goal of this section is to establish connectedness of the incidence graph, reducedness of the underlying configuration, and invariance of the support-controlled data under ghost relabelings. We also record that the Boolean support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$ is loop-free. This last property concerns the support quiver only and should be kept separate from the standard Brauer quiver introduced later. These facts provide the structural input needed for the global formulas of Section 9. More broadly, this passage from combinatorial incidence data to algebraic structure is typical of Brauer graph and Brauer configuration theory, where geometric and combinatorial realizations play an organizing role; see [18,19]. It is also compatible with more recent Brauer-type extensions toward weighted surface settings; see [20].

7.1. Incidence Graph and Local Incidence Counts

We begin by encoding the configuration $\Gamma \left(n\right)=({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right))$ in the usual bipartite way.

Definition 13  

(Incidence graph). The incidence graph $I_{\Gamma \left(n\right)}$ is the bipartite graph whose vertex set is

$${\Gamma }_0\left(n\right)\bigsqcup {\Gamma }_1\left(n\right),$$

and where a vertex label $w\in {\Gamma }_0\left(n\right)$ is joined to a polygon $S\in {\Gamma }_1\left(n\right)$ if and only if

$$w\in S.$$

The support-based description of polygon membership immediately determines the incidence degree of every vertex label.

Proposition 5  

(Incidence degree equals valency). For every $w\in {\Gamma }_0\left(n\right)$, the number of polygons of ${\Gamma }_1\left(n\right)$ containing w is

$$1+|{Supp}_x\left(w\right)|=val\left(w\right).$$

Equivalently, the degree of w in the incidence graph $I_{\Gamma \left(n\right)}$ is equal to its valency.

Proof. 

By Definition 5, every label $w\in {\Gamma }_0\left(n\right)$ belongs to the global polygon

$$S_1={\Gamma }_0\left(n\right).$$

Moreover, for each $i\in \left[n\right]$, one has

$$w\in S_{x_i}⟺i\in {Supp}_x\left(w\right).$$

Therefore the polygons containing w are exactly

$$S_1\mathrm{together}\mathrm{with}{S}_{x_i}\mathrm{for}\mathrm{all}i\in {Supp}_x\left(w\right).$$

Hence, their number is

$$1+|{Supp}_x\left(w\right)|=1+{deg}_x\left(w\right)=val\left(w\right),$$

by Definition 2. This proves the claim. □

Remark 7.  

Each support polygon $S_{x_i}$ is nonempty. Indeed, if $i\in \{1,2,3\}$, then

$$x_i{y}_i\in {\mathcal{V}}_3\subseteq {\Gamma }_0\left(n\right),i\in {Supp}_x\left(x_i{y}_i\right),$$

so $x_i{y}_i\in S_{x_i}$. If $i\ge 4$, then

$$x_1{y}_1{x}_i\in {\Gamma }_0\left(n\right),i\in {Supp}_x\left(x_1{y}_1{x}_i\right),$$

hence $x_1{y}_1{x}_i\in S_{x_i}$.

7.2. Connectedness and Component Count

The presence of the global polygon $S_1$ makes connectedness completely transparent.

Theorem 3  

(Connectedness of the configuration). For every $n\ge 3$, the incidence graph $I_{\Gamma \left(n\right)}$ is connected. In particular, the Brauer-type configuration $\Gamma \left(n\right)$ is connected.

Proof. 

Let $w\in {\Gamma }_0\left(n\right)$. Since $S_1={\Gamma }_0\left(n\right)$, every vertex label w is adjacent to the polygon $S_1$ in the incidence graph. Thus, all vertices in ${\Gamma }_0\left(n\right)$ lie in the same connected component as $S_1$.

Now, let $S\in {\Gamma }_1\left(n\right)$. If $S=S_1$, there is nothing to prove. Otherwise

$$S=S_{x_i}$$

for some $i\in \left[n\right]$. By Remark 7, the polygon $S_{x_i}$ contains at least one label $w_i\in {\Gamma }_0\left(n\right)$. Since every such label is adjacent to $S_1$, the polygon $S_{x_i}$ is connected to $S_1$ through the path

$$S_{x_i}-w_i-S_1.$$

Therefore, every node of $I_{\Gamma \left(n\right)}$ lies in the same connected component as $S_1$, and hence $I_{\Gamma \left(n\right)}$ is connected. □

Corollary 2  

(Component count). Let $C_{\Gamma \left(n\right)}$ denote the set of connected components of the incidence graph $I_{\Gamma \left(n\right)}$. Then

$$|C_{\Gamma \left(n\right)}|=1.$$

Proof. 

This is immediate from Theorem 3. □

7.3. Ghost Invariance

We now make precise the sense in which ghost variables improve connectivity without altering the support-controlled combinatorics of the family.

Definition 14  

(Support-preserving ghost relabeling). Let ${\tilde{\Gamma }}_0\left(n\right)$ be another family of monomial labels built from the same distinguished variables $x_1,\dots ,x_n$ and some auxiliary ghost symbols. We say that ${\tilde{\Gamma }}_0\left(n\right)$ is a support-preserving ghost relabeling of ${\Gamma }_0\left(n\right)$ if there exists a bijection

$$\theta :{\Gamma }_0\left(n\right)⟶{\tilde{\Gamma }}_0\left(n\right)$$

such that

$${Supp}_x\left(\theta \left(w\right)\right)={Supp}_x\left(w\right)\mathit{for}\mathit{all}w\in {\Gamma }_0\left(n\right).$$

The corresponding polygon family ${\tilde{\Gamma }}_1\left(n\right)$ is defined from ${\tilde{\Gamma }}_0\left(n\right)$ by the same support rules:

$${\tilde{S}}_1:={\tilde{\Gamma }}_0\left(n\right),{\tilde{S}}_{x_i}:=\{u\in {\tilde{\Gamma }}_0\left(n\right)\mid i\in {Supp}_x\left(u\right)\}.$$

Proposition 6  

(Ghost invariance of support-controlled data). Let $({\tilde{\Gamma }}_0\left(n\right),{\tilde{\Gamma }}_1\left(n\right))$ be a support-preserving ghost relabeling of $({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right))$ in the sense of Definition 14. Then, the following quantities are preserved under the bijection θ:

(i)

Polygon membership;

(ii)

Valency and multiplicity;

(iii)

The Boolean stratification by x-degree;

(iv)

The support quiver, hence also the Hasse-diagram realization.

• Consequently, all invariants depending only on the x-support structure are unchanged by ghost relabeling.

Proof. 

The defining property of a support-preserving ghost relabeling is that

$${Supp}_x\left(\theta \left(w\right)\right)={Supp}_x\left(w\right)\mathrm{for}\mathrm{every}w\in {\Gamma }_0\left(n\right).$$

Thus, $\theta$ leaves unchanged the Boolean support carried by each vertex label. Since all the data under consideration are defined purely in terms of ${Supp}_x$, their invariance follows from this identity.

We first consider polygon membership. By Definition 5, a label $w\in {\Gamma }_0\left(n\right)$ belongs to the polygon $S_{x_i}$ if and only if $i\in {Supp}_x\left(w\right)$. On the relabeled side, by the definition of ${\tilde{\Gamma }}_1\left(n\right)$, the vertex $\theta \left(w\right)$ belongs to ${\tilde{S}}_{x_i}$ if and only if $i\in {Supp}_x\left(\theta \left(w\right)\right)$. Since ${Supp}_x\left(\theta \left(w\right)\right)={Supp}_x\left(w\right)$, we obtain

$$w\in S_{x_i}⟺i\in {Supp}_x\left(w\right)⟺i\in {Supp}_x\left(\theta \left(w\right)\right)⟺\theta \left(w\right)\in {\tilde{S}}_{x_i}$$

for every $i\in \left[n\right]$. Moreover, $w\in S_1$ for every $w\in {\Gamma }_0\left(n\right)$, and by definition $\theta \left(w\right)\in {\tilde{S}}_1={\tilde{\Gamma }}_0\left(n\right)$. Hence, polygon membership is preserved.

The same observation immediately yields the invariance of valency and multiplicity. Indeed, by Definition 2, both $val\left(w\right)$ and $\mu \left(w\right)$ depend only on the cardinality of the support, that is, only on

$${deg}_x\left(w\right)=\left|{Supp}_x\left(w\right)\right|.$$

Since ${Supp}_x\left(\theta \left(w\right)\right)={Supp}_x\left(w\right)$, one has

$${deg}_x\left(\theta \left(w\right)\right)={deg}_x\left(w\right),$$

and therefore

$$val\left(\theta \right(w\left)\right)=val\left(w\right),\mu \left(\theta \right(w\left)\right)=\mu \left(w\right).$$

In particular, the x-degree of a label is unchanged under $\theta$. This means that the partition of the vertex set into Boolean layers

$${\Gamma }_0^{\left(k\right)}\left(n\right):=\{w\in {\Gamma }_0\left(n\right)\mid {deg}_x\left(w\right)=k\}$$

is carried bijectively onto the corresponding partition of ${\tilde{\Gamma }}_0\left(n\right)$. Hence, the Boolean stratification by x-degree is preserved.

Finally, we examine the support quiver. By Definition 6, there is an arrow

$$w⟶w^{\prime }$$

in $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$ if and only if

$${Supp}_x\left(w\right)\subset {Supp}_x\left(w^{\prime }\right)\mathrm{and}|{Supp}_x\left(w^{\prime }\right)|=|{Supp}_x\left(w\right)|+1.$$

Because $\theta$ preserves supports exactly, this condition holds for the pair $(w,w^{\prime })$ if and only if it holds for $(\theta \left(w\right),\theta \left(w^{\prime }\right))$. Therefore

$$w⟶w^{\prime }⟺\theta \left(w\right)⟶\theta \left(w^{\prime }\right)$$

in the relabeled support quiver. It follows that $\theta$ induces an isomorphism between the two support quivers. Since the Hasse-diagram realization is obtained from the support quiver via the identification with the Boolean lattice, it is preserved as well.

Thus, every datum determined purely by the x-support, including polygon membership, valency, multiplicity, Boolean layer structure, and the support quiver, remains unchanged under ghost relabeling. This proves the claim. □

Remark 8.  

Proposition 6 makes precise the ghost principle underlying the paper: ghost variables may change the presentation of the labels while remaining compatible with a connected realization of the configuration. However, they do not alter the Boolean support geometry that governs incidences, valencies, multiplicities, quiver structure, and the global formulas derived later.

Remark 9  

(On the role of the third ghost variable). The present construction uses three ghost variables $y_1,y_2,y_3$ in order to keep the base family ${\mathcal{V}}_3$ symmetric with respect to the distinguished variables $x_1,x_2,x_3$. We do not claim here that three ghost variables are minimal for obtaining a connected realization with the same support-controlled invariants. The question of whether an analogous construction can be carried out with only two ghost variables is a natural minimality problem, but it lies beyond the scope of the present paper.

7.4. Reducedness and Loop-Freeness of the Support Quiver

We next verify two structural properties required for the standard formulas used in Section 9.

Definition 15  

(Truncated vertex). A vertex $\alpha \in {\Gamma }_0\left(n\right)$ is called truncated if

$$\mu \left(\alpha \right)val\left(\alpha \right)=1.$$

Following the standard convention for Brauer configurations, we call $\Gamma \left(n\right)$ reduced if it has no truncated vertices.

Proposition 7  

(Absence of truncated vertices). For every $n\ge 3$, the configuration $\Gamma \left(n\right)$ has no truncated vertices. In particular, it is reduced.

Proof. 

Let $\alpha \in {\Gamma }_0\left(n\right)$.

If ${Supp}_x\left(\alpha \right)=⌀$, then by Proposition 1 we have

$$\alpha =w_0=y_1{y}_2{y}_3.$$

Hence, $\mu \left(\alpha \right)=2$ and $val\left(\alpha \right)=1$, so

$$\mu \left(\alpha \right)val\left(\alpha \right)=2.$$

If ${Supp}_x\left(\alpha \right)\ne ⌀$, then ${deg}_x\left(\alpha \right)\ge 1$. By Definition 2,

$$\mu \left(\alpha \right)=1,val\left(\alpha \right)=1+{deg}_x\left(\alpha \right)\ge 2.$$

Therefore

$$\mu \left(\alpha \right)val\left(\alpha \right)\ge 2.$$

In all cases,

$$\mu \left(\alpha \right)val\left(\alpha \right)\ne 1.$$

Thus, no vertex is truncated, and $\Gamma \left(n\right)$ is reduced. □

Finally, we record the absence of loops in the support quiver.

Proposition 8  

(Loop-freeness of the support quiver). The support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$ has no loops.

Proof. 

Suppose there were a loop at some vertex $w\in {\Gamma }_0\left(n\right)$. By Definition 7, this would mean that $w{\prec }_{\mathrm{supp}}w$. But by Definition 6, the relation $w{\prec }_{\mathrm{supp}}w$ would require

$${Supp}_x\left(w\right)\subset {Supp}_x\left(w\right)\mathrm{and}|{Supp}_x\left(w\right)|=|{Supp}_x\left(w\right)|+1,$$

which is impossible. Therefore, no loop can occur in $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$. □

Corollary 3  

(Support-level structural summary). For every $n\ge 3$, the family $\Gamma \left(n\right)$ has the following support-level properties:

(i)

Its incidence graph is connected;

(ii)

It has no truncated vertices, hence it is reduced;

(iii)

Its support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$ is loop-free.

• Equivalently,

$$|C_{\Gamma \left(n\right)}|=1.$$

Proof. 

Statements (i), (ii), and (iii) are exactly Corollary 2, Proposition 7, and Proposition 8, respectively. □

Remark 10.  

Proposition 8 concerns only the Boolean support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$. By contrast, the standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ attached to the Brauer configuration ${\Gamma }^{\mathrm{std}}\left(n\right)$ is a different object and, by Theorem 2, it contains exactly one loop at the vertex $v_1$. This distinction is essential when the standard formulas for Brauer configuration algebras are applied in the next section.

8. Inductive Structure via the Lift Map

We now make explicit the recursive structure of the family ${\Gamma }_0\left(n\right)$ as the parameter n increases. From the Boolean point of view, passing from $[n-1]$ to $\left[n\right]$ amounts to introducing one new coordinate, namely the element n, and splitting the power set $\mathcal{P}\left(\right[n\left]\right)$ into those subsets that avoid n and those that contain it. On the level of vertex labels, the same phenomenon is realized by adjoining the new distinguished variable $x_n$. In this way, ${\Gamma }_0\left(n\right)$ decomposes into two canonically related layers: a first layer identified with ${\Gamma }_0(n-1)$, and a second one obtained from it by multiplication by $x_n$.

Definition 16  

(Lift map). For $n\ge 4$, we define the lift map

$$L_n:{\Gamma }_0(n-1)⟶{\Gamma }_0\left(n\right),L_n\left(w\right):=w{x}_n.$$

The terminology is natural: the map $L_n$ lifts a label from dimension $n-1$ to dimension n by adjoining the new variable $x_n$. Since the base family ${\mathcal{V}}_3$ remains unchanged and only the monomial factor in the variables $x_4,\dots ,x_n$ is modified, one expects this operation to describe exactly the second Boolean layer in dimension n.

Proposition 9  

(Two-layer decomposition). For each $n\ge 4$, the vertex set ${\Gamma }_0\left(n\right)$ decomposes as

$${\Gamma }_0\left(n\right)={\Gamma }_0(n-1)\bigsqcup L_n\left({\Gamma }_0(n-1)\right).$$

Moreover, $L_n$ is a bijection from ${\Gamma }_0(n-1)$ onto the second layer

$$\{w\in {\Gamma }_0\left(n\right)\mid n\in {Supp}_x\left(w\right)\}.$$

Proof. 

By Definition 4, every element of ${\Gamma }_0\left(n\right)$ is of the form

$$v{x}_A,v\in {\mathcal{V}}_3,A\subseteq I_n=\{4,\dots ,n\}.$$

Thus, the structure of ${\Gamma }_0\left(n\right)$ is completely controlled by the choice of the subset $A\subseteq I_n$. We therefore partition $\mathcal{P}\left(I_n\right)$ according to whether or not the index n belongs to A:

$$\mathcal{P}\left(I_n\right)=\{A\subseteq I_n\mid n\notin A\}\bigsqcup \{A\subseteq I_n\mid n\in A\}.$$

If $n\notin A$, then necessarily $A\subseteq I_{n-1}=\{4,\dots ,n-1\}$, and hence

$$v{x}_A\in {\Gamma }_0(n-1).$$

This identifies the first part of the decomposition with the old layer ${\Gamma }_0(n-1)$.

Now suppose that $n\in A$. Then, A can be written uniquely as

$$A=B\cup \left\{n\right\},B\subseteq I_{n-1}.$$

Therefore

$$v{x}_A=v{x}_{B\cup \left\{n\right\}}=v{x}_B{x}_n=L_n\left(v{x}_B\right),$$

with $v{x}_B\in {\Gamma }_0(n-1)$. This shows that every label in ${\Gamma }_0\left(n\right)$ whose support contains n lies in the image of the lift map. Hence

$${\Gamma }_0\left(n\right)\subseteq {\Gamma }_0(n-1)\cup L_n\left({\Gamma }_0(n-1)\right).$$

The reverse inclusion is immediate from the definition of $L_n$, so we obtain

$${\Gamma }_0\left(n\right)={\Gamma }_0(n-1)\cup L_n\left({\Gamma }_0(n-1)\right).$$

It remains to prove that this union is disjoint. If $w\in {\Gamma }_0(n-1)$, then by construction no factor $x_n$ occurs in w. On the other hand, every element of $L_n\left({\Gamma }_0(n-1)\right)$ is divisible by $x_n$. Hence

$${\Gamma }_0(n-1)\cap L_n\left({\Gamma }_0(n-1)\right)=⌀,$$

and the decomposition is indeed a disjoint union.

Finally, the image of $L_n$ is exactly the set of vertices $w\in {\Gamma }_0\left(n\right)$ such that $n\in {Supp}_x\left(w\right)$. Indeed, by definition every lifted label $L_n\left(w\right)=w{x}_n$ is divisible by $x_n$, so $n\in {Supp}_x\left(L_n\left(w\right)\right)$. Conversely, if $u\in {\Gamma }_0\left(n\right)$ satisfies $n\in {Supp}_x\left(u\right)$, then the argument above shows that $u=v{x}_B{x}_n=L_n\left(v{x}_B\right)$ for a unique label $v{x}_B\in {\Gamma }_0(n-1)$. Thus, $L_n$ is a bijection from ${\Gamma }_0(n-1)$ onto the second layer

$$\{w\in {\Gamma }_0\left(n\right)\mid n\in {Supp}_x\left(w\right)\}.$$

This proves the claim. □

Remark 11.  

Under the Boolean identification of Proposition 2, the two-layer decomposition of ${\Gamma }_0\left(n\right)$ corresponds exactly to the standard partition

$$\mathcal{P}\left(\right[n\left]\right)=\{S\subseteq [n]\mid n\notin S\}\bigsqcup \{S\subseteq [n]\mid n\in S\}.$$

In this correspondence, the lift map $L_n$ acts by adjoining the element n to the underlying subset. Thus, the recursive structure of ${\Gamma }_0\left(n\right)$ is nothing but the support-level shadow of the elementary Boolean decomposition of $\mathcal{P}\left(\right[n\left]\right)$.

The first low-dimensional instances of this decomposition are displayed explicitly in Appendix A. In particular, the cases $\mathrm{GRASS}\left(4\right)$ and $\mathrm{GRASS}\left(5\right)$ illustrate how the successive lift operations produce two and four copies, respectively, of the base family $V_3$. Moreover, the preceding decomposition is reflected immediately in the support map and in the numerical data derived from it.

Proposition 10  

(${Supp}_x$, x-degree, and valency under the lift). For every $w\in {\Gamma }_0(n-1)$, one has

$${Supp}_x\left(L_n\left(w\right)\right)={Supp}_x\left(w\right)\cup \left\{n\right\},{deg}_x\left(L_n\left(w\right)\right)={deg}_x\left(w\right)+1,$$

and consequently

$$val\left(L_n\left(w\right)\right)=val\left(w\right)+1.$$

Proof. 

Let $w\in {\Gamma }_0(n-1)$. By definition,

$$L_n\left(w\right)=w{x}_n.$$

Since the factor $x_n$ appears explicitly in this product, we certainly have

$$n\in {Supp}_x\left(L_n\left(w\right)\right).$$

We claim that no other support coordinate is altered. Indeed, for every $i\in \{1,\dots ,n-1\}$, the variable $x_i$ divides $L_n\left(w\right)=w{x}_n$ if and only if it already divides w, because multiplication by $x_n$ introduces no new factor $x_i$ with $i\ne n$, and it does not remove any existing divisibility by such a variable. Therefore

$$i\in {Supp}_x\left(L_n\left(w\right)\right)⟺i\in {Supp}_x\left(w\right)(1\le i\le n-1).$$

Together with $n\in {Supp}_x\left(L_n\left(w\right)\right)$, this proves that

$${Supp}_x\left(L_n\left(w\right)\right)={Supp}_x\left(w\right)\cup \left\{n\right\}.$$

Taking cardinalities on both sides, we obtain

$${deg}_x\left(L_n\left(w\right)\right)=\left|{Supp}_x\left(w\right)\cup \left\{n\right\}\right|=\left|{Supp}_x\left(w\right)\right|+1={deg}_x\left(w\right)+1,$$

because $n\notin {Supp}_x\left(w\right)$ for every $w\in {\Gamma }_0(n-1)$.

Finally, by Definition 2,

$$val\left(u\right)=1+{deg}_x\left(u\right)\mathrm{for}\mathrm{every}u.$$

Applying this identity to $u=L_n\left(w\right)$ and using the formula just established for the x-degree, we get

$$val\left(L_n\left(w\right)\right)=1+{deg}_x\left(L_n\left(w\right)\right)=1+\left({deg}_x\left(w\right)+1\right)=val\left(w\right)+1.$$

This proves the proposition. □

9. Global Invariants

Having now distinguished the standard Brauer configuration

$${\Gamma }^{\mathrm{std}}\left(n\right)=\left({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right),\mu ,{\mathfrak{o}}_n\right)$$

from the Boolean support quiver, we may compute the main global invariants of the associated Brauer configuration algebra ${\Lambda }_{\Gamma \left(n\right)}$. Most of the relevant quantities remain support-controlled: since the multiplicity and valency functions depend only on the x-support, all global sums reduce to binomial counts over the Boolean layers of $\mathcal{P}\left(\right[n\left]\right)$. The only genuinely Brauer-quiver-theoretic datum entering the center formula is the number of loops in the standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$, which must be kept separate from the loop-free property of the Boolean support quiver. This distinction is essential for the correctness of the formulas below.

This emphasis on explicit support-controlled invariants is consistent with other combinatorial Brauer families in which numerical invariants can be derived directly from the defining data; compare [22,25].

9.1. Center Dimension

Since ${\Gamma }^{\mathrm{std}}\left(n\right)$ is a connected reduced Brauer configuration by Theorem 1, we may apply the standard center-dimension formula for Brauer configuration algebras in the connected reduced case; see [21]:

$$dimZ\left({\Lambda }_{\Gamma }\right)=1+\sum _{\alpha \in {\Gamma }_0}\mu \left(\alpha \right)+|{\Gamma }_1|-|{\Gamma }_0|+\#\mathrm{Loops} - |C_{\Gamma }|.$$

(3)

In our situation, the relevant terms are explicitly known. By Definition 5,

$$|{\Gamma }_1\left(n\right)|=n+1,$$

while Definition 4 gives

$$|{\Gamma }_0\left(n\right)|=2^n.$$

Moreover, the incidence graph is connected by Corollary 2, so

$$|C_{\Gamma \left(n\right)}|=1.$$

The multiplicity sum was computed in Proposition 1, namely

$$\sum _{\alpha \in {\Gamma }_0\left(n\right)}\mu \left(\alpha \right)=2^n+1.$$

Finally, by Theorem 2, the standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ contains exactly one loop, namely the loop at the vertex $v_1$. Therefore

$$\#\mathrm{Loops}=1.$$

Substituting these data into (3) yields the following formula.

Theorem 4  

(Center dimension). For every $n\ge 3$,

$$dimZ\left({\Lambda }_{\Gamma \left(n\right)}\right)=n+3.$$

Proof. 

Using the identities above in (3), we obtain

$$\begin{array}{cc}\hfill dimZ\left({\Lambda }_{\Gamma \left(n\right)}\right)& =1+(2^n+1)+(n+1)-2^n+1-1\hfill \\ \hfill & =n+3.\hfill \end{array}$$

This proves the claim. □

9.2. Total Dimension of the Algebra

We next use the standard dimension formula for Brauer configuration algebras:

$$dim{\Lambda }_{\Gamma }=2\left|{\Gamma }_1\right|+\sum _{\alpha \in {\Gamma }_0}val\left(\alpha \right)\left(val\left(\alpha \right)-1\right).$$

(4)

Because the valency depends only on the Hamming layer $k={deg}_x\left(\alpha \right)$, the vertex sum in (4) reduces to a weighted binomial moment over the Boolean lattice.

Lemma 2  

(First and second binomial moments). For every $n\ge 1$, one has

$${\displaystyle \sum _{k=0}^n}k\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=n{2}^{n-1},{\displaystyle \sum _{k=0}^n}{k}^2\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=n(n-1)2^{n-2}+n{2}^{n-1}.$$

Proof. 

Starting from the binomial identity

$${(1+t)}^n={\displaystyle \sum _{k=0}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)t^k,$$

we differentiate once to obtain

$$n{(1+t)}^{n-1}={\displaystyle \sum _{k=0}^n}k\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)t^{k-1}.$$

Multiplying by t and setting $t=1$ gives

$${\displaystyle \sum _{k=0}^n}k\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=n{2}^{n-1}.$$

Differentiating a second time yields

$$n(n-1){(1+t)}^{n-2}={\displaystyle \sum _{k=0}^n}k(k-1)\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)t^{k-2}.$$

Multiplying by $t^2$ and setting $t=1$ gives

$${\displaystyle \sum _{k=0}^n}k(k-1)\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=n(n-1)2^{n-2}.$$

Since $k^2=k(k-1)+k$, it follows that

$${\displaystyle \sum _{k=0}^n}{k}^2\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)={\displaystyle \sum _{k=0}^n}k(k-1)\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)+{\displaystyle \sum _{k=0}^n}k\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=n(n-1)2^{n-2}+n{2}^{n-1}.$$

□

Theorem 5  

(Total dimension). For every $n\ge 3$, the total dimension of the associated algebra is

$$dim{\Lambda }_{\Gamma \left(n\right)}=n{2}^{n-2}(n+3)+2(n+1).$$

Proof. 

By Definition 2,

$$val\left(\alpha \right)=1+{deg}_x\left(\alpha \right),$$

and hence

$$val\left(\alpha \right)\left(val\left(\alpha \right)-1\right)=(1+{deg}_x\left(\alpha \right)){deg}_x\left(\alpha \right).$$

Under the Boolean identification

$${\Gamma }_0\left(n\right)\cong \mathcal{P}\left(\left[n\right]\right)$$

from Proposition 2, there are exactly $\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)$ vertices of x-degree k. Therefore

$$\begin{array}{cc}\hfill {\displaystyle \sum _{\alpha \in {\Gamma }_0\left(n\right)}}val\left(\alpha \right)\left(val\left(\alpha \right)-1\right)& ={\displaystyle \sum _{k=0}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)(k+1)k\hfill \\ \hfill & ={\displaystyle \sum _{k=0}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)(k^2+k)\hfill \\ \hfill & ={\displaystyle \sum _{k=0}^n}{k}^2\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)+{\displaystyle \sum _{k=0}^n}k\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right).\hfill \end{array}$$

Applying Lemma 2, we obtain

$$\begin{array}{cc}\hfill \sum _{\alpha \in {\Gamma }_0\left(n\right)}val\left(\alpha \right)\left(val\left(\alpha \right)-1\right)& =\left(n(n-1)2^{n-2}+n{2}^{n-1}\right)+n{2}^{n-1}\hfill \\ \hfill & =n(n-1)2^{n-2}+n{2}^n.\hfill \end{array}$$

Since $|{\Gamma }_1\left(n\right)|=n+1$, Formula (4) gives

$$\begin{array}{cc}\hfill dim{\Lambda }_{\Gamma \left(n\right)}& =2(n+1)+\left(n(n-1)2^{n-2}+n{2}^n\right)\hfill \\ \hfill & =2(n+1)+n{2}^{n-2}\left((n-1)+4\right)\hfill \\ \hfill & =2(n+1)+n{2}^{n-2}(n+3),\hfill \end{array}$$

as required. □

9.3. Vertex Weights, Layer Weights, and Entropy

We now turn to the weighted distribution induced by the support-controlled multiplicity and valency data. Since the referee correctly observed that vertex entropy and layer entropy are different quantities, we treat them separately from the outset.

We begin with the normalization constant

$$d_{\Gamma \left(n\right)}:=\sum _{\alpha \in {\Gamma }_0\left(n\right)}\mu \left(\alpha \right)val\left(\alpha \right),$$

(5)

and the corresponding vertex weights

$$q_{\alpha }:={\displaystyle \frac{\mu \left(\alpha \right)val\left(\alpha \right)}{d_{\Gamma \left(n\right)}}}(\alpha \in {\Gamma }_0\left(n\right)).$$

(6)

The associated vertex entropy is

$$H_{\mathrm{vert}}(\Gamma \left(n\right))=-\sum _{\alpha \in {\Gamma }_0\left(n\right)}{q}_{\alpha }{log}_2\left(q_{\alpha }\right).$$

(7)

For notational continuity, one may also write

$$H(\Gamma \left(n\right)):=H_{\mathrm{vert}}(\Gamma \left(n\right)).$$

The first step is to compute $d_{\Gamma \left(n\right)}$ explicitly.

Theorem 6  

(Closed form for $d_{\Gamma \left(n\right)}$). For every $n\ge 3$,

$$d_{\Gamma \left(n\right)}=2^{n-1}(n+2)+1.$$

Proof. 

We split the sum in (5) into the contribution of the unique vertex with empty x-support and the contribution of all remaining vertices.

By Proposition 1, the unique vertex with empty x-support is

$$w_0=y_1{y}_2{y}_3.$$

Since $\mu \left(w_0\right)=2$, ${deg}_x\left(w_0\right)=0$, and $val\left(w_0\right)=1+{deg}_x\left(w_0\right)=1$, its contribution is

$$\mu \left(w_0\right)val\left(w_0\right)=2·1=2.$$

Now let $\alpha \in {\Gamma }_0\left(n\right)$ with ${deg}_x\left(\alpha \right)=k\ge 1$. Then

$$\mu \left(\alpha \right)=1,val\left(\alpha \right)=k+1.$$

For each k, there are exactly $\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)$ such vertices, so

$$\begin{array}{cc}\hfill d_{\Gamma \left(n\right)}& =2+{\displaystyle \sum _{k=1}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)(k+1)\hfill \\ \hfill & =2+{\displaystyle \sum _{k=1}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)k+{\displaystyle \sum _{k=1}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right).\hfill \end{array}$$

Using Lemma 2, we obtain

$${\displaystyle \sum _{k=1}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)k={\displaystyle \sum _{k=0}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)k=n{2}^{n-1},$$

while

$${\displaystyle \sum _{k=1}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=\left({\displaystyle \sum _{k=0}^n}\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)\right)-\left({\displaystyle \genfrac{}{}{0pt}{}{n}{0}}\right)=2^n-1.$$

Substituting back gives

$$\begin{array}{cc}\hfill d_{\Gamma \left(n\right)}& =2+n{2}^{n-1}+(2^n-1)\hfill \\ \hfill & =1+n{2}^{n-1}+2^n\hfill \\ \hfill & =1+2^{n-1}(n+2),\hfill \end{array}$$

as claimed. □

To organize the weighted distribution macroscopically, we group the vertex weights by Hamming layers. For each $k=0,\dots ,n$, define the k-th layer weight by

$$W_k:=\sum _{\begin{array}{c}\alpha \in {\Gamma }_0\left(n\right)\\ {deg}_x\left(\alpha \right)=k\end{array}}\mu \left(\alpha \right)val\left(\alpha \right).$$

(8)

Thus

$$d_{\Gamma \left(n\right)}={\displaystyle \sum _{k=0}^n}{W}_k.$$

The normalized layer probabilities are then

$$p_k:={\displaystyle \frac{W_k}{d_{\Gamma \left(n\right)}}},0\le k\le n.$$

(9)

These define a probability distribution on the set of Hamming layers, and the corresponding layer entropy is

$$H_{\mathrm{layer}}(\Gamma \left(n\right))=-{\displaystyle \sum _{k=0}^n}{p}_k{log}_2\left(p_k\right).$$

(10)

Proposition 11  

(Closed form for the layer weights). For every $n\ge 3$, the layer weights satisfy

$$W_0=2,W_k=(k+1)\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)\mathrm{for}1\le k\le n.$$

Consequently,

$$d_{\Gamma \left(n\right)}=2+{\displaystyle \sum _{k=1}^n}(k+1)\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right).$$

Proof. 

For $k=0$, Proposition 1 shows that the unique vertex of x-degree zero is

$$w_0=y_1{y}_2{y}_3.$$

Since $\mu \left(w_0\right)=2$ and $val\left(w_0\right)=1$, we obtain

$$W_0=\mu \left(w_0\right)val\left(w_0\right)=2.$$

Now fix $k\ge 1$. Under the Boolean identification

$${\Gamma }_0\left(n\right)\cong \mathcal{P}\left(\left[n\right]\right),$$

there are exactly $\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)$ vertices $\alpha$ with ${deg}_x\left(\alpha \right)=k$. For each such vertex,

$$\mu \left(\alpha \right)=1,val\left(\alpha \right)=k+1.$$

Hence

$$W_k=\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)(k+1).$$

Summing over all layers yields the stated decomposition of $d_{\Gamma \left(n\right)}$. □

Remark 12  

(Fixed multiplicity parameter at the zero-support vertex). One may replace the distinguished multiplicity value $\mu \left(w_0\right)=2$ at the unique vertex $w_0$ with empty x-support by an arbitrary fixed parameter $m\ge 1$, while keeping $\mu \left(\alpha \right)=1$ for all vertices with nonempty support. In that case, the normalization constant becomes

$$d_{\Gamma \left(n\right)}^{\left(m\right)}=m+{\displaystyle \sum _{k=1}^n}(k+1)\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)=2^{n-1}(n+2)+(m-1),$$

and the only layer weight that changes is

$$W_0^{\left(m\right)}=m.$$

Hence, the induced layer probabilities satisfy

$$p_0^{\left(m\right)}={\displaystyle \frac{m}{d_{\Gamma \left(n\right)}^{\left(m\right)}}},p_k^{\left(m\right)}={\displaystyle \frac{(k+1)\left(\genfrac{}{}{0pt}{}{n}{k}\right)}{d_{\Gamma \left(n\right)}^{\left(m\right)}}}(1\le k\le n).$$

For every fixed m, this modifies the layer distribution only by a lower-order term, so the middle-layer concentration and the logarithmic asymptotic law for the layer entropy remain unchanged as $n\to \infty$.

Proposition 12  

(Exact decomposition of vertex entropy by layers). Let

$$N_0:=1,N_k:=\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right)(1\le k\le n).$$

Then

$$H_{\mathrm{vert}}(\Gamma \left(n\right))=H_{\mathrm{layer}}(\Gamma \left(n\right))+{\displaystyle \sum _{k=0}^n}{p}_k{log}_2\left(N_k\right).$$

Equivalently,

$$H_{\mathrm{vert}}(\Gamma \left(n\right))=H_{\mathrm{layer}}(\Gamma \left(n\right))+{\displaystyle \sum _{k=1}^n}{p}_k{log}_2\left({\displaystyle \genfrac{}{}{0pt}{}{n}{k}}\right).$$

Proof. 

For each k, all vertices in the k-th Hamming layer carry the same individual weight. Indeed, if ${deg}_x\left(\alpha \right)=k$, then

$$q_{\alpha }={\displaystyle \frac{\mu \left(\alpha \right)val\left(\alpha \right)}{d_{\Gamma \left(n\right)}}}=\left\{\begin{array}{cc}{\displaystyle \frac{2}{d_{\Gamma \left(n\right)}}},\hfill & k=0,\hfill \\ {\displaystyle \frac{k+1}{d_{\Gamma \left(n\right)}}},\hfill & k\ge 1.\hfill \end{array}\right.$$

Since there are $N_k$ vertices in the k-th layer and the total weight of that layer is $p_k$, each vertex in that layer has weight

$$q_{\alpha }={\displaystyle \frac{p_k}{N_k}}.$$

Therefore, grouping the sum in (7) by layers, we obtain

$$\begin{array}{cc}\hfill H_{\mathrm{vert}}(\Gamma \left(n\right))& =-{\displaystyle \sum _{k=0}^n}\sum _{\begin{array}{c}\alpha \in {\Gamma }_0\left(n\right)\\ {deg}_x\left(\alpha \right)=k\end{array}}{\displaystyle \frac{p_k}{N_k}}{log}_2\left({\displaystyle \frac{p_k}{N_k}}\right)\hfill \\ \hfill & =-{\displaystyle \sum _{k=0}^n}{N}_k·{\displaystyle \frac{p_k}{N_k}}{log}_2\left({\displaystyle \frac{p_k}{N_k}}\right)\hfill \\ \hfill & =-{\displaystyle \sum _{k=0}^n}{p}_k{log}_2\left(p_k\right)+{\displaystyle \sum _{k=0}^n}{p}_k{log}_2\left(N_k\right).\hfill \end{array}$$

The first sum is exactly $H_{\mathrm{layer}}(\Gamma \left(n\right))$, which proves the claim. □

Corollary 4  

(Explicit form of the layer distribution). For every $n\ge 3$,

$$p_0={\displaystyle \frac{2}{d_{\Gamma \left(n\right)}}},p_k={\displaystyle \frac{(k+1)\left(\genfrac{}{}{0pt}{}{n}{k}\right)}{d_{\Gamma \left(n\right)}}}\mathrm{for}1\le k\le n.$$

Moreover,

$${\displaystyle \sum _{k=0}^n}{p}_k=1.$$

Proof. 

This is immediate from Proposition 11 and the definition of $d_{\Gamma \left(n\right)}$. □

Remark 13.  

Proposition 12 is the precise relation between the two entropies. The layer entropy $H_{\mathrm{layer}}(\Gamma \left(n\right))$ measures the macroscopic distribution of mass across Hamming layers, whereas the vertex entropy $H_{\mathrm{vert}}(\Gamma \left(n\right))$ also includes the conditional contribution coming from the multiplicity of vertices inside each layer. In particular, these two quantities should not be identified.

The weights $p_k$ differ from the usual binomial distribution only by the additional factor $k+1$, which is of polynomial size in n. As a consequence, the dominant mass still lies in the middle Hamming layers.

Proposition 13  

(Comparison with the binomial law). Let

$$b_k:={\displaystyle \frac{\left(\genfrac{}{}{0pt}{}{n}{k}\right)}{2^n}},0\le k\le n,$$

be the $\mathrm{Bin}(n,\frac{1}{2})$ distribution. Then, for $1\le k\le n$,

$$p_k={\displaystyle \frac{2(k+1)}{n+2+2^{1-n}}}{b}_k.$$

(11)

In particular, for all $k\in \{1,\dots ,n\}$,

$$p_k={\displaystyle \frac{2(k+1)}{n+2}}{b}_k+O\left(2^{-n}{b}_k\right),$$

uniformly in k.

Proof. 

By Corollary 4 and Theorem 6,

$$p_k={\displaystyle \frac{(k+1)\left(\genfrac{}{}{0pt}{}{n}{k}\right)}{2^{n-1}(n+2)+1}}.$$

Factoring out $2^n$ from the denominator gives

$$2^{n-1}(n+2)+1=2^n\left({\displaystyle \frac{n+2}{2}}+2^{-n}\right)=2^n\left({\displaystyle \frac{n+2+2^{1-n}}{2}}\right).$$

Therefore

$$p_k={\displaystyle \frac{(k+1)\left(\genfrac{}{}{0pt}{}{n}{k}\right)}{2^n}}·{\displaystyle \frac{2}{n+2+2^{1-n}}}={\displaystyle \frac{2(k+1)}{n+2+2^{1-n}}}{b}_k,$$

which proves (11). The asymptotic form follows immediately. □

We now formalize the concentration of the layer distribution on the middle Hamming layers.

Theorem 7  

(Concentration on the middle layers). Fix $\epsilon >0$. Then

$$\sum _{\begin{array}{c}0\le k\le n\\ |k-n/2|\ge \epsilon n\end{array}}{p}_k⟶0\mathit{as}n\to \infty .$$

In other words, the layer distribution ${\left(p_k\right)}_{k=0}^n$ is asymptotically concentrated on the middle Hamming layers.

Proof. 

By Proposition 13, for $1\le k\le n$,

$$p_k={\displaystyle \frac{2(k+1)}{n+2+2^{1-n}}}{b}_k.$$

Since $k+1\le n+1$, we have

$$p_k\le {\displaystyle \frac{2(n+1)}{n+2+2^{1-n}}}{b}_k\le 2b_k$$

for all sufficiently large n. Therefore

$$\sum _{\begin{array}{c}1\le k\le n\\ |k-n/2|\ge \epsilon n\end{array}}{p}_k\le 2\sum _{\begin{array}{c}1\le k\le n\\ |k-n/2|\ge \epsilon n\end{array}}{b}_k.$$

The right-hand side tends to 0 by the standard concentration of the binomial distribution $\mathrm{Bin}(n,\frac{1}{2})$. Since

$$p_0={\displaystyle \frac{2}{d_{\Gamma \left(n\right)}}}\to 0,$$

the full sum also tends to 0. This proves the claim. □

The preceding result shows that the layer distribution is asymptotically governed by the bulk of the Boolean lattice. In particular, any fixed family of extremal vertices or paths carries only a negligible fraction of the total weight.

To make this explicit, consider a maximal directed path in the Hasse diagram

$$⌀=S_0\to S_1\to ···\to S_n=\left[n\right],\left|S_k\right|=k.$$

Such a path meets exactly one vertex in each Hamming layer.

Proposition 14  

(Negligible mass of a fixed maximal path). Let

$$\mathcal{P}=\{S_0,S_1,\dots ,S_n\}$$

be the vertex set of any fixed maximal directed path from ⌀ to $\left[n\right]$ in the Hasse diagram of $\mathcal{P}\left(\right[n\left]\right)$. Then

$${\displaystyle \frac{1}{d_{\Gamma \left(n\right)}}}\sum _{\alpha \in \mathcal{P}}\mu \left(\alpha \right)val\left(\alpha \right)⟶0\mathit{as}n\to \infty .$$

In particular, the contribution of any fixed long diagonal is asymptotically negligible.

Proof. 

Along such a path, there is exactly one vertex of each x-degree k, $0\le k\le n$. Hence

$$\sum _{\alpha \in \mathcal{P}}\mu \left(\alpha \right)val\left(\alpha \right)=2+{\displaystyle \sum _{k=1}^n}(k+1).$$

Indeed, the unique degree-zero vertex contributes 2, and for $k\ge 1$ the unique vertex on the path in layer k has multiplicity 1 and valency $k+1$. Therefore

$$\sum _{\alpha \in \mathcal{P}}\mu \left(\alpha \right)val\left(\alpha \right)=2+{\displaystyle \sum _{k=1}^n}(k+1)=2+{\displaystyle \frac{n(n+1)}{2}}+n=2+{\displaystyle \frac{n(n+3)}{2}}.$$

On the other hand, by Theorem 6,

$$d_{\Gamma \left(n\right)}=2^{n-1}(n+2)+1.$$

Thus

$$0\le {\displaystyle \frac{1}{d_{\Gamma \left(n\right)}}}\sum _{\alpha \in \mathcal{P}}\mu \left(\alpha \right)val\left(\alpha \right)\le {\displaystyle \frac{2+\frac{n(n+3)}{2}}{2^{n-1}(n+2)+1}},$$

and the right-hand side tends to 0 exponentially fast as $n\to \infty$. □

We can now pass to the asymptotics of the layer entropy. Since the distribution $p_k$ differs from the binomial law only by a multiplicative factor that is asymptotically 1 on the central window $|k-n/2|=O\left(\sqrt{n}\right)$, the leading asymptotic coincides with that of the entropy of $\mathrm{Bin}(n,\frac{1}{2})$.

Theorem 8  

(Asymptotic law for the layer entropy). As $n\to \infty$,

$$H_{\mathrm{layer}}(\Gamma \left(n\right))={\displaystyle \frac{1}{2}}{log}_{2}n+{\displaystyle \frac{1}{2}}{log}_2\left({\displaystyle \frac{\pi e}{2}}\right)+o\left(1\right).$$

Proof. 

Recall that

$$H_{\mathrm{layer}}(\Gamma \left(n\right))=-{\displaystyle \sum _{k=0}^n}{p}_k{log}_2{p}_k,$$

where $p_k$ is given by Corollary 4. Let

$$b_k={\displaystyle \frac{\left(\genfrac{}{}{0pt}{}{n}{k}\right)}{2^n}}$$

denote the binomial distribution. By Proposition 13, for $1\le k\le n$,

$$p_k=c_{n,k}{b}_k,c_{n,k}:={\displaystyle \frac{2(k+1)}{n+2+2^{1-n}}}.$$

Fix $M>0$, and define the central window

$$C_n\left(M\right):=\left\{k:|k-n/2|\le M\sqrt{n}\right\}.$$

By Theorem 7, the total $p_k$-mass outside $C_n\left(M\right)$ tends to 0 as $n\to \infty$, and similarly the total $b_k$-mass outside $C_n\left(M\right)$ tends to 0.

Now let $k\in C_n\left(M\right)$. Then

$$k+1={\displaystyle \frac{n}{2}}+O\left(\sqrt{n}\right),$$

uniformly on $C_n\left(M\right)$, and therefore

$$c_{n,k}=1+O\left(n^{-1/2}\right).$$

Hence

$$p_k=b_k\left(1+O\left(n^{-1/2}\right)\right)$$

uniformly for $k\in C_n\left(M\right)$.

Using the expansion

$$-x(1+\delta ){log}_2\left(x(1+\delta )\right)=-x{log}_{2}x+O\left(\right|\delta \left|x\right|logx\left|\right)+O\left(\right|\delta \left|x\right),$$

valid for small $\delta$, we conclude that on the central window

$$-\sum _{k\in C_n\left(M\right)}{p}_k{log}_2{p}_k=-\sum _{k\in C_n\left(M\right)}{b}_k{log}_2{b}_k+o\left(1\right).$$

Since the contribution from the complement of $C_n\left(M\right)$ is $o\left(1\right)$, it follows that

$$H_{\mathrm{layer}}(\Gamma \left(n\right))=-{\displaystyle \sum _{k=0}^n}{b}_k{log}_2{b}_k+o\left(1\right).$$

The right-hand side is the entropy of the binomial distribution $\mathrm{Bin}(n,\frac{1}{2})$, whose classical asymptotic form is

$$-{\displaystyle \sum _{k=0}^n}{b}_k{log}_2{b}_k={\displaystyle \frac{1}{2}}{log}_{2}n+{\displaystyle \frac{1}{2}}{log}_2\left({\displaystyle \frac{\pi e}{2}}\right)+o\left(1\right);$$

see, for instance, ref. [27]. Therefore

$$H_{\mathrm{layer}}(\Gamma \left(n\right))={\displaystyle \frac{1}{2}}{log}_{2}n+{\displaystyle \frac{1}{2}}{log}_2\left({\displaystyle \frac{\pi e}{2}}\right)+o\left(1\right),$$

as claimed. □

Corollary 5  

(Middle-layer dominance). As $n\to \infty$, the layer entropy $H_{\mathrm{layer}}(\Gamma \left(n\right))$ is asymptotically governed by the middle Hamming layers, while any fixed maximal path contributes a vanishing fraction of the total vertex weight.

Proof. 

The first statement is a reformulation of Theorem 7, while the second follows from Proposition 14. □

10. Boolean-Hypercube Consequences of the Support Identification

In this section, we exploit the Boolean identification

$${\Phi }_n:{\Gamma }_0\left(n\right)⟶\mathcal{P}\left(\left[n\right]\right)$$

from Proposition 2 in order to transport standard geometric features of the Boolean lattice to the support-defined vertex set ${\Gamma }_0\left(n\right)$. Thus, the results proved below should be understood as consequences of the hypercube structure carried to ${\Gamma }_0\left(n\right)$ through the support map, rather than as intrinsic properties of the standard Brauer quiver itself. This distinction is important: the standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$ and the Boolean support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$ are different objects, as shown in Corollary 1, whereas the present section concerns the geometry of the Boolean support model.

Via the identification

$${\Gamma }_0\left(n\right)\cong \mathcal{P}\left(\left[n\right]\right)\cong {\{0,1\}}^n,$$

the support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$ becomes the Hasse diagram of the Boolean lattice and hence inherits the natural metric and projection structure of the n-dimensional hypercube. This viewpoint allows us to formalize two complementary phenomena: the rigidity of antipodal pairs under coordinate deletion, and the persistence of low-degree layers under the same operation.

In particular, the geometric object underlying the discussion is the hypercube viewed both as a ranked poset and as a distance-regular graph, two perspectives that have been extensively studied in the literature; see [10,11].

10.1. Hamming Distance and Algebraic Locality

We equip $\mathcal{P}\left(\right[n\left]\right)$ with the Hamming distance

$${\mathrm{dist}}_H(S,T)=|S▵T|,$$

where Δ denotes symmetric difference. Since the Hasse diagram of $\mathcal{P}\left(\right[n\left]\right)$ is the n-dimensional hypercube, this metric counts the minimal number of edges in the underlying undirected graph needed to connect the vertices S and T. In particular,

$${\mathrm{dist}}_H(S,T)=1$$

if and only if S and T differ by exactly one coordinate, equivalently, if and only if they are joined by a single edge in the Hasse diagram.

Transported back to ${\Gamma }_0\left(n\right)$ through the map ${\Phi }_n$, this metric measures a form of support-level locality: vertices lying in nearby Boolean layers are connected by short chains of covering relations in the support quiver, whereas vertices that are far apart require many successive support changes. The extremal case is realized by antipodal pairs, whose supports differ in every coordinate.

10.2. Coordinate Projections

For each $i\in \left[n\right]$, define the coordinate projection

$${\pi }_i:\mathcal{P}\left(\left[n\right]\right)⟶\mathcal{P}(\left[n\right]\setminus \left\{i\right\}),{\pi }_i\left(S\right)=S\setminus \left\{i\right\}.$$

(12)

This operation deletes the i-th coordinate and may be viewed as a purely combinatorial analogue of removing one subsystem from an n-partite configuration.

The effect of this operation on Hamming distance is completely explicit.

Lemma 3  

(Hamming distance under projection). For all $S,T\subseteq \left[n\right]$ and all $i\in \left[n\right]$,

$${\mathrm{dist}}_H\left({\pi }_i\left(S\right),{\pi }_i\left(T\right)\right)={\mathrm{dist}}_H(S,T)-{\mathbf{1}}_{\{i\in S▵T\}}.$$

(13)

Proof. 

By definition of Hamming distance,

$${\mathrm{dist}}_H\left({\pi }_i\left(S\right),{\pi }_i\left(T\right)\right)=\left|{\pi }_i\left(S\right)▵{\pi }_i\left(T\right)\right|.$$

Now deleting the coordinate i removes that element from the symmetric difference exactly when $i\in S▵T$, and leaves the symmetric difference unchanged otherwise. Therefore

$${\pi }_i\left(S\right)▵{\pi }_i\left(T\right)=\left(S▵T\right)\setminus \left(\left\{i\right\}\cap (S▵T)\right),$$

and hence

$$\left|{\pi }_i\left(S\right)▵{\pi }_i\left(T\right)\right|=|S▵T|-{\mathbf{1}}_{\{i\in S▵T\}}.$$

Since $|S▵T|={\mathrm{dist}}_H(S,T)$, the claimed identity follows. □

This lemma will be the basic tool in what follows. It shows that the effect of deleting one coordinate is completely controlled by whether that coordinate contributes to the original symmetric difference.

10.3. Antipodal Rigidity Under Projection

For every $S\subseteq \left[n\right]$, let

$$\overline{S}:=\left[n\right]\setminus S$$

denote the complementary subset. The pair $(S,\overline{S})$ is antipodal in the hypercube, and satisfies

$${\mathrm{dist}}_H(S,\overline{S})=n,$$

since $S▵\overline{S}=\left[n\right]$.

The next theorem records the rigidity of such antipodal pairs under coordinate deletion.

Theorem 9  

(Antipodal rigidity under projection). Let $n\ge 3$ and let $(S,\overline{S})$ be an antipodal pair in $\mathcal{P}\left(\right[n\left]\right)$. Then, the following statements hold.

(i)

Uniform loss under projection. For every $i\in \left[n\right]$,

$${\mathrm{dist}}_H\left({\pi }_i\left(S\right),{\pi }_i\left(\overline{S}\right)\right)=n-1.$$

(ii)

Uniqueness at maximal distance. If $T\subseteq \left[n\right]$ satisfies

$${\mathrm{dist}}_H(S,T)=n,$$

then necessarily

$$T=\overline{S}.$$

(iii)

Strict additivity across coordinate partitions. For every partition

$$\left[n\right]=A\bigsqcup B,$$

one has

$${\mathrm{dist}}_H(S,\overline{S})={\mathrm{dist}}_H(S\cap A,\overline{S}\cap A)+{\mathrm{dist}}_H(S\cap B,\overline{S}\cap B).$$

Moreover, both summands are strictly positive whenever $A\ne ⌀$ and $B\ne ⌀$.

Proof. 

Since $S▵\overline{S}=\left[n\right]$, every coordinate belongs to the symmetric difference. Thus, for every $i\in \left[n\right]$,

$$i\in S▵\overline{S}.$$

Applying Lemma 3, we obtain

$${\mathrm{dist}}_H\left({\pi }_i\left(S\right),{\pi }_i\left(\overline{S}\right)\right)={\mathrm{dist}}_H(S,\overline{S})-1=n-1,$$

which proves (i).

For (ii), assume that $T\subseteq \left[n\right]$ satisfies ${\mathrm{dist}}_H(S,T)=n$. Then

$$|S▵T|=n.$$

But $S▵T\subseteq \left[n\right]$, and the ambient set $\left[n\right]$ itself has cardinality n. Therefore $S▵T=\left[n\right]$, which is equivalent to

$$T=\left[n\right]\setminus S=\overline{S}.$$

This proves uniqueness of the antipode at maximal distance.

Finally, let $\left[n\right]=A\bigsqcup B$ be a partition. Since A and B are disjoint and cover $\left[n\right]$, the symmetric difference decomposes as the disjoint union

$$S▵\overline{S}=\left((S\cap A)▵(\overline{S}\cap A)\right)\bigsqcup \left((S\cap B)▵(\overline{S}\cap B)\right).$$

Taking cardinalities yields

$${\mathrm{dist}}_H(S,\overline{S})={\mathrm{dist}}_H(S\cap A,\overline{S}\cap A)+{\mathrm{dist}}_H(S\cap B,\overline{S}\cap B).$$

It remains to prove the strict positivity of the two summands under the stated nonemptiness assumptions. If $A\ne ⌀$, then

$$\overline{S}\cap A=A\setminus S,$$

and therefore

$$(S\cap A)▵(\overline{S}\cap A)=A.$$

Consequently,

$${\mathrm{dist}}_H(S\cap A,\overline{S}\cap A)=\left|A\right|>0.$$

The same argument with B in place of A gives

$${\mathrm{dist}}_H(S\cap B,\overline{S}\cap B)=\left|B\right|>0$$

whenever $B\ne ⌀$. This proves (iii). □

Remark 14  

(GHZ-type interpretation). The preceding theorem shows that antipodal pairs are the unique maximally separated pairs in the Boolean geometry, and that every coordinate deletion lowers their Hamming distance by exactly one. At a purely combinatorial level, this behavior mirrors the fragility usually associated with GHZ-type correlations under subsystem loss. We emphasize, however, that the present result is entirely discrete and combinatorial: the GHZ terminology is used only as a structural analogy.

10.4. Robust Low-Degree Layers Under Projection

At the opposite end of the Boolean lattice, low-degree layers behave in a markedly different way under coordinate deletion. The simplest case is the degree-one layer

$${\Gamma }_0^{\left(1\right)}=\left\{\left\{1\right\},\dots ,\left\{n\right\}\right\}.$$

Unlike antipodal pairs, which lose one unit of distance under every projection, this layer retains a nontrivial part of its structure after removing any single coordinate.

For convenience, when working on $\mathcal{P}\left(\right[m\left]\right)$ we denote by

$${\Gamma }_0^{\left(1\right)}\left(m\right):=\{S\subseteq \left[m\right]\mid |S|=1\}$$

its degree-one layer.

To compare the image of ${\pi }_i$ with a layer inside $\mathcal{P}\left(\right[n-1\left]\right)$, we use the canonical order-preserving bijection

$${\rho }_i:\left[n\right]\setminus \left\{i\right\}⟶[n-1],{\rho }_i\left(j\right)=\left\{\begin{array}{cc}j,\hfill & j<i,\hfill \\ j-1,\hfill & j>i.\hfill \end{array}\right.$$

(14)

This induces a bijection on power sets

$${\rho }_i^{*}:\mathcal{P}(\left[n\right]\setminus \left\{i\right\})⟶\mathcal{P}\left([n-1]\right),{\rho }_i^{*}\left(U\right):=\{{\rho }_i\left(u\right)\mid u\in U\}.$$

Proposition 15  

(Robustness of the degree-one layer). For every $i\in \left[n\right]$,

$${\rho }_i^{*}\left({\pi }_i\left({\Gamma }_0^{\left(1\right)}\right)\right)={\Gamma }_0^{\left(1\right)}(n-1)\cup \{⌀\}.$$

In particular, removing any coordinate does not collapse the entire degree-one layer to a single vertex.

Proof. 

Fix $i\in \left[n\right]$. For each $j\in \left[n\right]$, one has

$${\pi }_i\left(\left\{j\right\}\right)=\left\{\begin{array}{cc}⌀,\hfill & j=i,\hfill \\ \left\{j\right\},\hfill & j\ne i.\hfill \end{array}\right.$$

Therefore

$${\pi }_i\left({\Gamma }_0^{\left(1\right)}\right)=\{⌀\}\cup \left\{\left\{j\right\}\mid j\in \left[n\right],j\ne i\right\}.$$

Applying ${\rho }_i^{*}$, we obtain

$${\rho }_i^{*}\left({\pi }_i\left({\Gamma }_0^{\left(1\right)}\right)\right)=\{⌀\}\cup \left\{\left\{{\rho }_i\left(j\right)\right\}\mid j\in \left[n\right],j\ne i\right\}.$$

Since ${\rho }_i:\left[n\right]\setminus \left\{i\right\}\to [n-1]$ is a bijection, the family of singletons $\left\{{\rho }_i\left(j\right)\right\}$ obtained in this way is exactly the family of all singleton subsets of $[n-1]$. Hence

$${\rho }_i^{*}\left({\pi }_i\left({\Gamma }_0^{\left(1\right)}\right)\right)={\Gamma }_0^{\left(1\right)}(n-1)\cup \{⌀\},$$

which proves the claim. □

Remark 15 

(W-type interpretation). In contrast with antipodal pairs, the degree-one layer survives coordinate deletion in a nontrivial way: only one vertex collapses to ⌀, while the remaining singletons persist after the canonical order-preserving identification ${\rho }_i^{*}$. This provides a combinatorial analogue of the robustness commonly associated with W-type configurations. As above, the terminology is interpretative rather than physical.

The preceding contrast between antipodal pairs and low-degree layers captures a qualitative dichotomy in the Boolean geometry transported to ${\Gamma }_0\left(n\right)$: global extremal structures are fragile under coordinate loss, whereas low-degree strata retain a visible remnant after projection. This complements the entropy analysis of Section 9, where the dominant contribution arises from the intermediate Hamming layers rather than from extremal vertices.

10.5. Valency Growth Along Maximal Directed Paths

A further transported consequence of the Boolean model is that valency increases monotonically along every maximal directed path in the Hasse diagram. This is immediate from the formula $val\left(S\right)=1+\left|S\right|$, but it is useful to record it explicitly because it links the support-quiver orientation with the local support-controlled data.

Corollary 6  

(Valency growth along maximal directed paths). Let

$$S_0\to S_1\to ···\to S_n$$

be any maximal directed path in the Hasse diagram from $S_0=⌀$ to $S_n=\left[n\right]$. Then

$$val\left(S_0\right)<val\left(S_1\right)<···<val\left(S_n\right),$$

and in fact

$$val\left(S_k\right)=1+k\mathit{for}\mathit{all}k=0,\dots ,n.$$

Proof. 

Along each directed edge of the Hasse diagram, one passes from a set $S_k$ to a set $S_{k+1}=S_k\cup \left\{i\right\}$ for some $i\notin S_k$. Therefore

$$|S_{k+1}|=|S_k|+1.$$

Since $S_0=⌀$, an immediate induction gives

$$|S_k|=k\mathrm{for}\mathrm{all}k=0,\dots ,n.$$

Using the valency formula

$$val\left(S\right)=1+\left|S\right|,$$

we obtain

$$val\left(S_k\right)=1+k\mathrm{for}\mathrm{all}k=0,\dots ,n.$$

The strict inequalities

$$val\left(S_0\right)<val\left(S_1\right)<···<val\left(S_n\right)$$

follow at once. □

11. Open Problems and Further Directions

The results established in this paper suggest several natural directions for further work. Some concern the internal structure of the Boolean support model and its relation to the standard Brauer configuration, while others point toward possible extensions beyond the Boolean setting.

Problem 1  

(Support quiver versus Brauer quiver). The present family naturally carries two different quivers: the Boolean support quiver $Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$, which is the oriented Hasse diagram of $\mathcal{P}\left(\right[n\left]\right)$, and the standard Brauer quiver $Q_{\mathrm{Br}}\left(n\right)$, which is induced by the cyclic orderings of the polygons. Can one describe a deeper structural relationship between these two quivers? For example, is there a functorial or representation-theoretic mechanism that explains how support-level geometry is reflected in the Brauer-quiver combinatorics?

Problem 2  

(Intrinsic characterization of extremal support paths). Maximal directed paths and antipodal geodesics arise naturally in the Boolean support quiver. Can these extremal support paths be characterized intrinsically in the support-defined family, without passing explicitly through the Boolean identification

$${\Gamma }_0\left(n\right)\cong \mathcal{P}\left(\left[n\right]\right)?$$

Equivalently, is there a purely support-theoretic criterion detecting those paths whose total weight is asymptotically negligible but whose geometric rigidity is maximal?

Problem 3  

(Brauer-theoretic projection operations). Is there a natural operation on standard Brauer configurations or on their associated algebras that plays the role of a coordinate projection? Such an operation should ideally reflect the dichotomy observed in Section 10: antipodal pairs should exhibit a rigid collapse phenomenon, while low-degree layers should remain partially visible after projection.

Problem 4  

(Beyond the Boolean lattice). To what extent does the present construction extend to families whose support geometry is governed by combinatorial structures other than the Boolean lattice? One may ask, for example, whether analogous support-controlled Brauer configurations can be built from graded posets, simplicial complexes, partition structures, or graph-theoretic data, and whether such families admit explicit formulas for global invariants and entropy-type quantities. Existing constructions arising from Dyck paths, integer partitions, and graph-based Brauer analyses suggest that this is a natural direction to pursue; see [23,24,26].

Problem 5  

(Entropy beyond the binomial regime). For the Boolean family $\Gamma \left(n\right)$, the layer distribution is asymptotically governed by a binomial law, while the vertex entropy decomposes into a layer contribution and an internal layer contribution. Is there a broader class of Brauer configurations for which analogous entropic decompositions are controlled by other probabilistic limit laws, such as Poisson, multinomial, or Gaussian-type regimes arising from different combinatorial geometries?

Problem 6  

(Representation-theoretic meaning of middle-layer dominance). The entropy analysis shows that the dominant weight lies asymptotically in the middle Hamming layers. Is there a representation-theoretic or homological interpretation of this phenomenon inside the Brauer configuration algebras ${\Lambda }_{\Gamma \left(n\right)}$? In particular, can the middle layers be detected through module-theoretic, homological, or categorical invariants attached to the algebra?

Remark 16.  

From a broader perspective, the Boolean family developed here suggests that explicit Brauer configuration algebras may serve as a meeting point between combinatorial representation theory, discrete geometry, and entropy-type asymptotics. The existence of other Brauer families arising from recursive, graph-theoretic, and partition-based combinatorics supports the expectation that the present Boolean model is part of a wider phenomenon; see [23,24,25,26]. Exploring this bridge beyond the present setting remains an open and potentially fruitful direction.

Main Notation

For the reader’s convenience, we summarize here the principal notation used throughout the paper.

Notation	Meaning
$\left[n\right]:=\{1,\dots ,n\}$	The standard finite index set.
$\mathcal{P}\left(\right[n\left]\right)$	The Boolean lattice, that is, the power set of $\left[n\right]$.
${\mathrm{G}}_{\mathrm{RASS}}\left(n\right)$	The Boolean support family associated with the Grassmann-inspired support construction in dimension n.
$\Gamma \left(n\right)=({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right))$	The support-defined family consisting of the vertex set and polygon family.
${\Gamma }^{\mathrm{std}}\left(n\right)$	The standard Brauer configuration ${\Gamma }^{\mathrm{std}}\left(n\right)=\left({\Gamma }_0\left(n\right),{\Gamma }_1\left(n\right),\mu ,{\mathfrak{o}}_n\right).$
${\Gamma }_0\left(n\right)$	The vertex set of the family.
${\Gamma }_1\left(n\right)=\{S_1,S_{x_1},\dots ,S_{x_n}\}$	The polygon family of the construction.
${\mathcal{V}}_3$	The fixed base family of monomial labels used to generate ${\Gamma }_0\left(n\right)$ for all $n\ge 3$.
$I_n=\{4,\dots ,n\}$	The set of indices corresponding to the variables adjoined to the base layer.
$x_A={\prod }_{i\in A}{x}_i$	The monomial attached to a subset $A\subseteq I_n$, with $x_{⌀}=1$.
${Supp}_x\left(w\right)$	The x-support of a monomial label w, defined by ${Supp}_x\left(w\right):=\{i\in \left[n\right]\mid x_i\mathrm{divides}w\}.$
${deg}_x\left(w\right)$	The x-degree of a monomial label w, given by ${deg}_x\left(w\right):=\left|{Supp}_x\left(w\right)\right|.$
$\mu \left(w\right)$	The multiplicity of a vertex label w, defined by $\mu \left(w\right)=\left\{\begin{array}{cc}2,\hfill & {deg}_x\left(w\right)=0,\hfill \\ 1,\hfill & {deg}_x\left(w\right)\ge 1.\hfill \end{array}\right.$
$val\left(w\right)$	The valency of a vertex label w, defined by $val\left(w\right):=1+{deg}_x\left(w\right).$
${\Phi }_n:{\Gamma }_0\left(n\right)\to \mathcal{P}\left(\left[n\right]\right)$	The Boolean identification map, sending each vertex label to its x-support.
$Q\left({\mathrm{G}}_{\mathrm{RASS}}\right(n\left)\right)$	The Boolean support quiver, identified with the directed Hasse diagram of $\mathcal{P}\left(\right[n\left]\right)$.
$Q_{\mathrm{Br}}\left(n\right)$	The standard Brauer quiver attached to the Brauer configuration ${\Gamma }^{\mathrm{std}}\left(n\right)$.
${\mathfrak{o}}_n={\left\{{\mathfrak{o}}_w\right\}}_{w\in {\Gamma }_0\left(n\right)}$	The canonical orientation datum on ${\Gamma }^{\mathrm{std}}\left(n\right)$.
$L_n:{\Gamma }_0(n-1)\to {\Gamma }_0\left(n\right)$	The lift map $L_n\left(w\right)=w{x}_n$, adjoining the new variable $x_n$.
${\mathrm{dist}}_H(S,T)=|S▵T|$	The Hamming distance on the Boolean lattice.
${\pi }_i\left(S\right)=S\setminus \left\{i\right\}$	The coordinate projection deleting the i-th coordinate from a subset $S\subseteq \left[n\right]$.
${\rho }_i:\left[n\right]\setminus \left\{i\right\}\to [n-1]$	The canonical order-preserving bijection used to compare $\mathcal{P}\left(\right[n]\setminus \{i\left\}\right)$ with $\mathcal{P}\left(\right[n-1\left]\right)$.
$d_{\Gamma \left(n\right)}={\sum }_{\alpha \in {\Gamma }_0\left(n\right)}\mu \left(\alpha \right)val\left(\alpha \right)$	The normalization constant associated with the weighted vertex distribution.
$q_{\alpha }={\displaystyle \frac{\mu \left(\alpha \right)val\left(\alpha \right)}{d_{\Gamma \left(n\right)}}}$	The normalized weight assigned to a vertex $\alpha \in {\Gamma }_0\left(n\right)$.
$W_k$	The total weight of the k-th Hamming layer, given by $W_k:={\sum }_{\begin{array}{c}\alpha \in {\Gamma }_0\left(n\right)\\ {deg}_x\left(\alpha \right)=k\end{array}}\mu \left(\alpha \right)val\left(\alpha \right).$
$p_k={\displaystyle \frac{W_k}{d_{\Gamma \left(n\right)}}}$	The normalized probability assigned to the k-th Hamming layer.
$H_{\mathrm{vert}}(\Gamma \left(n\right))$	The vertex entropy of the weighted distribution on ${\Gamma }_0\left(n\right)$.
$H_{\mathrm{layer}}(\Gamma \left(n\right))$	The entropy of the induced probability distribution on Hamming layers.
${\Lambda }_{\Gamma \left(n\right)}$	The Brauer configuration algebra associated with ${\Gamma }^{\mathrm{std}}\left(n\right)$.