Related papers: Solving arbitrary one-loop reduction via generatin…
This paper proposes a novel method for learning highly nonlinear, multivariate functions from examples. Our method takes advantage of the property that continuous functions can be approximated by polynomials, which in turn are representable…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
In order to meet the precision requirements for the LHC and future colliders, next-to-next-to-leading order corrections to a wide range of processes are essential, making general automated tools highly desirable. Extending the strategy of…
In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…
The paper develops an optimal regulator for a general class of multi-input affine nonlinear systems minimizing a nonlinear cost functional with infinite horizon. The cost functional is general enough to enforce saturation limits on the…
The Set Partitioning Problem is a combinatorial optimization problem with wide-ranging applicability, used to model various real-world tasks such as facility location and crew scheduling. However, real-world applications often require…
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…
We consider the problem of low-rank decomposition of incomplete multiway tensors. Since many real-world data lie on an intrinsically low dimensional subspace, tensor low-rank decomposition with missing entries has applications in many data…
We describe a new method for the automated construction of one-loop amplitudes based on the open-loop algorithm, where various operations are performed on-the-fly while constructing the integrand. In particular, an on-the-fly reduction…
We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to…
Tensor decomposition plays a key role in identifying common features across a collection of matrices in many areas of science. A fundamental need in big data research is to process data tabulated as large-scale matrices using eigenvectors.…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
For a given symmetric tensor, we aim at finding a new one whose symmetric rank is small and that is close to the given one. There exist linear relations among the entries of low rank symmetric tensors. Such linear relations can be expressed…
We perform a complete analytical reduction of general one-loop Feynman integrals with five and six external legs for tensors up to rank R=3 and 4, respectively. An elegant formalism with extensive use of signed minors is developed for the…
The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…
Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…
This is the second of two articles devoted to an exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper focuses on fusion rules, using the machinery developed for tensor products in…