Related papers: A Combinatorial Algorithm for Computing Higher Ord…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
We propose a novel Hybrid High-Order method for the Cahn-Hilliard problem with convection. The proposed method is valid in two and three space dimensions, and it supports arbitrary approximation orders on general meshes containing…
High-order clustering aims to identify heterogeneous substructures in multiway datasets that arise commonly in neuroimaging, genomics, social network studies, etc. The non-convex and discontinuous nature of this problem pose significant…
Higher-order networks effectively represent complex systems with group interactions. Existing methods usually overlook the relative contribution of group interactions (hyperlinks) of different sizes to the overall network structure. Yet,…
By elaborating on the recent progress made in the area of Feynman integrals, we apply the intersection theory for twisted de Rham cohomologies to simple integrals involving orthogonal polynomials, matrix elements of operators in Quantum…
In this brief, we discuss the implementation of a third order semi-implicit differentiator as a complement of the recent work by the author that proposes an interconnected semi-implicit Euler double differentiators algorithm through Taylor…
Machine Learning approaches like clustering methods deal with massive datasets that present an increasing challenge. We devise parallel algorithms to compute the Multi-Slice Clustering (MSC) for 3rd-order tensors. The MSC method is based on…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
In this review article, we report on some recent advances on the computational aspects of cohomology intersection numbers of GKZ systems developed in \cite{GM}, \cite{MH}, \cite{MT} and \cite{MT2}. We also discuss the relation between…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
Hypergraphs, increasingly utilised to model complex and diverse relationships in modern networks, have gained significant attention for representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery…
We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order…
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length $tk$ and dimension $k$ is called a complementary information set code of order $t$ ($t$-CIS code for short) if it has $t$ pairwise…
We study configuration space integral formulas for Milnor's homotopy link invariants, showing that they are in correspondence with certain linear combinations of trivalent trees. Our proof is essentially a combinatorial analysis of a…
We demonstrate that summation of connected diagrams to high order starting from a BCS hamiltonian is a viable generic unbiased approach for strongly correlated fermions in superconducting or superfluid phases. For the 3D attractive Hubbard…
In the first part of this paper we develop some theorems in linear algebra applicable to information theory when all random variables involved are linear functions of the individual bits of a source of independent bits. We say that a…
This paper computes Whitney tower filtrations of classical links. Whitney towers consist of iterated stages of Whitney disks and allow a tree-valued intersection theory, showing that the associated graded quotients of the filtration are…