Related papers: Shuffle relations for regularised integrals of sym…
In this paper, we introduce iterated integrals associated with colored rooted trees and give proofs for the shuffle relations for $\boldsymbol{p}$-adic finite and $t$-adic symmetric polylogarithms. This method generalizes the theory of the…
We define a generalization of the winding number of a piecewise $C^1$ cycle in the complex plane which has a geometric meaning also for points which lie on the cycle. The computation of this winding number relies on the Cauchy principal…
Thimble regularization as a solution to the sign problem has been successfully put at work for a few toy models. Given the non trivial nature of the method (also from the algorithmic point of view) it is compelling to provide evidence that…
Let $f$ be an orientation preserving homeomorphisms on the circle with several break points, that is, its derivative $Df$ has jump discontinuities at these points. We study Rauzy-Veech renormalizations of piecewise smooth circle…
Chen's iterated integrals may be generalized by interpolation of functions of the positive integer number of times which particular forms are iterated in integrals along specific paths, to certain complex values. These generalized iterated…
For supersymmetric gauge theories a consistent regularization scheme that preserves supersymmetry and gauge invariance is not known. In this article we tackle this problem for supersymmetric QED within the framework of algebraic…
We derive the generalized Green-Kubo relation and an integral form of the fluctuation theorem that apply to uniformly sheared granular systems in which microscopic time-reversal symmetry is broken. The former relation provides an exact…
An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…
We investigate to what extent renormalization can be understood as an algebraic manipulation on concatenated one-loop integrals. We find that the resulting algebra indicates a useful connection to knot theory.
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
The matching between Schrodinger Functional renormalization schemes and conventional perturbative schemes is usually done using an intermediate lattice scheme. We propose to do the matching directly. This requires the perturbative…
We introduce the concept of a conical zeta value as a geometric generalization of a multiple zeta value in the context of convex cones. The quasi-shuffle and shuffle relations of multiple zeta values are generalized to open cone subdivision…
The frame of classical probability theory can be generalized by enlarging the usual family of random variables in order to encompass nondeterministic ones: this leads to a frame in which two kinds of correlations emerge: the classical…
To a function with values in the power set of a pre-ordered, separated locally convex space a family of scalarizations is given which completely characterizes the original function. A concept of a Legendre-Fenchel conjugate for set-valued…
Stanley symmetric functions are the stable limits of Schubert polynomials. In this paper, we show that, conversely, Schubert polynomials are Demazure truncations of Stanley symmetric functions. This parallels the relationship between Schur…
The systematic approach to solving the recurrence relations for multi-loop integrals is described. In particular, the criteria of their reducibility is suggested.
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…
Iterative regularization is a classic idea in regularization theory, that has recently become popular in machine learning. On the one hand, it allows to design efficient algorithms controlling at the same time numerical and statistical…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…