In the first part of this dissertation, we give a new definition of a Laplace operator for Finsler metric as an average, with regard to an angle measure, of the second directional derivatives. This operator is elliptic, symmetric with respect to the Holmes-Thompson volume, and coincides with the usual Laplace--Beltrami operator when the Finsler metric is Riemannian. We compute explicit spectral data for some Katok-Ziller metrics. When the Finsler metric is negatively curved, we show, thanks to a result of Ancona that the Martin boundary is Hölder-homeomorphic to the visual boundary. This allow us to deduce the existence of harmonic measures and some ergodic preoperties. In the second part of this dissertation, we study Anosov flows in 3-manifolds, with leaf-spaces homeomorphic to .... When the manifold is hyperbolic, Thurston showed that the (un)stable foliations induces an "orthogonal" flow. We use this second flow to study isotopy class of periodic orbits of the Anosov flow and existence of embedded cylinders.

Analytic solutions to the static and stationary boundary value field problems relative to an arbitrary configuration of parallel cylinders are obtained by using translational addition theorems for scalar Laplacian polar functions, to express the field due to one cylinder in terms of the polar coordinates of the other cylinders such that the boundary conditions can be imposed at all the cylinder surfaces. The constants of integration in the field expressions of all the cylinders are obtained from a truncated infinite matrix equation. Translational addition theorems are available for scalar cylindrical and spherical wave functions but such theorems are not directly available for the general solution of the Laplace equation in polar coordinates. The purpose of deriving these addition theorems and applying them to field problems involving systems of cylinders is to obtain exact analytic solutions with controllable accuracies, thereby, yielding benchmark solutions to validate other approximate numerical methods.

Doctor of Philosophy / We consider the problem of minimising the eigenvalues of the Laplacian with Robin boundary conditions $\frac{\partial u}{\partial \nu} + \alpha u = 0$ and generalised Wentzell boundary conditions $\Delta u + \beta \frac{\partial u}{\partial \nu} + \gamma u = 0$ with respect to the domain $\Omega \subset \mathbb R^N$ on which the problem is defined. For the Robin problem, when $\alpha > 0$ we extend the Faber-Krahn inequality of Daners [Math. Ann. 335 (2006), 767--785], which states that the ball minimises the first eigenvalue, to prove that the minimiser is unique amongst domains of class $C^2$. The method of proof uses a functional of the level sets to estimate the first eigenvalue from below, together with a rearrangement of the ball's eigenfunction onto the domain $\Omega$ and the usual isoperimetric inequality. We then prove that the second eigenvalue attains its minimum only on the disjoint union of two equal balls, and set the proof up so it works for the Robin $p$-Laplacian. For the higher eigenvalues, we show that it is in general impossible for a minimiser to exist independently of $\alpha > 0$. When $\alpha < 0$, we prove that every eigenvalue behaves like $-\alpha^2$ as $\alpha \to -\infty$, provided only that $\Omega$ is bounded with $C^1$ boundary. This generalises a result of Lou and Zhu [Pacific J. Math. 214 (2004), 323--334] for the first eigenvalue. For the Wentzell problem, we (re-)prove general operator properties, including for the less-studied case $\beta < 0$, where the problem is ill-posed in some sense. In particular, we give a new proof of the compactness of the resolvent and the structure of the spectrum, at least if $\partial \Omega$ is smooth. We prove Faber-Krahn-type inequalities in the general case $\beta, \gamma \neq 0$, based on the Robin counterpart, and for the ``best'' case $\beta, \gamma > 0$ establish a type of equivalence property between the Wentzell and Robin minimisers for all eigenvalues. This yields a minimiser of the second Wentzell eigenvalue. We also prove a Cheeger-type inequality for the first eigenvalue in this case.

Doctor of Philosophy / We consider the problem of minimising the eigenvalues of the Laplacian with Robin boundary conditions $\frac{\partial u}{\partial \nu} + \alpha u = 0$ and generalised Wentzell boundary conditions $\Delta u + \beta \frac{\partial u}{\partial \nu} + \gamma u = 0$ with respect to the domain $\Omega \subset \mathbb R^N$ on which the problem is defined. For the Robin problem, when $\alpha > 0$ we extend the Faber-Krahn inequality of Daners [Math. Ann. 335 (2006), 767--785], which states that the ball minimises the first eigenvalue, to prove that the minimiser is unique amongst domains of class $C^2$. The method of proof uses a functional of the level sets to estimate the first eigenvalue from below, together with a rearrangement of the ball's eigenfunction onto the domain $\Omega$ and the usual isoperimetric inequality. We then prove that the second eigenvalue attains its minimum only on the disjoint union of two equal balls, and set the proof up so it works for the Robin $p$-Laplacian. For the higher eigenvalues, we show that it is in general impossible for a minimiser to exist independently of $\alpha > 0$. When $\alpha < 0$, we prove that every eigenvalue behaves like $-\alpha^2$ as $\alpha \to -\infty$, provided only that $\Omega$ is bounded with $C^1$ boundary. This generalises a result of Lou and Zhu [Pacific J. Math. 214 (2004), 323--334] for the first eigenvalue. For the Wentzell problem, we (re-)prove general operator properties, including for the less-studied case $\beta < 0$, where the problem is ill-posed in some sense. In particular, we give a new proof of the compactness of the resolvent and the structure of the spectrum, at least if $\partial \Omega$ is smooth. We prove Faber-Krahn-type inequalities in the general case $\beta, \gamma \neq 0$, based on the Robin counterpart, and for the ``best'' case $\beta, \gamma > 0$ establish a type of equivalence property between the Wentzell and Robin minimisers for all eigenvalues. This yields a minimiser of the second Wentzell eigenvalue. We also prove a Cheeger-type inequality for the first eigenvalue in this case.

Thesis (Doctoral)--Universität Bonn, 1990. / Includes bibliographical references.

Thesis (Ph.D.)--Mississippi State University. Department of Mathematics and Statistics. / Title from title screen. Includes bibliographical references.

Thesis (Ph.D.)--Mississippi State University. Department of Mathematics and Statistics. / Title from title screen. Includes bibliographical references.

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Os métodos espectrais são ferramentas úteis na análise de dados, sendo capazes de fornecer informações sobre a estrutura organizacional de dados. O agrupamento de dados utilizando métodos espectrais é comumente baseado em relações de similaridade definida entre os dados. O objetivo deste trabalho é estudar a capacidade de agrupamento de métodos espectrais e seu comportamento, em casos limites. Considera-se um conjunto de pontos no plano e usa-se a similaridade entre os nós como sendo o inverso da distância Euclidiana. Analisa-se a qual distância mínima, entre dois pontos centrais, o agrupamento espectral é capaz de reagrupar os dados em dois grupos distintos. Acessoriamente, estuda-se a capacidade de reagrupamento caso a dispersão entre os dados seja aumentada. Inicialmente foram realizados experimentos considerando uma distância fixa entre dois pontos, a partir dos quais os dados são gerados e, então, reduziu-se a distância entre estes pontos até que o método se tornasse incapaz de efetuar a separação dos pontos em dois grupos distintos. Em seguida, retomada a distância inicial, os dados foram gerados a partir da adição de uma perturbação normal, com variância crescente, e observou-se até que valor de variância o método fez a separação dos dados em dois grupos distintos de forma correta. A partir de um conjunto de pontos obtidos com a execução do algoritmo de evolução diferencial, para resolver um problema multimodal, testa-se a capacidade do método em separar os indivíduos em grupos diferentes.

Neste trabalho, estudamos a existˆencia e multiplicidade de solu¸c˜oes de certos problemas p-sublineares envolvendo o operador p-laplaciano usando teoria de Morse. / The purpose of this text is to provide a didactic exposition of the paper “Solutions of p-sublinear p-Laplacian equation via Morse theory” by Yuxia Guo and Jiaquan Liu [8]. This paper addresses the existence and multiplicity of solutions for the problem where is a smooth, bounded domain of RN, p is the p-Laplacian operator and f satisfies certain conditions, in particular f is p-sublinear at 0. Morse theory is used to infer the existence of critical points of a functional associated to this problem. In Chapter 2, we introduce the necessary Morse theoretic concepts, assuming basic knowledge of singular homology theory. In Chapter 3, we introduce basic properties of the p-Laplacian operator, assuming knowledge of Sobolev spaces, including imbedding and compactness results. Finally, in Chapter 4, we follow Guo and Liu’s paper itself.

Eigenvectors of the Laplacian of a graph G have received increasing attention in the recent past. Here we investigate their so-called nodal domains, i.e., the connected components of the maximal induced subgraphs of G on which an eigenvector \psi does not change sign. An analogue of Courant's nodal domain theorem provides upper bounds on the number of nodal domains depending on the location of \psi in the spectrum. This bound, however, is not sharp in general. In this contribution we consider the problem of computing minimal and maximal numbers of nodal domains for a particular graph. The class of Boolean Hypercubes is discussed in detail. We find that, despite the simplicity of this graph class, for which complete spectral information is available, the computations are still non-trivial. Nevertheless, we obtained some new results and a number of conjectures. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing