Related papers: Enumerative Gadget Phenomena for $(4,1)$-Adinkras
We demonstrate a method for describing one-dimensional N-extended supermultiplets and building supersymmetric actions in terms of unconstrained prepotential superfields, explicitly working with the Scalar supermultiplet. The method uses…
We continue the development of a theory of off-shell supersymmetric representations analogous to that of compact Lie algebras such as SU(3). For off-shell 4D, N = 1 systems, quark-like representations have been identified [1] in terms of…
Adinkras are diagrams that describe many useful supermultiplets in D=1 dimensions. We show that the topology of the Adinkra is uniquely determined by a doubly even code. Conversely, every doubly even code produces a possible topology of an…
An Adinkra is a class of graphs with certain signs marking its vertices and edges, which encodes off-shell representations of the super Poincar\'e algebra. The markings on the vertices and edges of an Adinkra are cochains for cubical…
Recently, all 1,358,954,496 values of the gadget between the 36,864 adinkras with four colors, four bosons, and four fermions have been computed. In this paper, we further analyze these results in terms of $BC_3$, the signed permutation…
Adinkras are graphs that can describe off-shell supermultiplets in 1 dimension with a Lie superalgebra known as Garden algebra. In this paper, I show that the degrees of freedom of the adinkra can be represented by a subgraph called a…
Adinkra networks arise in the Carroll limit of supersymmetric QFT. Extensions of adinkras that are infinite dimensional graphs have never previously been discussed in the literature. We call these "infinite unfolded'' adinkras and study the…
"Pure" homogeneous linear supermultiplets (minimal and non-minimal) of the N=4-Extended one-dimensional Supersymmetry Algebra are classified. "Pure" means that they admit at least one graphical presentation (the corresponding graph/graphs…
We explain how the redefinitions of supermultiplet component fields, comprising what we call "frame shifts", can be used in conjuction with the graphical technology of multiplet Adkinras to render manifest the reducibility of off-shell…
We present further progress toward a complete classification scheme for describing supermultiplets of N-extended worldline supersymmetry, which relies on graph-theoretic topological invariants. In particular, we demonstrate a relationship…
Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…
The symmetry of the whole experimental setups, including specific sample environments and measurables, can be compared with that of specimens for observable physical phenomena. We, first, focus on one-dimensional (1D) experimental setups,…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
We discuss a 1+2 dimensional model with unconventional supersymmetry at the boundary of an AdS${}_4$, \,$\mathcal{N}$-extended supergravity. The resulting features of the supersymmetric boundary open the possibility of describing the…
We propose a new interpretation of measures of information and disorder by connecting these concepts to group theory in a new way. Entropy and group theory are connected here by their common relation to sets of permutations. A combinatorial…
We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…
The problem of classifying off-shell representations of the $N$ -extended one-dimensional super Poincar\'e algebra is closely related to the study of a class of decorated $N$-regular, $N$-edge colored bipartite graphs known as Adinkras. In…
Adinkras are highly structured graphs developed to study 1-dimensional supersymmetry algebras. A cyclic ordering of the edge colors of an Adinkra, or rainbow, determines a Riemann surface and a height function on the vertices of the Adinkra…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…