Work

The least doubling constant of a path graph

Year: 2024

Type: article

Abstract: We study the least doubling constant CG among all possible doubling measures defined on a path graph G. We consider both finite and infinite cases and show that if G=Z, CZ=3, while for G=Ln the path graph with n vertices, one has 1+2cos(π n+1)≤CLn<3, with equality on the lower bound if and only if n≤8. Moreover, we analyze the structure of doubling minimizers on Ln and Z—those measures whose doubling constant is the smallest possible.

Source: Kyoto journal of mathematics

DOI: 10.1215/21562261-2024-0014

Authors: Estibalitz Durand-Cartagena, Javier Soria, Pedro Tradacete

Institutions: Universidad Complutense de Madrid, Institute of Mathematical Sciences, Consejo Superior de Investigaciones Científicas

Language: English

Topic: Geometric Analysis and Curvature Flows

Subfield: Applied Mathematics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: Universidad Nacional de Educación a Distancia, Agencia Estatal de Investigación