Related papers: Bumpless Pipedreams, Reduced Word Tableaux and Sta…
We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of…
Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…
We study the dynamics of four dimensional gauge theories with adjoint fermions for all gauge groups, both in perturbation theory and non-perturbatively, by using circle compactification with periodic boundary conditions for the fermions.…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…
The Baum-Connes assembly map with coefficients $e_{\ast}$ and the Mishchenko-Kasparov assembly map with coefficients $\mu_{\ast}$ are two homomorphisms from the equivariant $K$-homology of classifying spaces of groups to the $K$-theory of…
Let $\Sigma$ a closed $n$-dimensional manifold, $\mathcal{N} \subset \mathbb{R}^M$ be a closed manifold, and $u \in W^{s,\frac ns}(\Sigma,\mathcal{N})$ for $s\in(0,1)$. We extend the monumental work of Sacks and Uhlenbeck by proving that if…
Bidirected graphs (earlier studied by Edmonds, Johnson and, in equivalent terms of skew-symmetric graphs, by Tutte, Goldberg, Karzanov, and others) proved to be a useful unifying language for describing both flow and matching problems. In…
In this thesis we construct 3-parameter families $G(p,q,r)$ of embedded arcs with fixed boundary in a 4-manifold. We then analyze these elements of $\pi_3\mathsf{Emb}_\partial(I,M)$ using embedding calculus by studying the induced map from…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. In this paper we show that every quasiconformal tree bi-Lipschitz embeds in some…
Ewens-Pitman's partition structure arises as a system of sampling consistent probability distributions on set partitions induced by the Pitman-Yor process. It is widely used in statistical applications, particularly in species sampling…
We survey the theory and applications of mating-of-trees bijections for random planar maps and their continuum analog: the mating-of-trees theorem of Duplantier, Miller, and Sheffield (2014). The latter theorem gives an encoding of a…
In [1] we have constructed a [n+1/2]+1 parameters family of irreducible representations of the Braid group B_3 in arbitrary dimension using a $q-$deformation of the Pascal triangle. This construction extends in particular results by S.P.…
A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…
Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
This is a survey paper of our current research on the theory of partial differential equations in conformal geometry. Our intention is to describe some of our current works in a rather brief and expository fashion. We are not giving a…
The rigorous microscopic theory of equilibrium crystal shapes has made enormous progress during the last decade. We review here the main results which have been obtained, both in two and higher dimensions. In particular, we describe how the…