Related papers: A structural approach to subset-sum problems
A general primal-dual splitting algorithm for solving systems of structured coupled monotone inclusions in Hilbert spaces is introduced and its asymptotic behavior is analyzed. Each inclusion in the primal system features compositions with…
We use the fermionic construction of two-matrix model partition functions to evaluate integrals over rational symmetric functions. This approach is complementary to the one used in the paper ``Integrals of Rational Symmetric Functions,…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
We give combinatorially controlled series solutions to Dyson--Schwinger equations with multiple insertion places using tubings of rooted trees and investigate the algebraic relation between such solutions and the renormalization group…
This work proposes a conformable fractional predictor-corrector algorithm for solving conformable fractional differential equations. Fractional calculus is finding applications in various scientific fields, but existing numerical methods…
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
Structured prediction problems are one of the fundamental tools in machine learning. In order to facilitate algorithm development for their numerical solution, we collect in one place a large number of datasets in easy to read formats for a…
We construct solutions of the Friedmann equations near a sudden singularity using generalized series expansions for the scale factor, the density, and the pressure of the fluid content. In this way, we are able to arrive at a solution with…
Hypergeometric structures in single and multiscale Feynman integrals emerge in a wide class of topologies. Using integration-by-parts relations, associated master or scalar integrals have to be calculated. For this purpose it appears useful…
Abstractive text summarization aims at compressing the information of a long source document into a rephrased, condensed summary. Despite advances in modeling techniques, abstractive summarization models still suffer from several key…
In these lectures we introduce the Feynman-Schwinger representation method for solving nonperturbative problems in field theory. As an introduction we first give a brief overview of integral equations and path integral methods for solving…
The Compositional Integral is defined, formally constructed, and discussed. A direct generalization of Riemann's construction of the integral; it is intended as an alternative way of looking at First Order Differential Equations. This brief…
The present paper provides a method for finding partial differential equations satisfied by the Feynman integrals for diagrams of various types, using the Griffiths theorem on the reduction of poles of rational differential forms. As an…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
We consider the Subset Sum Ratio Problem ($SSR$), in which given a set of integers the goal is to find two subsets such that the ratio of their sums is as close to~1 as possible, and introduce a family of variations that capture additional…
This is a survey of our research on geometric structures of projective embeddings and includes some topics of our talks in several symposia during 1990-99. We clarify our main problem, which is to construct a kind of geometric composition…