相关论文: Relating Doubly-Even Error-Correcting Codes, Graph…
In this paper we discuss off-shell representations of N-extended supersymmetry in one dimension, ie, N-extended supersymmetric quantum mechanics, and following earlier work on the subject codify them in terms of certain graphs, called…
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…
Adinkras are a graphical depiction of representations of the N-extended supersymmetry algebra in one dimension, on the worldline. These diagrams represent the component fields in a supermultiplet as vertices, and the action of the…
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…
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…
An Adinkra is a graph from the study of supersymmetry in particle physics, but it can be adapted to study Clifford algebra representations. The graph in this context is called a Cliffordinkra, and puts some standard ideas in Clifford…
Adinkras are combinatorial objects developed to study 1-dimensional supersymmetry representations. Recently, 2-d Adinkras have been developed to study 2-dimensional supersymmetry. In this paper, we classify all 2-d Adinkras, confirming a…
The linear finite irreducible representations of the algebra of the 1D $N$-Extended Supersymmetric Quantum Mechanics are discussed in terms of their "connectivity" (a symbol encoding information on the graphs associated to the irreps). The…
The off-shell representation theory of 4D, $\mathcal{N}=1$ supermultiplets can be categorized in terms of distinct irreducible graphical representations called adinkras as part of a larger effort we call supersymmetry `genomics.' Recent…
Adinkras are a graphical tool for studying off-shell representations of supersymmetry. In this paper we efficiently classify the automorphism groups of Adinkras relative to a set of local parameters. Using this, we classify Adinkras…
Binary classification problems can be naturally modeled as bipartite graphs, where we attempt to classify right nodes based on their left adjacencies. We consider the case of labeled bipartite graphs in which some labels and edges are not…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
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 {\em…
We study the elliptic genera of hyperKahler manifolds using the representation theory of N=4 superconformal algebra. We consider the decomposition of the elliptic genera in terms of N=4 irreducible characters, and derive the rate of…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
It is well known that every closure system can be represented by an implicational base, or by the set of its meet-irreducible elements. In Horn logic, these are respectively known as the Horn expressions and the characteristic models. In…
Graph super-resolution, the task of inferring high-resolution (HR) graphs from low-resolution (LR) counterparts, is an underexplored yet crucial research direction that circumvents the need for costly data acquisition. This makes it…
Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…
The purpose of this paper is to investigate the global categorical symmetries that arise when gauging finite higher groups in three or more dimensions. The motivation is to provide a common perspective on constructions of non-invertible…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…