Stieltjes vectors and cosine functions generators
Ioana Cioranescu, Urlich Neumann (1987)
Studia Mathematica
Similarity:
Displaying similar documents to “Strongly continuous integrated C-cosine operator functions”
Stieltjes vectors and cosine functions generators
On coerciveness in Besov spaces for abstract parabolic equations of higher order
Yoshitaka Yamamoto (1999)
Studia Mathematica
Similarity:
We are concerned with a relation between parabolicity and coerciveness in Besov spaces for a higher order linear evolution equation in a Banach space. As proved in a preceding work, a higher order linear evolution equation enjoys coerciveness in Besov spaces under a certain parabolicity condition adopted and studied by several authors. We show that for a higher order linear evolution equation coerciveness in Besov spaces forces the parabolicity of the equation. We thus conclude that...
Limit semigroups of Stancu-Mühlbach operators associated with positive projections
Michele Campiti (1992)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
On certain reflexion principes
Miles, E.P. jr., Young, Eutiquio C. (1969)
Portugaliae mathematica
Similarity:
Volterra integrodifferential equations of parabolic type of higher order in time in spaces
Davide Guidetti (2000)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Stirling Operators.
L. Carlitz, S. Klamkin (1974)
Collectanea Mathematica
Similarity:
On the Abel-Type Series
Josef Kaucký (1968)
Matematický časopis
Similarity:
Self-Avoiding Walks in the Plane Несамопресичащи се разходки в равнината
Dangovski, Rumen, Petrova, Kalina (2012)
Union of Bulgarian Mathematicians
Similarity:
Румен Руменов Данговски, Калина Христова Петрова - Разглеждаме броя на несамопресичащите се разходки с фиксирана дължина върху целочислената решетка. Завършваме анализа върху случая за лента, с дължина едно. Чрез комбинаторни аргументи получаваме точна формула за броя на разходките върху лента, ограничена отляво и отдясно. Формулата я изследваме и асимптотично. We examine the number of self-avoiding walks with a fixed length on the square grid graph and more specifically...