Related papers: On the Method of Brackets: Rules, Examples, Interp…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…
The parametric representation has been used since a long time for the evaluation of Feynman diagrams. As a dimension independent intermediate representation, it allows a clear description of singularities. Recently, it has become a choice…
Euclidean gravity provides an interesting test system for an analysis of cosmological perturbations in an effective Hamiltonian constraint with holonomy modifications from loop quantum gravity. This paper presents a discussion of scalar…
Regularization-based approaches for injecting constraints in Machine Learning (ML) were introduced to improve a predictive model via expert knowledge. We tackle the issue of finding the right balance between the loss (the accuracy of the…
Inferential models (IMs) represent a novel possibilistic approach for achieving provably valid statistical inference. This paper introduces a general framework for fusing independent IMs in a "black-box" manner, requiring no knowledge of…
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
This is a first stab at a mathematical framework in which one can study quantum field theories on spacetimes with quite general geometries. We will study these theories via their factorization algebras. The aim is to identify a minimalist…
Extraction of association rules is widely used as a data mining method. However, one of the limit of this approach comes from the large number of extracted rules and the difficulty for a human expert to deal with the totality of these…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
Ideas from the theory of multisymplectic systems, introduced recently in integrable systems by the author and Kundu to discuss Liouville integrability in classical field theories with a defect, are applied to the sine-Gordon model. The key…
In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…
Naturally-occurring bracketings, such as answer fragments to natural language questions and hyperlinks on webpages, can reflect human syntactic intuition regarding phrasal boundaries. Their availability and approximate correspondence to…
The Symmetries of Feynman Integrals method (SFI) associates a natural Lie group with any diagram, depending only on its topology. The group acts on parameter space and the method determines the integral's dependence within group orbits.…
This paper presents complexity analysis and variational methods for inference in probabilistic description logics featuring Boolean operators, quantification, qualified number restrictions, nominals, inverse roles and role hierarchies.…
We present a projective framework for the construction of Integration by Parts (IBP) identities and differential equations for Feynman integrals, working in Feynman-parameter space. This framework originates with very early results which…
The Turaev cobracket, a loop operation introduced by V. Turaev, which measures self-intersection of a loop on a surface, is a modification of a path operation introduced earlier by Turaev himself, as well as a counterpart of the Goldman…
Fuzzy Rule-Based Classification Systems (FRBCSs) have the potential to provide so-called interpretable classifiers, i.e. classifiers which can be introspective, understood, validated and augmented by human experts by relying on fuzzy-set…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
This is a simple mathematical introduction into Feynman diagram technique, which is a standard physical tool to write perturbative expansions of path integrals near a critical point of the action. I start from a rigorous treatment of a…