نتایج جستجو برای: saks property

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

Journal: :Journal of Mathematical Analysis and Applications 1994

2009
VATAN KARAKAYA

In summability theory, de la Vallée-Poussin’s mean is first used to define the (V, λ)-summability by Leindler [9]. Malkowsky and Savaş [14] introduced and studied some sequence spaces which arise from the notion of generalized de la ValléePoussin mean. Also the (V, λ)-summable sequence spaces have been studied by many authors including [6] and [20]. Recently, there has been a lot of interest in...

2007
THEO WALLIMANN Gajja S. Salomons

The appearance in print of the present volume of the “Subcellular Biochemistry” Series entitled “Creatine and Creatine Kinase in Health and Disease”, edited by Gajja S. Salomons and Markus Wyss, seems entirely timely. The importance and physiological significance of creatine kinase (CK) as well as the pleiotropic effects of creatine (Cr) and phosphocreatine (PCr) in health and disease have been...

Journal: :SIAM J. Discrete Math. 2010
Arnab Bhattacharyya Elena Grigorescu Madhav Jha Kyomin Jung Sofya Raskhodnikova David P. Woodruff

Given a directed graph G = (V,E) and an integer k ≥ 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. Transitive-closure spanners are a common abstraction for applications in access control, property testing and data structures. We show a connection between 2-TC-spanners and local monoton...

2013
Qimeng Mu Tao Hu Jingkai Yu

PEGylation is a successful approach to improve potency of a therapeutic protein. The improved therapeutic potency is mainly due to the steric shielding effect of PEG. However, the underlying mechanism of this effect on the protein is not well understood, especially on the protein interaction with its high molecular weight substrate or receptor. Here, experimental study and molecular dynamics si...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2015
Sagnik Mukhopadhyay Swagato Sanyal

We show that there exists a Boolean function F which gives the following separations among deterministic query complexity (D(F )), randomized zero error query complexity (R0(F )) and randomized one-sided error query complexity (R1(F )): R1(F ) = Õ( √ D(F )) and R0(F ) = Õ(D(F ))3/4. This refutes the conjecture made by Saks and Wigderson that for any Boolean function f , R0(f) = Ω(D(f))0.753... ...

Journal: :Combinatorial theory 2023

The Kahn--Saks inequality is a classical result on the number of linear extensions finite posets. We give new proof this for posets width two using explicit injections lattice paths. As consequence we obtain $q$-analogue, multivariate generalization and an equality condition in case. also discuss conditions general prove several implications between conjectured to be equivalent.

Journal: :Bulletin of the American Mathematical Society 1934

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

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