English
Related papers

Related papers: Cospectral trees indistinguishable by scattering

200 papers

Spectral problems are considered generated by the Sturm-Liouville equation on equilateral trees with the Dirichlet boundary conditions at the pendant vertices and continuity and Kirchhoff's conditions at the interior vertices. It is proved…

Mathematical Physics · Physics 2024-01-26 Olga Boyko , Olga Martynyuk , Vyacheslav Pivovarchik

We show how to find the shape of an equilateral caterpillar tree using the spectra of the Neumann and the Dirichlet problems generated by the Sturm-Liouville equation on this tree. We prove that in the case of a caterpillar tree the spectra…

Mathematical Physics · Physics 2023-03-30 Dmytro Kaliuzhnyi-Verbovetskyi , Vyacheslav Pivovarchik

We show how to find the shape of an equilateral tree using the spectra of the Neumann and the Dirichlet problems generated by the Sturm-Liouville equation. In case of snowflake trees the spectra of the Neumann and Dirichlet problems…

Mathematical Physics · Physics 2023-03-14 Vyacheslav Pivovarchik

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

Probability · Mathematics 2018-10-16 Tom Hutchcroft

We consider a scattering problem generated by the Sturm-Liouville equation on a tree which consists of a equilateral compact subtree with a lead (a half-infinite edge) attached to this compact subtree. We assume that the potential on the…

Mathematical Physics · Physics 2023-03-14 Vyacheslav Pivovarchik

We examine the adjacency spectrum of trees with diameter three, also referred to as double stars. Using $P_2(a,b)$ to denote a double star with $ a$ and $b$ leaves at its respective endpoints, we discuss graphs which are cospectral to…

Combinatorics · Mathematics 2025-06-10 Emily Barranca , Michael D. Barrus

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

Let $T$ be a tree with an irreducible characteristic polynomial $\phi(x)$ over $\mathbb{Q}$. Let $\Delta(T)$ be the discriminant of $\phi(x)$. It is proved that if $2^{-\frac n2}\sqrt{\Delta(T)}$ (which is always an integer) is odd and…

Combinatorics · Mathematics 2023-10-03 Yizhe Ji , Wei Wang , Hao Zhang

Sturm-Liouville problem with generalized derivative of self-similar Cantor type function as a weight is considered. Under Neumann and mixed boundary conditions the oscillating properties of the eigenfunctions are studied. The spectral…

Spectral Theory · Mathematics 2011-03-29 A. A. Vladimirov , I. A. Sheipak

We consider a scattering problem generated by the Sturm-Liouville equation on a tree which consists of an equilateral compact subtree and a half-infinite lead attached to its root. We assume that the potential on the lead is identically…

Functional Analysis · Mathematics 2025-06-10 Olga Boyko , Yuri Latushkin , Vyacheslav Pivovarchik

Networks having the geometry and the connectivity of trees are considered as the spatial support of spatiotemporal dynamical processes. A tree is characterized by two parameters: its ramification and its depth. The local dynamics at the…

Pattern Formation and Solitons · Physics 2009-11-07 M. G. Cosenza , K. Tucci

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

Combinatorics · Mathematics 2024-02-21 Yuzhenni Wang , Xingxing Yu , Xiao-Dong Zhang

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})$…

Combinatorics · Mathematics 2016-01-12 Agnese Baldisserri , Elena Rubei

Tree-level scattering amplitudes for a scalar particle coupled to an arbitrary number N of photons and a single graviton are computed. We employ the worldline formalism as the main tool to compute the irreducible part of the amplitude,…

High Energy Physics - Theory · Physics 2020-08-04 Naser Ahmadiniaz , Filippo Maria Balli , Olindo Corradini , José Manuel Dávila , Christian Schubert

We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…

Probability · Mathematics 2026-03-24 Cecilia Holmgren , Jasper Ischebeck , Svante Janson

We consider standard subordinacy theory for general Sturm--Liouville operators and give criteria when boundedness of solutions implies that no subordinate solutions exist. As applications, we prove a Weidmann-type result for general…

Spectral Theory · Mathematics 2013-11-28 Michael Schmied , Robert Sims , Gerald Teschl

We describe the spectral theory of the adjacency operator of a graph which is isomorphic to homogeneous trees at infinity. Using some combinatorics, we reduce the problem to a scattering problem for a finite rank perturbation of the…

Mathematical Physics · Physics 2013-05-20 Yves Colin De Verdière , Francoise Truc

We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…

Combinatorics · Mathematics 2025-05-22 Dheer Noal Desai , Hemanshu Kaul , Bahareh Kudarzi

A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…

Combinatorics · Mathematics 2020-02-05 Jake Huryn

In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree…

Combinatorics · Mathematics 2026-05-20 Tonny K B , Shikhi M
‹ Prev 1 2 3 10 Next ›