Related papers: Multi-indice B-series
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the…
We propose and study a multi-scale approach to vector quantization. We develop an algorithm, dubbed reconstruction trees, inspired by decision trees. Here the objective is parsimonious reconstruction of unsupervised data, rather than…
In this paper a set of previous general results for the development of B--series for a broad class of stochastic differential equations has been collected. The applicability of these results is demonstrated by the derivation of B--series…
The aim of this paper is the study of the bisection method in $\mathbb{R}^n$. In this work we propose a multivariate bisection method supported by the Poincar\'e-Miranda theorem in order to solve non-linear system of equations. Given an…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
We systematically develop the multivariable counterpart of the theory of weighted shifts on rooted directed trees. Capitalizing on the theory of product of directed graphs, we introduce and study the notion of multishifts on directed…
This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree…
In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…
Modern datasets are often in the form of matrices or arrays,potentially having correlations along each set of data indices. For example, data involving repeated measurements of several variables over time may exhibit temporal correlation as…
Given a finite subset $F$ of integer points in $\mathbb Z^d$, it is of interest to seek conditions on $F$ that allow it to multi-tile $\mathbb Z^d$ by translations. To this end, we give a discretized version of the Bombieri-Siegel formula,…
We provide a primer to numerical methods based on Taylor series expansions such as generalized finite difference methods and collocation methods. We provide a detailed benchmarking strategy for these methods as well as all data files…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…
The notion of trees plays an important role in Butcher's B-series. More recently, a refined understanding of algebraic and combinatorial structures underlying the Magnus expansion has emerged thanks to the use of rooted trees. We follow…
In this survey one discusses the notion of the Poincar\'e series of multi-index filtrations, an alternative approach to the definition, a method of computation of the Poincar\'e series based on the notion of integration with respect to the…
In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
The Bradley-Terry model is a popular approach to describe probabilities of the possible outcomes when elements of a set are repeatedly compared with one another in pairs. It has found many applications including animal behaviour, chess…
In this paper, by introducing a new notion of envelope of the stochastic process, we construct a family of random differential equations whose solutions can be viewed as solutions of a family of ordinary differential equations and prove…