Related papers: A Combinatorial Algorithm for Computing Higher Ord…
Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
Building on recent advances in studying the co-homological properties of Feynman integrals, we apply intersection theory to the computation of Fourier integrals. We discuss applications pertinent to gravitational bremsstrahlung and deep…
In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the $d^\text{th}$ order cumulant can be presented in the form of an $d$-dimensional tensor, the algorithm is presented…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
The numerical Hilbert series combinatorics and the comodule Hilbert series combinatorics are introduced, and some applications are presented, including the MacMahon Master Theorem.
In \cite{PrzytyskiTraczyk} J.H.Przytyski and P.Traczyk introduced an algebraic structure, called {\it a Conway algebra,} and constructed an invariant of oriented links, which is a generalization of the Homflypt polynomial invariant. On the…
We describe a new approach to triple linking invariants and integrals, aiming for a simpler, wider and more natural applicability to the search for higher order helicities of fluid flows and magnetic fields. To each three-component link in…
We show how to measure the failure of the Whitney trick in dimension 4 by constructing higher- order intersection invariants of Whitney towers built from iterated Whitney disks on immersed surfaces in 4-manifolds. For Whitney towers on…
We describe the homology intersection form associated to regular holonomic GKZ systems in terms of the combinatorics of regular triangulations. Combining this result with the twisted period relation, we obtain a formula of cohomology…
We compute all third-order local invariants accessible via randomised measurements and employ them to derive separability criteria. The reconstruction of the invariants yields experimentally accessible entanglement criteria for multipartite…
We introduce a new method for computing triply graded link homology, which is particularly well-adapted to torus links. Our main application is to the (n,n)-torus links, for which we give an exact answer for all n. In several cases, our…
In his 1957 paper, John Milnor introduced link invariants which measure the homotopy class of the longitudes of a link relative to the lower central series of the link group. Consequently, these invariants determine the lower central series…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
We use Feynman diagrams to prove a formula for the Jones polynomial of a link derived recently by N.~Reshetikhin. This formula presents the colored Jones polynomial as an integral over the coadjoint orbits corresponding to the…
Polynomial regression is widely used and can help to express nonlinear patterns. However, considering very high polynomial orders may lead to overfitting and poor extrapolation ability for unseen data. The paper presents a method for…
The problem of inferring pair-wise and higher-order interactions in complex systems involving large numbers of interacting variables, from observational data, is fundamental to many fields. Known to the statistical physics community as the…
In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. The methods are fast and efficient for real-time ranking and…
This work proposes a higher-order iterative framework for solving matrix equations, inspired by the structure and functionality of neural networks. A modification of the classical Jacobi iterative method is introduced to compute…
In order to generalize the integration rules to general CHY integrands which include higher order poles, algorithms are proposed in two directions. One is to conjecture new rules, and the other is to use the cross-ratio identity method. In…