Related papers: PGL orbits in tree varieties

For a given metric space $(P,\phi)$, a tree cover of stretch $t$ is a collection of trees on $P$ such that edges $(x,y)$ of trees receive length $\phi(x,y)$, and such that for any pair of points $u,v\in P$ there is a tree $T$ in the…

For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G covering all vertices of G. We prove that for a fixed tree T on…

We continue, generalize and expand our study of linear degenerations of flag varieties from [G. Cerulli Irelli, X. Fang, E. Feigin, G. Fourier, M. Reineke, Math. Z. 287 (2017), no. 1-2, 615-654]. We realize partial flag varieties as quiver…

In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed…

Let $\mu(G)$ denote the spectral radius of a graph $G$. We partly confirm a conjecture due to Nikiforov, which is a spectral radius analogue of the well-known Erd\H{o}s-S\'os Conjecture that any tree of order $t$ is contained in a graph of…

The complete flag variety admits a natural action by both the orthogonal group and the symplectic group. Wyser and Yong defined orthogonal Grothendieck polynomials $\mathfrak{G}^{\mathsf{O}}_z$ and symplectic Grothendieck polynomials…

We formulate a strengthening of the Zariski dense orbit conjecture for birational maps of dynamical degree one. So, given a quasiprojective variety $X$ defined over an algebraically closed field $K$ of characteristic $0$, endowed with a…

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…

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

For any small constant $\epsilon>0$, the Erd\H{o}s-R\'enyi random graph $G(n,\frac{1+\epsilon}{n})$ with high probability has a unique largest component which contains $(1\pm O(\epsilon))2\epsilon n$ vertices. Let $G_c(n,p)$ be obtained by…

Consider a complex algebraic group $G$ acting on a smooth variety $M$ with finitely many orbits, and let $\Omega$ be an orbit. The following three invariants of $\Omega\subset M$ can be characterized axiomatically: (1) the equivariant…

Let $X/K$ be a smooth projective variety defined over a number field, and let $f:X\to{X}$ be a morphism defined over $K$. We formulate a number of statements of varying strengths asserting, roughly, that if there is at least one point…

Let F : P^n --> P^n be a morphism of degree d > 1 defined over C. The dynamical Mordell--Lang conjecture says that the intersection of an orbit O_F(P) and a subvariety X of P^n is usually finite. We consider the number of linear…

Let V be a complex representation of a finite group G of order g. Derksen conjectured that the pth syzygies of the invariant ring Sym(V)^G are generated in degrees at most (p+1)g. We point out that a simple application of the theory of…

The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute…

The well known bunkbed conjecture about percolation on finite graphs is now resolved; Gladkov, Pak and Zimin, building upon work of Hollom, have constructed a counterexample. We revisit this conjecture and study it in the broader context of…

We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\Delta$, then a copy of $T$ can almost surely be found in the random graph $\mathcal{G}(n,\Delta\log^5 n/n)$.

Given an integer $D$ and an ordinary isogeny class of abelian varieties defined over a finite field $\mathbb{F}_q$ with commutative $\mathbb{F}_q$-endomorphism algebra, we provide algorithms for computing all isogenies of degree dividing…