Related papers: An algorithm to calculate generalized Seifert matr…
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The…
The confluent second-order supersymmetric quantum mechanics, for which the factorization energies tend to a single value, is studied. We show that the Wronskian formula remains valid if generalized eigenfunctions are taken as seed…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
This article presents a survey of work on lifted graphical models. We review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We…
In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen…
We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…
We propose a contour integral-based algorithm for computing a few singular values of a matrix or a few generalized singular values of a matrix pair. Mathematically, the generalized singular values of a matrix pair are the eigenvalues of an…
The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of…
We develop a diagrammatic formalism for calculating the Alexander polynomial of the closure of a braid as a state-sum. Our main tools are the Markov trace formulas for the HOMFLY-PT polynomial and Young's semi-normal representations of the…
The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations…
We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
A (smooth) embedding of a closed curve on the plane with finitely many intersections is said to be generic if each point of self-intersection is crossed exactly twice and at non-tangent angles. A finite word $\omega$ where each character…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
We consider dataflow architecture for two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We improve the earlier technique of almost continuous program…
We present an algorithm which, given a connected smooth projective curve $X$ over an algebraically closed field of characteristic $p>0$ and its Hasse--Witt matrix, as well as a positive integer $n$, computes all \'etale Galois covers of $X$…
A numerical program is presented which facilitates a computation pertaining to the full set of one-gluon loop diagrams (including ghost loop contributions), with M attached external gluon lines in all possible ways. The feasibility of such…
A key goal in the design of probabilistic inference algorithms is identifying and exploiting properties of the distribution that make inference tractable. Lifted inference algorithms identify symmetry as a property that enables efficient…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…