|
Trudy Moskovskogo Matematicheskogo Obshchestva, 2019, Volume 80, Issue 2, Pages 147–156
(Mi mmo626)
|
|
|
|
The finiteness of the spectrum of boundary value problems defined on a geometric graph
V. A. Sadovnichiia, Ya. T. Sultanaevb, A. M. Akhtyamovcd a Lomonosov Moscow State University, Moscow, Russia 119234
b Bashkir State Pedagogical University n. a. M. Akmulla, Ufa, Russia
c Bashkir State University, Ufa, Russia
d Mavlyutov Institute of Mechanics, Ufa Investigation Center R.A.S., Ufa, Russia
Abstract:
We consider boundary value problems on a geometric graph with a polynomial occurrence of spectral parameter in the differential equation. It has previously been shown (see A. M. Akhtyamov [Differ. Equ.55 (2019), no. 1, pp. 142-144]) that a boundary value problem for one differential equation whose characteristic equation has simple roots cannot have a finite spectrum, and a boundary value problem for one differential equation can have any given finite spectrum when the characteristic polynomial has multiple roots. In this paper, we obtain a similar result for differential equations defined on a geometric graph. We show that a boundary value problem on a geometric graph cannot have a finite spectrum if all its characteristic equations have simple roots, and a boundary value problem has a finite spectrum if at least one characteristic equation has multiple roots. We also give results showing that a boundary value problem can have any given finite spectrum.
Key words and phrases:
Boundary value problem on a geometric graph, characteristic equation, finite spectrum.
Received: 12.04.2019
Citation:
V. A. Sadovnichii, Ya. T. Sultanaev, A. M. Akhtyamov, “The finiteness of the spectrum of boundary value problems defined on a geometric graph”, Tr. Mosk. Mat. Obs., 80, no. 2, MCCME, M., 2019, 147–156; Trans. Moscow Math. Soc., 80 (2019), 123–131
Linking options:
https://www.mathnet.ru/eng/mmo626 https://www.mathnet.ru/eng/mmo/v80/i2/p147
|
Statistics & downloads: |
Abstract page: | 274 | Full-text PDF : | 109 | References: | 32 | First page: | 25 |
|