Related papers: Solving arbitrary one-loop reduction via generatin…
This paper presents a method to build explicit tensor-train (TT) representations. We show that a wide class of tensors can be explicitly represented with sparse TT-cores, obtaining, in many cases, optimal TT-ranks. Numerical experiments…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
We generalize generating functions for hypergeometric orthogonal polynomials, namely Jacobi, Gegenbauer, Laguerre, and Wilson polynomials. These generalizations of generating functions are accomplished through series rearrangement using…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
Given a general scalar balance law, i.e., in several space dimensions and with flux and source both space and time dependent, we focus on the functional properties of the entropy production. We apply this operator to entropy solutions, to…
In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…
We consider the cross section for one-particle inclusive production at high transverse momentum in hadronic collisions. We present the all-order resummation formula that controls the logarithmically-enhanced perturbative QCD contributions…
We present an expression for the generating function of correlation functions of the sine-Gordon integrable field theory on a cylinder, with compact space. This is derived from the Destri-De Vega integrable lattice regularization of the…
We derive the generating functional of $|\Delta S| =1, 2$ hadronic weak interactions at one loop for a generic number of flavours and its counterpart in the quenched approximation. A systematic analysis of the ultraviolet divergences in the…
Theoretical results are presented for top quarks produced in annihilation of polarized electrons on positrons. Polarization studies for $t\bar t$ pairs near threshold are free from hadronization ambiguities. This is due to the short…
The purpose of this paper is to construct of the unification q-extension Genocchi polynomials. We give some interesting relations of this type of polynomials. Finally, we derive the q-extensions of Hurwitz-zeta type functions from the…
The problem of partitioning a large and sparse tensor is considered, where the tensor consists of a sequence of adjacency matrices. Theory is developed that is a generalization of spectral graph partitioning. A best rank-$(2,2,\lambda)$…
Anderson generating functions are generating series for division values of points on Drinfeld modules, and they serve as important tools for capturing periods, quasi-periods, and logarithms. They have been fundamental in recent work on…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
Code generation plays a crucial role in various tasks, such as code auto-completion and mathematical reasoning. Previous work has proposed numerous methods to enhance code generation performance, including integrating feedback from the…
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in…
We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursive algorithm for computing rank one tensor completion. This…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
Several new relationships between hypergeometric functions are found by comparing results for Feynman integrals calculated using different methods. A new expression for the one-loop propagator-type integral with arbitrary masses and…
We study the multivariate integration problem for periodic functions from the weighted Korobov space in the randomized setting. We introduce a new randomized rank-1 lattice rule with a randomly chosen number of points, which avoids the need…