English
Related papers

Related papers: Remarks about Hardy inequalities on metric trees

200 papers

We compute the best constant in functional integral inequality called the Hardy-Leray inequalities for solenoidal vector fields on $\mathbb{R}^N$. This gives a solenoidal improvement of the inequalities whose best constants are known for…

Analysis of PDEs · Mathematics 2023-05-23 Naoki Hamamoto

We prove multipolar Hardy inequalities on complete Riemannian manifolds, providing various curved counterparts of some Euclidean multipolar inequalities due to Cazacu and Zuazua [Improved multipolar Hardy inequalities, 2013]. We notice that…

Analysis of PDEs · Mathematics 2017-08-29 Francesca Faraci , Csaba Farkas , Alexandru Kristály

We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The…

Probability · Mathematics 2009-06-30 Vadim A. Kaimanovich , Florian Sobieczky

We study the fractional Hardy inequality on the integers. We prove the optimality of the Hardy weight and hence affirmatively answer the question of sharpness of the constant.

Analysis of PDEs · Mathematics 2023-07-19 Matthias Keller , Marius Nietschmann

On an infinite, radial metric tree graph we consider the corresponding Laplacian equipped with self-adjoint vertex conditions from a large class including $\delta$- and weighted $\delta'$-couplings. Assuming the numbers of different edge…

Spectral Theory · Mathematics 2017-07-04 Jonathan Rohleder , Christian Seifert

In this paper we prove three differenttypes of the so-called many-particle Hardy inequalities. One of them is a "classical type" which is valid in any dimesnion $d\neq 2$. The second type deals with two-dimensional magnetic Dirichlet forms…

Analysis of PDEs · Mathematics 2014-02-26 M. Hoffmann-Ostenhof , T. Hoffmann-Ostenhof , A. Laptev , J. Tidblom

We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…

Spectral Theory · Mathematics 2019-09-18 Pavel Kurasov , Jonathan Rohleder

The paper is devoted to equipartition of measured information for finite state processes over regular trees whose laws are invariant under all parity preserving tree automorphisms. We show almost everywhere equipartition for ergodic…

Dynamical Systems · Mathematics 2025-11-13 Felix Pogorzelski , Elias Zimmermann

We extend Hardy's inequality from sequences of non-negative numbers to sequences of positive semi-definite operators if the parameter p satisfies 1<p<=2, and to operators under a trace for arbitrary p>1. Applications to trace functions are…

Operator Algebras · Mathematics 2010-01-13 Frank Hansen

We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…

Spectral Theory · Mathematics 2009-11-11 Jonathan Breuer

In this paper, we obtain monotonicity of Steklov eigenvalues on graphs which as a special case on trees extends the results of He-Hua [Calc. Var. Partial Differential Equations 61 (2022), no. 3, Paper No. 101, arXiv: 2103.07696] to higher…

Differential Geometry · Mathematics 2022-05-16 Chengjie Yu , Yingtao Yu

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Combinatorics · Mathematics 2022-12-01 K. V. Chelpanov

A Hardy inequality of the form \[\int_{\tilde{\Omega}} |\nabla f({\bf{x}})|^p d {\bf{x}} \ge (\frac{p-1}{p})^p \int_{\tilde{\Omega}} \{1 + a(\delta, \partial \tilde{\Omega})(\x)\}\frac{|f({\bf{x}})|^p}{\delta({\bf{x}})^p} d{\bf{x}}, \] for…

Spectral Theory · Mathematics 2011-05-27 A. A. Balinsky , W. D. Evans , R. T. Lewis

We prove a strong form of the invariance under re-rooting of the distribution of the continuous random trees called Levy trees. This extends previous results due to several authors.

Probability · Mathematics 2009-02-24 Thomas Duquesne , Jean-Francois Le Gall

We prove several interesting equalities for the integrals of higher order derivatives on the homogeneous groups. As consequences, we obtain the sharp Hardy--Rellich type inequalities for higher order derivatives including both the…

Functional Analysis · Mathematics 2017-08-31 Van Hoang Nguyen

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

Probability · Mathematics 2023-04-11 Christoffer Olsson

We attempt to shed new light on the notion of 'tree-like' metric spaces by focusing on an approach that does not use the four-point condition. Our key question is: Given metric space $M$ on $n$ points, when does a fully labelled…

Combinatorics · Mathematics 2015-12-08 Momoko Hayamizu , Kenji Fukumizu

This paper is devoted to the spectral analysis of the Laplacian with constant magnetic field on a cone of aperture $\alpha$ and Neumann boundary condition. We analyze the influence of the orientation of the magnetic field. In particular,…

Analysis of PDEs · Mathematics 2013-09-11 Virginie Bonnaillie-Noël , Nicolas Raymond

Geometric rigidity states that a gradient field which is $L^p$-close to the set of proper rotations is necessarily $L^p$-close to a fixed rotation, and is one key estimate in nonlinear elasticity. In several applications, as for example in…

Analysis of PDEs · Mathematics 2015-04-29 Sergio Conti , Georg Dolzmann , Stefan Müller

We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…

Data Structures and Algorithms · Computer Science 2015-03-19 Stefan Szeider