نتایج جستجو برای: rogers contraction

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

2007
S. Barry Cooper Barry Cooper

Of course, a paper does not have to prove significant new results to have an important influence on the direction of a subject. And this is particularly apparent in regard to the paper of Hartley Rogers [1967a] based on his talk to the 1965 Tenth Logic Colloquium in Leicester, England. As Rogers states in his introduction to the paper “I shall be more concerned with presenting certain open prob...

Journal: :The American Surgeon 2020

Journal: :Advances in Mathematics 1989

Journal: :JAMA: The Journal of the American Medical Association 1895

Journal: :J. Symb. Comput. 2009
James McLaughlin Andrew V. Sills Peter Zimmer

We describe three computer searches (in PARI/GP, Maple, and Mathematica, respectively) which led to the discovery of a number of identities of Rogers-Ramanujan type and identities of false theta functions.

Journal: :Journal of Investigative Dermatology 1978

Journal: :Journal of Cell Science 2022

ABSTRACT First Person is a series of interviews with the first authors selection papers published in Journal Cell Science, helping researchers promote themselves alongside their papers. Madison Rogers author on ‘ PDGFR dimer-specific activation, trafficking and downstream signaling dynamics’, JCS. PhD student lab Dr Katherine A. Fantauzzo at University Colorado Anschutz Medical Campus, Aurora, ...

2011
Patrick D. Wolf

Ultrasound Catheter Transducers for Intracranial Brain Imaging and Therapy by Carl Dean Herickhoff Department of Biomedical Engineering Duke University Date:_______________________ Approved: ___________________________ Stephen W. Smith, Supervisor ___________________________ Richard B. Fair ___________________________ Gerald A. Grant ___________________________ Kathryn R. Nightingale __________...

Journal: :SIAM J. Discrete Math. 2006
Etienne de Klerk John Maharry Dmitrii V. Pasechnik R. Bruce Richter Gelasio Salazar

It has long been conjectured that the crossing number cr(Km,n) of the complete bipartite graph Km,n is equal to Z(m,n) := bm−1 2 cb2 cbn−1 2 cb2 c. Another long-standing conjecture is that the crossing number cr(Kn) of the complete graph Kn is equal to Z(n) := 4b2 cbn−1 2 cbn−2 2 cbn−3 2 c. In this talk, I will outline a new method that improves the asymptotic lower bounds to 0.83Z(m, n) and 0....

Journal: :Journal of Combinatorial Theory, Series A 1981

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

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