Results 41 to 50 of about 1,164,817 (286)

$L^2$-Betti numbers and non-unitarizable groups without free subgroups [PDF]

open access: yes, 2009
We show that there exist non-unitarizable groups without non-abelian free subgroups. Both torsion and torsion free examples are constructed. As a by-product, we show that there exist finitely generated torsion groups with non-vanishing first $L^2$-Betti ...
Osin, D.
core   +1 more source

Personalized Selumetinib Dosing in Pediatric Neurofibromatosis Type 1: Insights From a Pilot Therapeutic Drug Monitoring Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács   +8 more
wiley   +1 more source

Approximation numbers of Sobolev embeddings of radial functions on isotropic manifolds

open access: yesJournal of Function Spaces and Applications, 2007
We regard the compact Sobolev embeddings between Besov and Sobolev spaces of radial functions on noncompact symmetric spaces of rank one. The asymptotic formula for the behaviour of approximation numbers of these embeddings is described.
Leszek Skrzypczak, Bernadeta Tomasz
doaj   +1 more source

Counting algebraic numbers in short intervals with rational points

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2019
In 2012 it was proved that real algebraic numbers follow a non­uniform but regular distribution, where the respective definitions go back to H. Weyl (1916) and A. Baker and W. Schmidt (1970).
Vasily I. Bernik   +2 more
doaj   +1 more source

Free Energy Approximations for CSMA networks

open access: yes, 2017
In this paper we study how to estimate the back-off rates in an idealized CSMA network consisting of $n$ links to achieve a given throughput vector using free energy approximations.
Van Houdt, Benny
core   +1 more source

A spectral radius type formula for approximation numbers of composition operators [PDF]

open access: yes, 2014
For approximation numbers $a_n (C_\phi)$ of composition operators $C_\phi$ on weighted analytic Hilbert spaces, including the Hardy, Bergman and Dirichlet cases, with symbol $\phi$ of uniform norm $< 1$, we prove that $\lim_{n \to \infty} [a_n (C_\phi)]^{
Li, Daniel   +2 more
core   +3 more sources

ON BADLY APPROXIMABLE COMPLEX NUMBERS [PDF]

open access: yesGlasgow Mathematical Journal, 2010
AbstractWe show that the set of complex numbers which are badly approximable by ratios of elements of the ring of integers in $\(\mathbb{Q}(\sqrt{-D})\)$, where D ∈ {1, 2, 3, 7, 11, 19, 43, 67, 163} has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension.
Esdahl-Schou, Rune, Kristensen, S.
openaire   +3 more sources

Adherence to Protocol Recommendations for Children With Wilms Tumour in Two Consecutive Studies in the United Kingdom and Ireland—Does Variation Matter?

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background and Aims Wilms tumour (WT) has excellent event‐free and overall survival (OS). However, small differences exist between countries participating in the same international study. This led us to examine variation in adherence to protocol recommendations as a potential contributing factor.
Suzanne Tugnait   +23 more
wiley   +1 more source

L2-determinant class and approximation of L2-Betti numbers

open access: yes, 2011
A standing conjecture in L2-cohomology is that every finite CW-complex X is of L2-determinant class. In this paper, we prove this whenever the fundamental group belongs to a large class of groups containing e.g. all extensions of residually finite groups
Schick, Thomas
core   +1 more source

Approximating the rectilinear crossing number

open access: yesComputational Geometry, 2016
A straight-line drawing of a graph $G$ is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph $G$, $\overline{cr}(G)$, is the minimum number of crossing edges in any straight-line drawing of $G$. Determining or estimating
Fox, Jacob, Pach, János, Suk, Andrew
openaire   +5 more sources

Home - About - Disclaimer - Privacy