Related papers: A combinatorial introduction to Adinkras
A new class of simple symmetric digraphs called $\mathcal{D}$ is defined and studied here. Any digraph in $\mathcal{D}$ has the property that each non-pendant vertex is adjacent to at least one pendant vertex. A graph theoretical…
A graphical representation of supersymmetry is presented. It clearly expresses the chiral flow appearing in SUSY quantities, by representing spinors by {\it directed lines} (arrows). The chiral suffixes are expressed by the directions (up,…
Given an Artinian algebra $A$ over a field $k$, there are several combinatorial objects associated to $A$. They are the diagram $D_A$ as defined in [DK], the natural quiver $\Delta_A$ defined in \cite{Li} (cf. Section 2), and a generalized…
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…
We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized by a real number. For well-chosen values of the parameter,…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
We show that differential calculus (in its usual form, or in the general form of topological differential calculus) can be fully imdedded into a functor category (functors from a small category of anchord tangent algebras to anchored sets).…
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with…
An extension of the Dirac procedure for the quantization of constrained systems is necessary to address certain issues that are left open in Dirac's original proposal. These issues play an important role especially in the context of…
We analyse the behaviour of the Dirac equation in $d=1+1$ with Lorentz scalar potential. As the system is known to provide a physical realization of supersymmetric quantum mechanics, we take advantage of the factorization method in order to…
Obtaining meaningful solutions for inverse problems has been a major challenge with many applications in science and engineering. Recent machine learning techniques based on proximal and diffusion-based methods have shown promising results.…
Lagrangian Descriptors (LDs) are scalar quantities able to reveal separatrices, manifolds of hyperbolic saddles, and chaotic seas of dynamical systems. A popular version of the LDs consists in computing the arc-length of trajectories over a…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric…
Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…
In this paper, we devote to extending structures for dendriform algebras. First, we define extending datums and unified products of dendriform algebras, and theoretically solve the extending structure problem. As an application, we consider…
A characteristic feature of differential-algebraic equations is that one needs to find derivatives of some of their equations with respect to time, as part of so called index reduction or regularisation, to prepare them for numerical…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
Concept lattice drawings are an important tool to visualize complex relations in data in a simple manner to human readers. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although those methods are…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight…