Results 41 to 50 of about 249,760 (328)
Discrete Magnetic Laplacian [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
While progress has been made in design optimization of concentric ring electrodes maximizing the accuracy of the surface Laplacian estimation, it was based exclusively on the negligible dimensions model of the electrode.
Oleksandr Makeyev +5 more
doaj +1 more source
14 pages; this version is considerably ...
MUSINA, Roberta, Nazarov A. I.
openaire +3 more sources
On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph [PDF]
The authors prove a number of formulas on the characteristic polynomials of the Laplacian, signless Laplacian and normalized Laplacian matrices of graphs. The use of these formulas is exemplified in constructions of graphs cospectral with respect to the appropriate matrix.
Guo, Ji-Ming, Li, Jianxi, Shiu, Wai Chee
openaire +1 more source
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
In this article, we associate a Hermitian matrix to a multidigraph G. We call it the complex Laplacian matrix of G and denote it by [Formula: see text]. It is shown that the complex Laplacian matrix is a generalization of the Laplacian matrix of a graph.
Sasmita Barik +2 more
doaj +1 more source
Overdetermined boundary value problems for the $\infty$-Laplacian
We consider overdetermined boundary value problems for the $\infty$-Laplacian in a domain $\Omega$ of $\R^n$ and discuss what kind of implications on the geometry of $\Omega$ the existence of a solution may have.
Buttazzo, G., Kawohl, B.
core +2 more sources
Inequalities between Dirichlet and Neumann eigenvalues on the Heisenberg group [PDF]
We prove that for any domain in the Heisenberg group the (k+1)'th Neumann eigenvalue of the sub-Laplacian is strictly less than the k'th Dirichlet eigenvalue.
Frank, Rupert L., Laptev, Ari
core +2 more sources
Cospectral constructions for several graph matrices using cousin vertices
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
The Bayesian-Laplacian Brain [PDF]
AbstractWe outline what we believe could be an improvement in future discussions of the brain acting as a Bayesian-Laplacian system. We do so by distinguishing between two broad classes of priors on which the brain’s inferential systems operate: in one category are biological priors (β priors) and in the other artifactual ones (α priors).
Semir Zeki, Oliver Y. Chén
openaire +3 more sources
The second immanant of some combinatorial matrices [PDF]
Let $A = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrix where $n geq 2$. Let $dt(A)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$.
R. B. Bapat +1 more
doaj

