Related papers: D-log and formal flow for analytic isomorphisms of…
We calculate the formal analytic expansions of certain formal translations in a space of formal iterated logarithmic and exponential variables. The results show how the algebraic structure naturally involves the Stirling numbers of the…
A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…
In this work we continue to study the properties of polynomials of binomial type and their canonical continuations to the complex index by exploring the properties of transformation T:=1/dlog which acts on formal power series $f(x)$ of the…
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…
Unstable operations in a generalized cohomology theory E give rise to a functor from the category of algebras over E to itself which is a colimit of representable functors and a comonoid with respect to composition of such functors. In this…
This is a paper in a series that studies smooth relative Lie algebra homologies and cohomologies based on the theory of formal manifolds and formal Lie groups. In three previous papers, we introduce the notion of formal manifolds and study…
In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
We present a light formalism for proofs that encodes their inferential structure, along with a system that transforms these representations into flow-chart diagrams. Such diagrams should improve the comprehensibility of proofs. We discuss…
Let $F=(F_1, F_2, ... F_n)$ be an $n$-tuple of formal power series in $n$ variables of the form $F(z)=z+ O(|z|^2)$. It is known that there exists a unique formal differential operator $A=\sum_{i=1}^n a_i(z)\frac {\p}{\p z_i}$ such that…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the…
The Jacobian conjecture involves the map $y= x - V(x)$ where $y, x$ are n-dimensional vectors, $V(x)$ is a symmetric polynomial of degree $d$ for which the Jacobian hypothesis holds: $ e^{Tr \ln(1- V'(x))} =1,\ \forall x$. The conjecture…
Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the…
We establish discrete and continuous log-concavity results for a biparametric extension of the $q$-numbers and of the $q$-binomial coefficients. By using classical results for the Jacobi theta function we are able to lift some of our…
We begin this note with a von Neumann algebraic version of the elementary but extremely useful fact about being able to extend inner-product preserving maps from a total set of the domain Hilbert space to an isometry defined on the entire…
Search trees are fundamental data structures in computer science. We study functionals on random search trees that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal…
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the…
Recently, a combinatorial interpretation of Baldoni and Vergne's generalized Lidskii formula for the volume of a flow polytope was developed by Benedetti et al.. This converts the problem of computing Kostant partition functions into a…
The computational complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are…