English
Related papers

Related papers: On the relation between weighted trees and tropica…

200 papers

We say that a graph $F$ can be embedded into a graph $G$ if $G$ contains an isomorphic copy of $F$ as a subgraph. Guo and Volkmann \cite{GV} conjectured that if $G$ is a connected graph with at least $n$ vertices and minimum degree at least…

Combinatorics · Mathematics 2022-01-03 Zilong Yan , Yuejian Peng

Twisted ind-Grassmannians are ind-varieties $\GG$ obtained as direct limits of Grassmannians $G(r_m,V^{r_m})$, for $m\in\ZZ_{>0}$, under embeddings $\phi_m:G(r_m,V^{r_m})\to G(r_{m+1}, V^{r_{m+1}})$ of degree greater than one. It has been…

Algebraic Geometry · Mathematics 2007-06-28 Ivan Penkov , Alexander S. Tikhomirov

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

Combinatorics · Mathematics 2024-11-20 Kenta Noguchi , Carol T. Zamfirescu

Recent developments in particle physics have revealed deep connections between scattering amplitudes and tropical geometry. From the heart of this relationship emerged the chirotropical Grassmannian $\text{Trop}^\chi \text{G}(k,n)$ and the…

Combinatorics · Mathematics 2025-11-25 Dario Antolini , Nick Early

Koh and Tay proved a fundamental classification of $G$ vertex-multiplications into three classes $\mathscr{C}_0, \mathscr{C}_1$ and $\mathscr{C}_2$. They also showed that any vertex-multiplication of a tree with diameter at least 3 does not…

Combinatorics · Mathematics 2023-03-14 W. H. W. Wong , E. G. Tay

The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…

Combinatorics · Mathematics 2019-09-04 Steven Klee , Matthew T. Stamps

For two given positive integers $p$ and $q$ with $p\leqslant q$, we denote $\mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. For a graph $G$ with $n$ vertices, let $A(G)$ be its adjacency matrix with…

Combinatorics · Mathematics 2012-11-22 Shuchao Li , Jiajia Zhang

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

Combinatorics · Mathematics 2026-02-12 Caelan Wang , Karen Yeats

We study the soft limit of a recently proposed generalization of the biadjoint scalar amplitudes $m^{(k)}_{n}$, which have been conjectured to have a relation to the tropical Grassmannian $\text{Tr G}(k,n)$. Using the CHY formulation along…

High Energy Physics - Theory · Physics 2019-09-13 Diego García Sepúlveda , Alfredo Guevara

We figure out the explicit expression for the trace of the field equations associated to generic higher derivative theories of gravity endowed with Lagrangians depending upon the metric and its Riemann tensor, together with arbitrary order…

General Relativity and Quantum Cosmology · Physics 2026-03-31 Jun-Jin Peng , Hua Li

Recently, twistor-like formulations of tree amplitudes involving $n$ massless particles have been proposed for various 6D supersymmetric theories. The formulas are based on two different forms of the scattering equations: one based on…

High Energy Physics - Theory · Physics 2019-10-02 John H. Schwarz , Congkao Wen

Let $A$ be an acyclic symmetric matrix of order $n$. There is a weighted forest $F$ whose adjacency matrix is $A$. In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of $A$.

Combinatorics · Mathematics 2016-09-09 Asghar Bahmani , Dariush Kiani

Using the notion of a root datum of a reductive group $G$ we propose a tropical analogue of a principal $G$-bundle on a metric graph. We focus on the case $G=\mathrm{GL}_n$, i.e. the case of vector bundles. Here we give a characterization…

Algebraic Geometry · Mathematics 2022-06-22 Andreas Gross , Martin Ulirsch , Dmitry Zakharov

In this note we consider some properties of $GL_n(\mathbb{R})$ with the Semi-Riemannian structure induced by the trace metric $g$. In particular we study geodesics and curvature tensors. Moreover we prove that $GL_n$ has a suitable…

Differential Geometry · Mathematics 2014-12-16 Alberto Dolcetti , Donato Pertici

We tropicalize the rational map that takes triples of points in the projective plane to the plane of quadrics passing through these points. The image of its tropicalization is contained in the tropicalization of its image. We identify these…

Algebraic Geometry · Mathematics 2010-02-04 Sarah Brodsky , Bernd Sturmfels

For all integers $k\geq 3$, we give an $O(n^4)$ time algorithm for the problem whose instance is a graph $G$ of girth at least $k$ together with $k$ vertices and whose question is "Does $G$ contains an induced subgraph containing the $k$…

Discrete Mathematics · Computer Science 2013-09-06 Wei Liu , Nicolas Trotignon

In this paper we introduce and study three new measures for efficient discriminative comparison of phylogenetic trees. The NNI navigation dissimilarity $d_{nav}$ counts the steps along a "combing" of the Nearest Neighbor Interchange (NNI)…

Populations and Evolution · Quantitative Biology 2015-10-21 Omur Arslan , Dan P. Guralnik , Daniel E. Koditschek

We compute the space of 5x5 matrices of tropical rank at most 3 and show that it coincides with the space of 5x5 matrices of Kapranov rank at most 3, that is, the space of five labeled coplanar points in TP4. We then prove that the Kapranov…

Combinatorics · Mathematics 2009-12-31 Melody Chan , Anders N. Jensen , Elena Rubei

An $n$-vertex tree $T$ is said to be $\textit{graceful}$ if there exists a bijective labelling $\phi:V(T)\to \{1,\ldots,n\}$ such that the edge-differences $\{|\phi(x)-\phi(y)| : xy\in E(T)\}$ are pairwise distinct. The longstanding…

Combinatorics · Mathematics 2025-11-17 Shoham Letzter , Alexey Pokrovskiy , Ella Williams

Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2 \le k \le n$, be the length of the subtree spanned by the first $k$ leaves. We consider the question, "Can $T$ be…

Combinatorics · Mathematics 2015-06-04 Steven N. Evans , Daniel Lanoue