Related papers: Enumerating the Saneblidze-Umble diagonal terms
The purpose of this paper is to study the problem of computing unitary eigenvalues (U-eigenvalues) of non-symmetric complex tensors. By means of symmetric embedding of complex tensors, the relationship between U-eigenpairs of a…
We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.
In this work, we present an algorithm for the diagonalization of the Integration-by-Parts (IBP) equations. Diagonalized IBP equations are indispensable for reducing loop integrals with high numerator powers to master integrals and for…
This paper reports on recent work to compute the asymptotic solution of a n-th order ordinary differential equation. Symbolic methods are used to compute the asymptotics over a large region. Application is made to the computation of the…
The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…
This survey provides a practical and algorithmic perspective on Drinfeld modules over $\mathbb F_q[T]$. Starting with the construction of the Carlitz module, we present Drinfeld modules in any rank and some of their arithmetic properties.…
Basic elements of integral calculus over algebras of iterated differential forms, are presented. In particular, defining complexes for modules of integral forms are described and the corresponding berezinians and complexes of integral forms…
In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…
In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…
We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…
This article proves a Pythagoras-type formula for the sides and diagonals of a polygon inscribed in a semicircle having one of the sides of the polygon as diameter.
We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…
We introduce a metric on the set of permutations of given order, which is a weighted generalization of Kendall's $\tau$ rank distance and study its properties. Using the edge graph of a permutohedron, we give a criterion which guarantees…
We propose a new symbolic algorithm and a C++ program for generating and calculating supersymmetric Feynman diagrams for ${\cal N}=1$ supersymmetric electrodynamics regularized by higher derivatives in four dimensions. According to standard…
We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies ($I_{2^{n-1}}\otimes \text{DFT}_2$) interleaved by linear permutations. Linear permutations are those…
Boja\'nczyk recently initiated an intensive study of deterministic pebble transducers, which are two-way automata that can drop marks (named "pebbles") on their input word, and produce an output word. They describe functions from words to…
The Unified Transform provides a novel method for analyzing boundary value problems for linear and for integrable nonlinear PDEs. The numerical implementation of this method to linear elliptic PDEs formulated in the {\it interior} of a…
We consider the recently developed diagrammatic approach to soft-gluon exponentiation in multiparton scattering amplitudes, where the exponent is written as a sum of webs - closed sets of diagrams whose colour and kinematic parts are…
This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry group. The procedure is based on basic notions of representation theory of finite groups. As…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…