Related papers: Abstract integration, Combinatorics of Trees and D…
In this paper, we introduce a notion of twisted Roe algebra and a twisted coarse Baum-Connes conjecture with coefficients. We will study the basic properties of twisted Roe algebras, including a coarse analogue of the imprimitivity theorem…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
In this article we use existing machinery to define connective $K$-theory spectra associated to topological ringoids. Algebraic $K$-theory of discrete ringoids, and the analytic $K$-theory of Banach categories are obtained as special cases.…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
In the article, the rough path theory is extended to cover paths from the exponential Besov-Orlicz space \[B^\alpha_{\Phi_\beta,q}\quad\mbox{ for }\quad \alpha\in (1/3,1/2],\,\quad \Phi_\beta(x) \sim…
The random split tree introduced by Devroye (1999) is considered. We derive a second order expansion for the mean of its internal path length and furthermore obtain a limit law by the contraction method. As an assumption we need the…
Hopf algebras appear in connection with various problems in Pure Mathematics and Theoretical Physics, mainly through their categoriesof representations, which are examples of tensor categories. In recent years, there have been major…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
Fourier normal ordering \cite{Unt09bis} is a new algorithm to construct explicit rough paths over arbitrary H\"older-continuous multidimensional paths. We apply in this article the Fourier normal ordering ordering algorithm to the…
We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
Recently, Hairer--Pillai proposed the notion of $\theta$-roughness of a path which leads to a deterministic Norris lemma. In the Gubinelli framework (Hoelder, level 2) of rough paths, they were then able to prove a Hoermander type result…
In this expository article we review recent advances in our understanding of the combinatorial and algebraic structure of perturbation theory in terms of Feynman graphs, and Dyson-Schwinger equations. Starting from Lie and Hopf algebras of…
We present a rough path analog of the classical Gronwall Lemma introduced recently by A. Deya, M. Gubinelli, M. Hofmanov\'a, S. Tindel in [arXiv:1604.00437] and discuss two of its applications. First, it is applied in the framework of rough…
This paper aims at presenting the first steps towards a formulation of the Exact Renormalization Group Equation in the Hopf algebra setting of Connes and Kreimer. It mostly deals with some algebraic preliminaries allowing to formulate…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
This is a survey article written for the Jahresberichte der DMV. Tropical geometry can be viewed as an efficient combinatorial tool to study degenerations in algebraic geometry. Abstract tropical curves are essentially metric graphs, and…
Let $K$ be a closed convex polyhedron defined by a finite number of linear inequalities. In this paper we refine the theory of abstract tubes (Naiman and Wynn, 1997) associated with $K$ when $K$ is perturbed. In particular, we focus on the…
We prove in this paper the original version of Kontsevich and Soibelman's motivic integral identity conjecture for formal functions by developing a novel framework for equivariant motivic integration on special rigid varieties. This theory…