Related papers: Enumerating the Saneblidze-Umble diagonal terms
We provide a systematic enumerative and combinatorial study of geometric cellular diagonals on the permutahedra. In the first part of the paper, we study the combinatorics of certain hyperplane arrangements obtained as the union of $\ell$…
The complement of an arrangement of diagonal subspaces $x_{i_1} = \cdots = x_{i_k}$ in the real space is defined by a simplicial complex $K$. In this paper, we prove that the complement of a diagonal subspace arrangement is homotopy…
Extending work of Saneblidze-Umble and others, we use diagonals for the associahedron and multiplihedron to define tensor products of A-infinity algebras, modules, algebra homomorphisms, and module morphisms, as well as to define a bimodule…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
Algorithms are described and Maple implementations are provided for finding all quandles of order $n$, as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a…
We develop formulas that define permutahedral commutation coherence relations of all orders. To illustrate the result geometrically, we begin by defining a rigid transformation of the $(n+1)$-permutahedron into a $n$-cube of dimensions $1…
Dual numbers and their higher order version are important tools for numerical computations, and in particular for finite difference calculus. Based upon the relevant algebraic rules and matrix realizations of dual numbers, we will present a…
This paper investigates enumerative aspects of permutohedral blades, which provide a generalization of the notion of the tropical hyperplane arrangement. Blade provide the combinatorial underpinning of generalized biadjoint scalar…
We construct an explicit diagonal \Delta_P on the permutahedra P. Related diagonals on the multiplihedra J and the associahedra K are induced by Tonks' projection P --> K and its factorization through J. We introduce the notion of a…
In this paper, we give an explicit computable algorithm for the Zelevinsky-Aubert dual of irreducible representations of $p$-adic symplectic and odd special orthogonal groups. To do this, we establish explicit formulas for certain…
We present an application of the program of groupoidification leading up to a sketch of a categorification of the Hecke algebroid --- the category of permutation representations of a finite group. As an immediate consequence, we obtain a…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
The strengthening of linear relaxations and bounds of mixed integer linear programs has been an active research topic for decades. Enumeration-based methods for integer programming like linear programming-based branch-and-bound exploit…
In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…
We study Smarandache sequences of numbers, and related problems, via a Computer Algebra System. Solutions are discovered, and some conjectures presented.
The development of new superconducting circuits and the improvement of existing ones rely on the accurate modeling of spectral properties which are key to achieving the needed advances in qubit performance. Systematic circuit analysis at…
We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…
We unravel the algebraic structure which controls the various ways of computing the word ((xy)(zt)) and its siblings. We show that it gives rise to a new type of operads, that we call permutads. It turns out that this notion is equivalent…
Recently, the entanglement dynamics of two harmonic oscillators initially prepared in a separable-coherent state was demonstrated to offer a pathway for prime number identification. This article presents a generalized approach and outlines…
The discovery of pure spinor formalism makes the computation of superstring scattering amplitudes possible. In this paper, we will illustrate how computer algebra system Cadabra is used in computing the supersymmetric amplitude in pure…