Related papers: Intersection Numbers from Companion Tensor Algebra
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
Intersection numbers of Stokes polytopes living in complex projective space are computed using the techniques employed to find the inverse string KLT matrix elements in terms of intersection numbers of associahedra. To do this requires an…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
Iterative Fast Fourier Transform methods are useful for calculating the fields in composite materials and their macroscopic response. By iterating back and forth until convergence, the differential constraints are satisfied in Fourier…
In the previous paper [arXiv:2210.10435], the nonlinear perturbation theory of cosmological density field is generalized to include the tensor-valued bias of astronomical objects, such as spins and shapes of galaxies and any other tensors…
We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a rich family of…
The intersection numbers of p-spin curves are computed through correlation functions of Gaussian ensembles of random matrices in an external matrix source. The p-dependence of intersection numbers is determined as polynomial in p; the large…
In frameworks of the phenomenological approach we analyze of the phase diagram of mixed compounds. We obtain space groups of symmetry of the real structures as result of phase transition from close-packed degenerate structure. The theory of…
Tensor decomposition serves as a powerful primitive in statistics and machine learning, and has numerous applications in problems such as learning latent variable models or mixture of Gaussians. In this paper, we focus on using power…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
Quantum many-body systems out of equilibrium pose some of the most intriguing questions in physics. Unfortunately, numerically keeping track of time evolution of states under Hamiltonian dynamics constitutes a severe challenge for all known…
An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…
Differential equations are one of the main approaches to evaluate multi-loop Feynman integrals. The construction of a canonical or $\varepsilon$-factorised basis for multi-loop integrals remains a key bottleneck for this approach,…
In this work, building up on [1] we present momentum space Ward identities related to broken higher spin symmetry as an alternate approach to computing correlators of spinning operators in interacting theories such as the quasi-fermionic…
Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address…
Using the parallel/orthogonal space method, we calculate the planar two-loop three-point diagram and two rotated reduced planar two-loop three-point diagrams. Together with the crossed topology, these diagrams are the most complicated ones…
For problems of time-harmonic scattering by rational polygonal obstacles, embedding formulae express the far-field pattern induced by any incident plane wave in terms of the far-field patterns for a relatively small (frequency-independent)…
Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…
We report here an extension of a previous work in which we have shown that matrix models provide a tool to compute the intersection numbers of p-spin curves. We discuss further an extension to half-integer p, and in more details for p=1/2…
We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…