Related papers: Introducing Cadabra: a symbolic computer algebra s…
We present a general representation for solving problems in many-body perturbation theory. By projecting the single-particle Green's function to an auxiliary space we show how one can convert an arbitrary Feynman graph to a universal kernel…
We survey the combinatorics of the Adinkra, a graphical device for solving differential equations in supersymmetry. These graphs represent an exceptional class of 1-factorizations with further augmentations. As a new feature, we…
We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an…
We present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…
We present ABRA, a suite of algorithms that compute and maintain probabilistically-guaranteed, high-quality, approximations of the betweenness centrality of all nodes (or edges) on both static and fully dynamic graphs. Our algorithms rely…
Due to the occurrence of large exceptional Lie groups in supergravity, calculations involving explicit Lie algebra and Lie group element manipulations easily become very complicated and hence also error-prone if done by hand. Research on…
In this paper we consider the Kaluza-Klein fields equations in presence of a generic 5D matter tensor which is governed by a conservation equation due to 5D Bianchi identities. Following a previous work, we provide a consistent approach to…
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In…
We describe the GPU implementation of shifted or multimass iterative solvers for sparse linear systems of the sort encountered in lattice gauge theory. We provide a generic tool that can be used by those without GPU programming experience…
Matrix approximations are a key element in large-scale algebraic machine learning approaches. The recently proposed method MEKA (Si et al., 2014) effectively employs two common assumptions in Hilbert spaces: the low-rank property of an…
We outline a program in the area of formalization of mathematics to automate theorem proving in algebra and algebraic geometry. We propose a construction of a dictionary between automated theorem provers and (La)TeX exploiting syntactic…
We describe an algebra for composing automata which includes both classical and quantum entities and their communications. We illustrate by describing in detail a quantum protocol.
We introduce FlagAlgebraToolbox, an extension of SageMath capable of automating flag algebra calculations and optimizations. FlagAlgebraToolbox has a simple interface, can handle a wide range of combinatorial theories, can numerically…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
Quantum field planes furnish a noncommutative differential algebra $\Omega$ which substitutes for the commutative algebra of functions and forms on a contractible manifold. The data required in their construction come from a quantum field…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
We present a novel matrix-parametrized frugal splitting algorithm which finds the zero of a sum of maximal monotone and cocoercive operators composed with linear selection operators. We also develop a semidefinite programming framework for…
The neutrino field is considered in the framework of a complex Clifford algebra $\C_3\cong\C_2\oplus\stackrel{\ast}{\C}_2$. The factor-algebras ${}^{\epsilon}\C_2$ and ${}^{\epsilon}\stackrel{\ast}{\C}_2$, which are obtained by means of…
We present Cobra, a modern proof presentation framework, leveraging cutting-edge presentation technology together with a state of the art interactive theorem prover to present formalized mathematics as active documents. Cobra provides both…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…