Related papers: Multi-indice B-series
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…
We obtain (small-parameter) well-posedness for the (space-time periodic) $\Phi^4$ equation in the full subcritical regime in the context of regularity structures based on multi-indices. As opposed to Hairer's more extrinsic tree-based…
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…
Fractional calculus is the calculus of differentiation and integration of non-integer orders. In a recently paper (Annals of Physics 323 (2008) 2756-2778), the Fundamental Theorem of Fractional Calculus is highlighted. Based on this…
The change of numeraire gives very important computational simplification in option pricing. This technique reduces the number of sources of risks that need to be accounted for and so it is useful in pricing complicated derivatives that…
The space of parametric b-measures endowed with appropriate topologies is introduced to define a new class of generalized ODEs given by parametric b-measures. This framework offers a new approach for dealing with precompact families of…
Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible…
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…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
A groundswell of recent work has focused on improving data management systems with learned components. Specifically, work on learned index structures has proposed replacing traditional index structures, such as B-trees, with learned models.…
Variable trees are a new method for the exploration of discrete multivariate data. They display nested subsets and corresponding frequencies and percentages. Manual calculation of these quantities can be laborious, especially when there are…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…
We introduce inference trees (ITs), a new class of inference methods that build on ideas from Monte Carlo tree search to perform adaptive sampling in a manner that balances exploration with exploitation, ensures consistency, and alleviates…
We develop the Tree-Loop Duality Relation for two- and three-loop integrals with multiple identical propagators (multiple poles). This is the extension of the Duality Relation for single poles and multiloop integrals derived in previous…
We decompose a matrix Y into a sum of bilinear terms in a stepwise manner, by considering Y as a mapping from a finite dimensional Banach space into another finite dimensional Banach space. We provide transition formulas, and represent them…