English
Related papers

Related papers: Singular Continuous and Dense Point Spectrum for S…

200 papers

We describe a method for comparing the real analytic eigenbranches of two families of quadratic forms that degenerate as t tends to zero. One of the families is assumed to be amenable to `separation of variables' and the other one not. With…

Spectral Theory · Mathematics 2015-05-14 Luc Hillairet , Chris Judge

A quasiconformal tree $T$ is a (compact) metric tree that is doubling and of bounded turning. We call $T$ trivalent if every branch point of $T$ has exactly three branches. If the set of branch points is uniformly relatively separated and…

Complex Variables · Mathematics 2020-04-20 Mario Bonk , Daniel Meyer

We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.

Functional Analysis · Mathematics 2021-12-28 Pekka Koskela , Khanh Ngoc Nguyen , Zhuang Wang

Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randi\'c indices for matching, whose values depend on the structure of the tree.…

Combinatorics · Mathematics 2016-02-01 Anirban Banerjee , Ranjit Mehatari

We show that spectral Hausdorff dimensional properties of discrete Schr\"oodinger operators with (1) Sturmian potentials of bounded density and (2) a class of sparse potentials are preserved under suitable polynomial decaying perturbations,…

Mathematical Physics · Physics 2016-04-29 Vanderlea R. Bazao , Silas L. Carvalho , César R. de Oliveira

We first show that a Laplace isospectral family of Riemannian orbifolds, satisfying a lower Ricci curvature bound, contains orbifolds with points of only finitely many isotropy types. If we restrict our attention to orbifolds with only…

Spectral Theory · Mathematics 2009-09-29 Elizabeth Stanhope

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Mathematical Physics · Physics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

Phylogenetic trees are a central tool in understanding evolution. They are typically inferred from sequence data, and capture evolutionary relationships through time. It is essential to be able to compare trees from different data sources…

Populations and Evolution · Quantitative Biology 2017-10-31 Michelle Kendall , Caroline Colijn

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Group Theory · Mathematics 2023-12-07 Tobias Hartnick , Merlin Incerti-Medici

We investigate the eigenvalue density in ensembles of large sparse Bernoulli random matrices. We demonstrate that the fraction of linear subgraphs just below the percolation threshold is about 95\% of all finite subgraphs, and the…

Disordered Systems and Neural Networks · Physics 2016-01-20 V. Avetisov , P. L. Krapivsky , S. Nechaev

In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…

Combinatorics · Mathematics 2024-04-19 Muhammed Alaa Morsy , Mohamed Anwar , Abdallah Aboutahoun

A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and…

Combinatorics · Mathematics 2021-05-11 Louisa Seelbach Benkner , Stephan Wagner

We give a summary on spectral techniques for finite dimensional algebras and study its link to singularity theory. In particular, we offer a contribution to the categorification of the Milnor lattice of two-dimensional singularities through…

Representation Theory · Mathematics 2008-05-08 Helmut Lenzing , Jose Antonio de la Pena

A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…

Metric Geometry · Mathematics 2009-02-23 A. G. Aksoy , M. S. Borman , A. L. Westfahl

Let $T$ be a tree with a given adjacency eigenvalue $\lambda$. In this paper, by using the $\lambda$-minimal trees, we determine the structure of trees with a given multiplicity of the eigenvalue $\lambda$. Furthermore, we consider the…

Combinatorics · Mathematics 2021-01-05 Asghar Bahmani , Dariush Kiani

A {\em tree cover} of a metric space $(X,d)$ is a collection of trees, so that every pair $x,y\in X$ has a low distortion path in one of the trees. If it has the stronger property that every point $x\in X$ has a single tree with low…

Data Structures and Algorithms · Computer Science 2019-05-21 Yair Bartal , Nova Fandina , Ofer Neiman

An array of non-Hermitian optical waveguides can operate as a laser or as a coherent perfect absorber, which corresponds to a spectral singularity of the underlying discrete complex potential. We show that all lattice potentials with…

Optics · Physics 2020-06-18 Dmitry A. Zezyulin , Vladimir V. Konotop

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

Probability · Mathematics 2017-03-29 Pablo Shmerkin , Ville Suomala

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…

Data Structures and Algorithms · Computer Science 2018-10-26 Romain Azaïs , Jean-Baptiste Durand , Christophe Godin

This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…

Combinatorics · Mathematics 2012-09-04 Xiu-Mei Zhang , Xiao-Dong Zhang , Daniel Gray , Hua Wang