Results 41 to 50 of about 976,099 (318)
The structure of the semigroup of proper holomorphic mappings of a planar domain to the unit disc
Given a bounded n-connected domain in the plane bounded by non-intersecting Jordan curves, and given one point on each boundary curve, L. Bieberbach proved that there exists a proper holomorphic mapping of the domain onto the unit disc that is an n-to ...
Bell, Steven R., Kaleem, Faisal
core +3 more sources
ABSTRACT Introduction We developed MedSupport, a multilevel medication adherence intervention designed to address root barriers to medication adherence. This study sought to explore the feasibility and acceptability of the MedSupport intervention strategies to support a future full‐scale randomized controlled trial.
Elizabeth G. Bouchard +8 more
wiley +1 more source
Local n-connectivity and approximate lifting
AbstractThis paper proves that if p:E→Y is an approximate fibration where E is a locally compact separable metric ANR, each point inverse is an FANR, and Y is finite dimensional, then Y is an ANR.
Coram, D.S., Duvall, P.F.
openaire +1 more source
Homotopy groups of generic leaves of logarithmic foliations [PDF]
We study the homotopy groups of generic leaves of logarithmic foliations on complex projective manifolds. We exhibit a relation between the homotopy groups of a generic leaf and of the complement of the polar divisor of the logarithmic foliation.Comment:
Rodríguez-Guzmán, Diego
core +3 more sources
ABSTRACT Background Despite their increased risk for functional impairment resulting from cancer and its treatments, few adolescents and young adults (AYAs) with a hematological malignancy receive the recommended or therapeutic dose of exercise per week during inpatient hospitalizations.
Jennifer A. Kelleher +8 more
wiley +1 more source
Rainbow Connection In Sparse Graphs
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours
Kemnitz Arnfried +3 more
doaj +1 more source
The Property of Hamiltonian Connectedness in Toeplitz Graphs
A spanning path in a graph G is called a Hamiltonian path. To determine which graphs possess such paths is an NP-complete problem. A graph G is called Hamiltonian-connected if any two vertices of G are connected by a Hamiltonian path.
Ayesha Shabbir +2 more
doaj +1 more source
Homological stability for moduli spaces of high dimensional manifolds. II [PDF]
We prove a homological stability theorem for moduli spaces of manifolds of dimension $2n$, for attaching handles of index at least $n$, after these manifolds have been stabilised by countably many copies of $S^n \times S^n$. Combined with previous work
Galatius, Soren, Randal-Williams, Oscar
core +3 more sources
ABSTRACT Background B‐cell lymphoblastic lymphoma (B‐LBL) represents a rare variety of non‐Hodgkin lymphoma, with limited research on its biology, progression, and management. Methods A retrospective analysis was performed on the clinical characteristics of 256 patients aged ≤18 years who received treatment under the China Net Childhood Lymphoma (CNCL)‐
Zhijuan Liu +20 more
wiley +1 more source
The Arf-Kervaire invariant of framed manifolds as an obstruction to embeddability
We prove that no 14-connected (resp. 30-connected) stably parallelizable manifold N^30 (resp. N^62) of dimension 30 (resp. 62) with the Arf-Kervaire invariant 1 can be smoothly embedded into R^36 (resp. R^83).
Peter M. Akhmetiev +2 more
doaj +1 more source

