Related papers: Widths of function classes on sets with tree-like …
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…
We construct classes of graphs that are variants of the so-called layered wheel. One of their key properties is that while the treewidth is bounded by a function of the clique number, the construction can be adjusted to make the dependance…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We study a class of weight functions on $[-1,1]$, which are special cases of the general weights studied by Bernstein and Szeg\"o, as well as their extentions to the interval $[-a,1]$ for a continuous parameter $a>0$. These weights are…
Some results on the approximation of functions from the Sobolev spaces on metric graphs by step functions are obtained. The estimates are uniform with respect to all graphs of a given finite length, and the constant factors in the…
In this paper we prove a functional limit theorem for the weighted profile of a $b$-ary tree. For the proof we use classical martingales connected to branching Markov processes and a generalized version of the profile-polynomial martingale.…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
We study the boundary traces of Newton-Sobolev, Hajlasz-Sobolev, and BV (bounded variation) functions. Assuming less regularity of the domain than is usually done in the literature, we show that all of these function classes achieve the…
We determine upper asymptotic estimates of Kolmogorov and linear $n$-widths of unit balls in Sobolev and Besov norms in $L_{p}$-spaces on compact Riemannian manifolds. The proofs rely on estimates for the near-diagonal localization of the…
We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.
In this paper we continue the study of dilatation structures, introduced in math.MG/0608536 . A dilatation structure on a metric space is a kind of enhanced self-similarity. By way of examples this is explained here with the help of the…
In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we…
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
This is a short exposition--mostly by way of the toy models ``double logarithm'' and ``triple logarithm''--which should serve as an introduction to a forthcoming article in which we establish a connection between multiple polylogarithms,…
We first study subextensions of m-subharmonic functions in weighted energy classes with given boundary values. The results are used to approximate an m-subharmonic function in weighted energy classes with given boundary values by an…
We prove the well posedness in weighted Sobolev spaces of certain linear and nonlinear elliptic boundary value problems posed on convex domains and under singular forcing. It is assumed that the weights belong to the Muckenhoupt class $A_p$…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…