اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStatistical properties of eigenvalues of Laplace-Beltrami operators
67
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the eigenvalues of a Laplace-Beltrami operator defined on the set of the symmetric polynomials, where the eigenvalues are expressed in terms of partitions of integers. By assigning partitions with the restricted uniform measure, the restricted Jack measure, the uniform measure or the Plancherel measure, we prove that the global distribution of the eigenvalues is asymptotically a new distribution $mu$, the Gamma distribution, the Gumbel distribution and the Tracy-Widom distribution, respectively. An explicit representation of $mu$ is obtained by a function of independent random variables. We also derive an independent result on random partitions itself: a law of large numbers for the restricted uniform measure. Two open problems are also asked.
قيم البحث
اقرأ أيضاً
The discrete Laplace operator on a triangulated polyhedral surface is related to geometric properties of the surface. This paper studies extremum problems for eigenvalues of the discrete Laplace operators. Among all triangles, an equilateral triangle
has the maximal first positive eigenvalue. Among all cyclic quadrilateral, a square has the maximal first positive eigenvalue. Among all cyclic $n$-gons, a regular one has the minimal value of the sum of all nontrivial eigenvalues and the minimal value of the product of all nontrivial eigenvalues.
Elliptic partial differential equations on surfaces play an essential role in geometry, relativity theory, phase transitions, materials science, image processing, and other applications. They are typically governed by the Laplace-Beltrami operator. W
e present and analyze approximations by Surface Finite Element Methods (SFEM) of the Laplace-Beltrami eigenvalue problem. As for SFEM for source problems, spectral approximation is challenged by two sources of errors: the geometric consistency error due to the approximation of the surface and the Galerkin error corresponding to finite element resolution of eigenfunctions. We show that these two error sources interact for eigenfunction approximations as for the source problem. The situation is different for eigenvalues, where a novel situation occurs for the geometric consistency error: The degree of the geometric error depends on the choice of interpolation points used to construct the approximate surface. Thus the geometric consistency term can sometimes be made to converge faster than in the eigenfunction case through a judicious choice of interpolation points.
For free boundary problems on Euclidean spaces, the monotonicity formulas of Alt-Caffarelli-Friedman and Caffarelli-Jerison-Kenig are cornerstones for the regularity theory as well as the existence theory. In this article we establish the analogs of
these results for the Laplace-Beltrami operator on Riemannian manifolds. As an application we show that our monotonicity theorems can be employed to prove the Lipschitz continuity for the solutions of a general class of two-phase free boundary problems on Riemannian manifolds.
It is natural to investigate if the quantization of an integrable or superintegrable classical Hamiltonian systems is still integrable or superintegrable. We study here this problem in the case of natural Hamiltonians with constants of motion quadrat
ic in the momenta. The procedure of quantization here considered, transforms the Hamiltonian into the Laplace-Beltrami operator plus a scalar potential. In order to transform the constants of motion into symmetry operators of the quantum Hamiltonian, additional scalar potentials, known as quantum corrections, must be introduced, depending on the Riemannian structure of the manifold. We give here a complete geometric characterization of the quantum corrections necessary for the case considered. Stackel systems are studied in particular details. Examples in conformally and non-conformally flat manifolds are given.
Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical properties,
many combinatorial questions concerning them remain intractable. In this paper, we show that endowing these networks with a biologically relevant ranking structure yields mathematically tractable objects, which we term ranked tree-child networks (RTCNs). We explain how to derive exact and explicit combinatorial results concerning the enumeration and generation of these networks. We also explore probabilistic questions concerning the properties of RTCNs when they are sampled uniformly at random. These questions include the lengths of random walks between the root and leaves (both from the root to the leaves and from a leaf to the root); the distribution of the number of cherries in the network; and sampling RTCNs conditional on displaying a given tree. We also formulate a conjecture regarding the scaling limit of the process that counts the number of lineages in the ancestry of a leaf. The main idea in this paper, namely using ranking as a way to achieve combinatorial tractability, may also extend to other classes of networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
