Related papers: A combinatorial introduction to Adinkras
Results are given from a search to form adinkra-like equations based on topologies that are not hypercubes. An alternate class of zonohedra topologies are used to construct adinkra-like graphs. In particular, the rhombic dodecahedron and…
We pose a new algebraic formalism for studying differential calculus in vector bundles. This is achieved by studying various functors of differential calculus over arbitrary graded commutative algebras (DCGCA) and applying this language to…
We present a new solution to the classification problem for the category of representations of a quiver of type $\widetilde{A}_{3}$. Our approach uses linear algebra techniques which lead us to a reduction that allows to use induction. As…
In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problems, reformulate as finding basis for the kernel of special…
We present an adinkra-based computer algorithm implemented in a Mathematica code and use it in a limited demonstration of how to engineer off-shell, arbitrary N-extended world-sheet supermultiplets. Using one of the outputs from this…
We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods. However, when the dimension of the problem gets large, interior point methods become impractical in terms of both computational time and memory…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
In this text I present some problems which led to the introduction of special kinds of graphs as tools for studying singular points of algebraic surfaces. I explain how such graphs were first described using words, and how several…
We introduce a graph attached to mutually orthogonal Sudoku Latin squares. The spectra of the graphs obtained from finite fields are explicitly determined. As a corollary, we then use the eigenvalues to distinguish non-isomorphic Sudoku…
The recent classification scheme of so-called adinkraic off-shell supermultiplets of N-extended worldline supersymmetry without central charges finds a combinatorial explosion. Completing our earlier efforts, we now complete the…
Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and…
"GRAMA" is a Mathematica package for doing symbolic tensor computations and complicated algebraic manipulations in 10-dimensional (D=10) simple (N=1) supergravity. The main new ingredients of this package inside the general Mathematica…
In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
State-of-the-art solvers for symmetry detection in combinatorial objects are becoming increasingly sophisticated software libraries. Most of the solvers were initially designed with inputs from combinatorics in mind (nauty, bliss, Traces,…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
We discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the…