English
Related papers

Related papers: Cospectral trees indistinguishable by scattering

200 papers

Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The…

Populations and Evolution · Quantitative Biology 2015-01-30 Stephen J. Willson

The relative importance of the intrinsic and extrinsic factors determining the variety of geometric shapes exhibited by dendritic trees remains unclear. This question was addressed by developing a model of the growth of dendritic trees…

Neurons and Cognition · Quantitative Biology 2007-05-23 Artur Luczak

Let $F$ be a transversely oriented foliation of codimension 1 on a closed manifold $M$, and let $\phi=\{\phi^t\}$ be a foliated flow on $(M,F)$. Assume the closed orbits of $\phi$ are simple and its preserved leaves are transversely simple.…

Geometric Topology · Mathematics 2024-02-14 Jesús A. Álvarez López , Yuri A. Kordyukov , Eric Leichtnam

We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations enclosed in the distribution. The…

Artificial Intelligence · Computer Science 2013-01-18 Ann Becker , Dan Geiger , Christopher Meek

In this paper we consider the Sturm-Liouville equation -y"+qy = lambda*y on the half line (0,infinity) under the assumptions that x=0 is a regular singular point and nonoscillatory for all real lambda, and that either (i) q is L_1 near…

Numerical Analysis · Mathematics 2013-03-13 Charles Fulton , David Pearson , Steven Pruess

We discuss various problems regarding the structure of the foliation of some foliated submanifolds S of C^n, in particular Levi flat ones. As a general scheme, we suppose that S is bounded along a coordinate (or a subset of coordinates),…

Complex Variables · Mathematics 2007-08-14 Giuseppe Della Sala

The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…

Combinatorics · Mathematics 2025-08-13 Bruce Reed , Maya Stein

We consider the Neumann Sturm-Liouville problem defined on trees such that the ratios of lengths of edges are not necessarily rational. It is shown that the potential function of the Sturm-Liouville operator must be zero if the spectrum is…

Spectral Theory · Mathematics 2010-10-01 C. K. Law , Eiji Yanagida

The Gy\'arf\'as tree packing conjecture states that any set of $n-1$ trees $T_{1},T_{2},..., T_{n-1}$ such that $T_i$ has $n-i+1$ vertices pack into $K_n$. We show that $t=1/10n^{1/4}$ trees $T_1,T_2,..., T_t$ such that $T_i$ has $n-i+1$…

Combinatorics · Mathematics 2012-12-18 József Balogh , Cory Palmer

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees…

Combinatorics · Mathematics 2025-12-23 Mireille Bousquet-Mélou , Christian Krattenthaler

We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a binary tree $T$ on $n$ leaves with a path metric $d$, consider the pairwise distances $\{d(u,v)\}$ between leaves. It is well known that these…

Combinatorics · Mathematics 2007-05-23 Elchanan Mossel

We study the Sturm-Liouville problem $-y''-\rho y=0$, $y(0)=y(1)=0$. $\rho$ is a generalized derivative of function $P\in L_2[0,1]$. For self-similar $P$ asymptotic formulas for eigenvalues are obtained. In this paper we consider two cases…

Functional Analysis · Mathematics 2007-05-23 I. A. Sheipak , A. A. Vladimirov

We prove that in both the free and the wired uniform spanning forest (FUSF and WUSF) of any unimodular random rooted network (in particular, of any Cayley graph), it is impossible to distinguish the connected components of the forest from…

Probability · Mathematics 2018-05-01 Tom Hutchcroft , Asaf Nachmias

We calculate the mean and almost-sure leading order behaviour of the high frequency asymptotics of the eigenvalue counting function associated with the natural Dirichlet form on $\alpha$-stable trees, which lead in turn to short-time heat…

Probability · Mathematics 2010-06-09 David Croydon , Ben Hambly

Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results…

Metric Geometry · Mathematics 2018-08-03 Jesús A. De Loera , Thomas A. Hogan , Deborah Oliveros , Dominic Yang

Let $F$ be an $n$-vertex forest. We say that an edge $e\notin F$ is in the shadow of $F$ if $F\cup\{e\}$ contains a cycle. It is easy to see that if $F$ is "almost a tree", that is, it has $n-2$ edges, then at least…

Combinatorics · Mathematics 2015-11-13 Nati Linial , Ilan Newman , Yuval Peled , Yuri Rabinovich

In the paper we consider singular spectral Sturm--Liouville problem $-(py')'+(q-\lambda r)y=0$, $(U-1)y^{\vee}+i(U+1)y^{\wedge}=0$, where function $p\in L_{\infty}[0,1]$ is uniformly positive, generalized functions $q,r\in W_2^{-1}[0,1]$…

Spectral Theory · Mathematics 2015-05-13 A. A. Vladimirov

The spin-4/3 fractional superstring is characterized by a world-sheet chiral algebra involving spin-4/3 currents. The discussion of the tree-level scattering amplitudes of this theory presented in hepth/9310131 is expanded to include…

High Energy Physics - Theory · Physics 2009-10-22 Philip C. Argyres , S. -H. Henry Tye

In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of $D$-cospectral…

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…

Data Structures and Algorithms · Computer Science 2007-05-23 Noga Alon , Fedor Fomin , Gregory Gutin , Michael Krivelevich , Saket Saurabh
‹ Prev 1 8 9 10 Next ›