نتایج جستجو برای: complex laplacian

تعداد نتایج: 795766  

2001
M. SPREAFICO

A Hermite type formula is introduced and used to study the zeta function over the real and complex n-projective space. This approach allows to compute the residua at the poles and the value at the origin as well as the value of the derivative at the origin, that gives the regularized determinant of the associated Laplacian operator.

2008
FABIO NICOLA

We study the local solvability problem for a class of semilinear equations whose linear part is the Kohn Laplacian, acting on top degree forms. We also study the validity of the Poincaré lemma, in top degree, for semilinear perturbations of the tangential Cauchy-Riemann complex.

2008
ANNALISA BALDI BRUNO FRANCHI NICOLETTA TCHOU MARIA CARLA TESI

In this paper we prove a compensated compactness theorem for differential forms of the intrinsic complex of a Carnot group. The proof relies on a L–Hodge decomposition for these forms. Because of the lack of homogeneity of the intrinsic exterior differential, Hodge decomposition is proved using the parametrix of a suitable 0order Laplacian on forms.

2008
Nikos. I. Karachalios

Using the improved lower bound on the sum of the eigenvalues of the Dirichlet Laplacian proved by A. D. Melas (Proc. Amer. Math. Soc. 131 (2003) 631-636), we report a new and sharp estimate for the dimension of the global attractor associated to the complex Ginzburg-Landau equation supplemented with Dirichlet boundary conditions.

2013
GUANGLONG YU SHUGUANG GUO MEILING XU

For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.

2017
Guanglong Yu Shuguang Guo Meiling Xu GUANGLONG YU SHUGUANG GUO MEILING XU

For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.

Journal: :Electr. J. Comb. 2009
Yanqing Chen Ligong Wang

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.

Journal: :Communications in Nonlinear Science and Numerical Simulation 2023

Fractional differential equations have become a fundamental modelling approach for understanding and simulating the many aspects of non-locality spatial heterogeneity complex materials systems. Yet, while real-order fractional operators are nowadays widely adopted, little progress has been made in extending such to complex-order counterparts. In this work, we introduce new definitions Laplacian...

Journal: :bulletin of the iranian mathematical society 2011
a. heydari n. boroojerdian e. peyghan

recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. using this machinery, we have defined the concept of symmetric curvature. this concept is natural and is related to the notions divergence and laplacian of vector fields. this concept is also related to the derivations on the algebra of symmetric forms which has been discus...

Journal: :CoRR 2017
Shota Saito Danilo P. Mandic Hideyuki Suzuki

The graph Laplacian plays key roles in information processing of relational data, and has analogies with the Laplacian in differential geometry. In this paper, we generalize the analogy between graph Laplacian and differential geometry to the hypergraph setting, and propose a novel hypergraph pLaplacian. Unlike the existing two-node graph Laplacians, this generalization makes it possible to ana...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید