نتایج جستجو برای: thron

تعداد نتایج: 38  

Journal: :Mitteilungen des Instituts für Österreichische Geschichtsforschung 1885

2003
M. Sanchez W. W. M. Allison G. J. Alner D. S. Ayres W. L. Barrett P. M. Border J. H. Cobb D. J. A. Cockerill H. Courant D. M. Demuth T. H. Fields H. R. Gallagher M. C. Goodman T. Joffe-Minor T. Kafka S. M. S. Kasahara P. J. Litchfield W. A. Mann M. L. Marshak R. H. Milburn W. H. Miller L. Mualem J. K. Nelson A. Napier W. P. Oliver G. F. Pearce E. A. Peterson D. A. Petyt K. Ruddick J. Schneps A. Sousa B. Speakman J. L. Thron

M. Sanchez, W. W. M. Allison, G. J. Alner, D. S. Ayres, W. L. Barrett, P. M. Border, J. H. Cobb, D. J. A. Cockerill, H. Courant, D. M. Demuth, T. H. Fields, H. R. Gallagher, M. C. Goodman, T. Joffe-Minor, T. Kafka, S. M. S. Kasahara, P. J. Litchfield, W. A. Mann, M. L. Marshak, R. H. Milburn, W. H. Miller, L. Mualem, J. K. Nelson, A. Napier, W. P. Oliver, G. F. Pearce, E. A. Peterson, D. A. Pet...

Journal: :CoRR 2018
Louis Esperet Ross J. Kang Stéphan Thomassé

We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this restriction, we call separation choosability. We show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. This...

Journal: :AJNR. American journal of neuroradiology 1989
M Schumacher K Kutluk D Ott

Different angiographic techniques (e.g., multiple oblique views, angiotomography, and magnification angiography) have been proposed to improve the diagnosis of cerebral vascular malformations and occlusive diseases. However, these methods are either time-consuming or necessitate repeated injections of contrast medium. The common goals of all these techniques are (1) to achieve a documentation o...

2007
W. J. Thron

concept of nearness (contiguity, proximity) between families of sets (finite families, pairs). Again F. Riesz in 1908 was the first to explore this path by defining a "Verkettung" between pairs of sets. He did not require A n B ~ ¢ ~ A is "near" B. Today one generally makes this assumption and thus obtains c (A) = [x: [x] is "near" A]. The assumptions CI , C2 , C3 follow from requirements usual...

Journal: :Electronic Journal of Combinatorics 2021

We study the triangular array defined by Graham–Knuth–Patashnik recurrence $T(n,k) = (\alpha n + \beta k \gamma)\, T(n-1,k)+(\alpha' \beta' \gamma') \, T(n-1,k-1)$ with initial condition $T(0,k) \delta_{k0}$ and parameters $\mathbf{\mu} (\alpha,\beta,\gamma, \alpha',\beta',\gamma')$. show that family of arrays $T(\mathbf{\mu})$ is invariant under a 48-element discrete group isomorphic to $S_3 \...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید