相关论文: Dissimilarity vectors of trees are contained in th…

We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This…

Imitating a recently introduced invariant of trees, we initiate the study of the inducibility of $d$-ary trees (rooted trees whose vertex outdegrees are bounded from above by $d\geq 2$) with a given number of leaves. We determine the exact…

In this paper, we introduce the Grassmann tensor by tensor product of vectors and some basic terminology in tensor theory. Some basic properties of the Grassmann tensors are investigated and the tensor language is used to rewrite some…

We provide a cluster-algebraic approach to the computation of the recently introduced generalised biadjoint scalar amplitudes related to Grassmannians ${\rm Gr}(k,n)$. A finite cluster algebra provides a natural triangulation for the…

We study tropicalisations of quasi-automorphisms of cluster algebras and show that their induced action on the g-vectors can be realized by tropicalising their action on the homogeneous $\hat{y}$ (or $\mathcal{X}$) variables of a chosen…

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…

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

In the present paper we prove that the classes of Dixmier and Connes-Dixmier traces differ even on the Dixmier ideal $\mathcal M_{1,\infty}$. We construct a Marcinkiewicz space $\mathcal M_\psi$ and a positive operator $T\in \mathcal…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

Tao conjectured that every dense subset of $\mathcal{P}^d$, the $d$-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we…

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

We demonstrate the existence of a uniform and nonhomogeneous vector bundle $E$ of rank $(n-d)(m+1)-1$ over Grassmannian $\mathbb{G}(d,n)$, where $m>d$ and $1\le d \le n-d-1$ with a $\mathbb{P}$-homogeneity degree $h(E)=d$. Particularly, we…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

We classify all the embeddings of $\mathbb{P}_n$ in a Grassmannian $Gr(1,N)$ such that the composition with Pl\"{u}cker embedding is given by a linear system of cubics on $\mathbb{P}_n$. As a corollary in the direction of the Hartshorne…

Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$. In doing so, we…