Related papers: Codes and Supersymmetry in One Dimension
In this paper, we study arbitrary (not necessarily associative) 3-dimensional algebras. Such an algebra A is determined by a basis and the corresponding multiplication table, which is specified by 27 structure constants. We describe all…
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
We provide a clarification of the classification of two-dimensional algebras over an arbitrary base field. Using this clarification, we determine the number of non-isomorphic two-dimensional algebras over a finite field.
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…
We develop a new approach to deal with qubit information systems using toric geometry and its relation to Adinkra graph theory. More precisely, we link three different subjects namely toric geometry, Adinkras and quantum information theory.…
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…
We consider supersymmetry algebras in arbitrary spacetime dimension and signature. Minimal and maximal superalgebras are given for single and extended supersymmetry. It is seen that the supersymmetric extensions are uniquely determined by…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
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 give examples of endomorphisms in dimension one with infinite topological entropy which are $\alpha$-H\"older and $(1,p)$-Sobolev for all $0\leq\alpha<1$ and $1\leq p<\infty$. This is constructed within a family of endomorphisms with…
We construct super AdS black holes in 2+1 dimensions in terms of Chern Simons gauge theory of N=(1,1) super AdS group coupled to a (super)source. We take the source to be a super AdS state specified by its Casimir invariants. We show that…
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
In this paper, we show that the maximum number of points in $d\geq3$ dimensions determining exactly 2 distinct triangles is $2d$. We further show that this maximum is uniquely achieved by the vertices of the $d$-orthoplex. We build upon the…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
We present Adynkra Libraries that can be used to explore the embedding of multiplets of component field (whether on-shell or partial on-shell) within Salam-Strathdee superfields for theories in dimension nine through four.
Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Following Finkelstein and Misner, kinks are non-trivial field configurations of a field theory, and different kink-numbers correspond to different disconnected components of the space of allowed field configurations for a given topology of…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…