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 P(n). This identification yields a Boolean support quiver isomorphic to the directed Hasse diagram of P(n), 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.
Cañadas et al. (Sun,) studied this question.