Related papers: Bumpless Pipedreams, Reduced Word Tableaux and Sta…

Starting from flat two-dimensional gauge potentials we propose the notion of ${\cal W}$-gauge structure in terms of a nilpotent BRS differential algebra. The decomposition of the underlying Lie algebra with respect to an $SL(2)$ subalgebra…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

This paper introduces the geometry of the open string Floer theory of gauged Landau-Ginzburg model via gauged Witten equations. Given a $G$-invariant Morse-Bott holomorphic function $W$ on a Hamiltonian space $(M,\omega,G),$ Lefschetz…

Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for…

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…

An electroweak model in which the masses of the W and Z bosons and the fermions are generated by quantum loop graphs through a symmetry breaking is investigated. The model is based on a regularized quantum field theory in which the quantum…

We prove an asymptotic Edgeworth expansion for the profiles of certain random trees including binary search trees, random recursive trees and plane-oriented random trees, as the size of the tree goes to infinity. All these models can be…

Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Often, it is natural and desirable to require that these structures have small hop length or hop diameter. Unfortunately, optimization problems…

The Burrows-Wheeler Transform (BWT) has been an essential tool in text compression and indexing. First introduced in 1994, it went on to provide the backbone for the first encoding of the classic suffix tree data structure in space close to…

Postnikov gave a parametrization for the totally non-negative Grassmannian using the matroid decomposition and associating a network with \reflectbox{L}-diagrams. Talaska and Williams extend this result to the entire Grassmannian by using…

A {$t$-stretch tree cover} of a metric space $M = (X,\delta)$, for a parameter $t \ge 1$, is a collection of trees such that every pair of points has a $t$-stretch path in one of the trees. Tree covers provide an important sketching tool…

Let $\mu$ be the geometric realization on $[0,1]$ of a Gibbs measure on $\Sigma=\{0,1\}^{\mathbb{N}}$ associated with a H\"older potential. The thermodynamic and multifractal properties of $\mu$ are well known to be linked via the…

For a finitely generated group $G$, we introduce an asymmetric pseudometric on projectivized deformation spaces of $G$-trees, using stretching factors of $G$-equivariant Lipschitz maps, that generalizes the Lipschitz metric on Outer space…

We introduce a new class of numerical schemes which allow for low regularity approximations to the expectation $ \mathbb{E}(|u_{k}(\tau, v^{\eta})|^2)$, where $u_k$ denotes the $k$-th Fourier coefficient of the solution $u$ of the…

Fix a probability $p\in(0,1)$. Let $s_i$ denote the transposition in the symmetric group $\mathfrak{S}_n$ that swaps $i$ and $i+1$. Given a word $\mathsf{w}$ over the alphabet $\{s_1,\ldots,s_{n-1}\}$, we can generate a random subword by…

The Gilbert-Pollak Conjecture \citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the Steiner minimum tree has length at least $\sqrt{3}/2 \approx 0.866$ times…

This article addresses the problem of developing an extension of the Marsden- Weinstein reduction process to symplectic Lie algebroids, and in particular to the case of the symplectic cover of a fiberwise linear Poisson structure, whose…

We study random permutations arising from reduced pipe dreams. Our main model is motivated by Grothendieck polynomials with parameter $\beta=1$ arising in K-theory of the flag variety. The probability weight of a permutation is proportional…

We study quantum mechanical systems with a discrete spectrum. We show that the asymptotic series associated to certain paths of steepest-descent (Lefschetz thimbles) are Borel resummable to the full result. Using a geometrical approach…

Many variants of Optimal Transport (OT) have been developed to address its heavy computation. Among them, notably, Sliced Wasserstein (SW) is widely used for application domains by projecting the OT problem onto one-dimensional lines, and…