相关论文: Subnormal weighted shifts on directed trees whose …
Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…
We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…
An absolute continuity approach to quasinormality which relates the operator in question to the spectral measure of its modulus is developed. Algebraic characterizations of some classes of operators that emerged in this context are…
The fate of shift-symmetries in effective string models is considered beyond tree-level. Such symmetries have been proposed in the past as a way to maintain a hierarchically small Higgs mass and also play a role in schemes of cosmological…
We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of $C_n^2$ is contained in a unique nontrivial connected spanning convex subgraph of $C_n^2$. As a result, we obtain a purely…
We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).
We consider so-called simple families of labelled trees, which contain, e.g., ordered, unordered, binary and cyclic labelled trees as special instances, and study the global and local behaviour of the number of inversions. In particular we…
Over n-dimensional manifolds, I classify ternary differential operators acting on the spaces of weighted densities and invariant with respect to the Lie algebra of vector fields. For n=1, some of these operators can be expressed in terms of…
We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…
Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely…
We show that the low-energy effective superpotential of an N=1 U(N) gauge theory with matter in the adjoint and arbitrary even tree-level superpotential has, in the classically unbroken case, the same functional form as the effective…
We argue that the hidden sector potential energy is generically of order the intermediate scale although the true cosmological constant does vanish. This would significantly change the predicted values of soft parameters for a variety of…
We develop the complex-analytic viewpoint on the tree convolutions studied by the second author and Weihua Liu in "An operad of non-commutative independences defined by trees" (Dissertationes Mathematicae, 2020, doi:10.4064/dm797-6-2020),…
A link L is called Brunnian if every proper sublink of L is trivial. Similarly, a bottom tangle T is called Brunnian if every proper subtangle of T is trivial. In this paper, we give a small subalgebra of the n-fold completed tensor power…
It has been known for some time that generalised geometry provides a particularly elegant rewriting of the action and symmetries of 10-dimensional supergravity theories, up to the lowest nontrivial order in fermions. By exhibiting the full…
We introduce the idea of a weakly entangled linear order, and show that it is consistent for a Suslin line to be weakly entangled. We generalize the notion of entangled linear orders to $\omega_1$-trees, and prove that an $\omega_1$-tree is…
Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$.For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$, let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$…
The Strong Nine Dragon Tree Conjecture asserts that for any integers $k$ and $d$ any graph with fractional arboricity at most $k + \frac{d}{d+k+1}$ decomposes into $k+1$ forests, such that for at least one of the forests, every connected…
We define a modified dimensional-regularization technique that overcomes several difficulties of the ordinary technique, and is specially designed to work efficiently in chiral and parity violating quantum field theories, in arbitrary…
The decomposition of a density function on a domain into a minimal sum of unimodal components is a fundamental problem in statistics, leading to the topological invariant of unimodal category of a density. This paper gives an efficient…