Lower bound for the number of critical points of minimal spectral k-partitions for k large

被引:0
|
作者
Helffer B. [1 ,2 ]
机构
[1] Laboratoire de mathématique, Univ Paris-Sud, CNRS, Université Paris-Saclay, Bâtiment 425, Orsay Cedex
[2] Laboratoire de Mathématiques Jean Leray, Université de Nantes, Nantes
关键词
Aharonov-Bohm; Laplacian; Minimal partitions; Spectral theory;
D O I
10.1007/s40316-016-0058-6
中图分类号
学科分类号
摘要
In a recent paper with Thomas Hoffmann-Ostenhof, we proved that the number of critical points ℓk in the boundary set of a minimal k-partition tends to + ∞ as k→ + ∞. In this note, we show that ℓk increases linearly with k as suggested by a hexagonal conjecture about the asymptotic behavior of the energy of these minimal partitions. As in the original proof by Pleijel of his celebrated theorem, this involves Faber-Krahn’s inequality and Weyl’s formula, but this time, due to the magnetic characterization of the minimal partitions, we have to establish a Weyl’s formula for Aharonov-Bohm operator controlled with respect to a k-dependent number of poles. In a recent paper with Thomas Hoffmann-Ostenhof, we proved that the number of critical points ℓk in the boundary set of a k-minimal partition tends to + ∞ as k→ + ∞. In this note, we show that ℓk increases linearly with k as suggested by a hexagonal conjecture about the asymptotic behavior of the energy of these minimal partitions. As the original proof by Pleijel, this involves Faber-Krahn’s inequality and Weyl’s formula, but this time, due to the magnetic characterization of the minimal partitions, we have to establish a Weyl’s formula for Aharonov-Bohm operator controlled with respect to a k-dependent number of poles. © 2016, Fondation Carl-Herz and Springer International Publishing Switzerland.
引用
收藏
页码:111 / 118
页数:7
相关论文
共 50 条
  • [21] Note on the Number of Ordered k-Partitions of Multiset Md[n] with Equal Sums
    He, Xiaoyang
    Lv, Jian-Bo
    Zhou, Nian Hong
    MEDITERRANEAN JOURNAL OF MATHEMATICS, 2023, 20 (04)
  • [22] Smallest Set-Transversals of k-Partitions
    Csilla Bujtás
    Zsolt Tuza
    Graphs and Combinatorics, 2009, 25 : 807 - 816
  • [23] VERTEX K-PARTITIONS OF CERTAIN INFINITE GRAPHS
    CENZER, D
    HOWORKA, E
    DISCRETE MATHEMATICS, 1978, 23 (02) : 105 - 113
  • [24] Hierarchies of Δ02-measurable k-partitions
    Selivanov, Victor L.
    MATHEMATICAL LOGIC QUARTERLY, 2007, 53 (4-5) : 446 - 461
  • [25] Smallest Set-Transversals of k-Partitions
    Bujtas, Csilla
    Tuza, Zsolt
    GRAPHS AND COMBINATORICS, 2009, 25 (06) : 807 - 816
  • [26] A Multilevel Memetic Approach for Improving Graph k-Partitions
    Benlic, Una
    Hao, Jin-Kao
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (05) : 624 - 642
  • [27] An extended lower bound on the number of (≤k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn
    Abrego, B. M.
    Balogh, J.
    Fernandez-Merchant, S.
    Leanos, J.
    Salazar, G.
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2008, 115 (07) : 1257 - 1264
  • [28] Bernoulli convolutions and an intermediate value theorem for entropies of K-partitions
    Lindenstrauss, E
    Peres, Y
    Schlag, W
    JOURNAL D ANALYSE MATHEMATIQUE, 2002, 87 (1): : 337 - 367
  • [29] Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions
    Podolskii, Vladimir
    Selivanov, Victor
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
  • [30] An application of a way of generating fuzzy k-partitions to fuzzy clustering
    Murai, T
    Kitada, A
    Sato, Y
    PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2, 1998, : 1267 - 1270