Behaviour of solutions of a fourth-order self-adjoint linear differential equation
Marko Švec (1983)
Annales Polonici Mathematici
Similarity:
Marko Švec (1983)
Annales Polonici Mathematici
Similarity:
R. U. Verma (1971)
Annales Polonici Mathematici
Similarity:
Yūki Naito, Takashi Suzuki (2008)
Colloquium Mathematicae
Similarity:
We consider a system which describes the scaling limit of several chemotaxis systems. We focus on self-similarity, and review some recent results on forward and backward self-similar solutions to the system.
McClure, M., Vallin, R.W. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Hertel, Eike (2000)
Beiträge zur Algebra und Geometrie
Similarity:
R. Kenyon (1996)
Geometric and functional analysis
Similarity:
Rehder, Wulf (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Heydar Radjavi, Ping-Kwan Tam, Kok-Keong Tan (2003)
Studia Mathematica
Similarity:
A characterization of compactness of a given self-adjoint bounded operator A on a separable infinite-dimensional Hilbert space is established in terms of the spectrum of perturbations. An example is presented to show that without separability, the perturbation condition, which is always necessary, is not sufficient. For non-separable spaces, another condition on the self-adjoint operator A, which is necessary and sufficient for the perturbation, is given.
Igudesman, K. (2003)
Lobachevskii Journal of Mathematics
Similarity:
Cowen, Robert (2001)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Stanislav Jendroľ, Brigitte Servatius, Herman Servatius (1997)
Mathematica Slovaca
Similarity:
Bouyukliev, Iliya, Bouyuklieva, Stefka, Dzhumalieva-Stoeva, Maria, Monev, Venelin (2016)
Serdica Journal of Computing
Similarity:
This paper presents developed software in the area of Coding Theory. Using it, all binary self-dual codes with given properties can be classified. The programs have consequent and parallel implementations. ACM Computing Classification System (1998): G.4, E.4.
Simon Baker, Karma Dajani, Kan Jiang (2015)
Fundamenta Mathematicae
Similarity:
Let K ⊆ ℝ be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence, we can show that the set of points with a unique coding is a graph-directed self-similar set in the sense of Mauldin and Williams (1988). The theory of Mauldin and Williams then provides...