scholarly journals On the Exact Constant in the Jackson–Stechkin Inequality for the Uniform Metric

2009 ◽  
Vol 29 (2) ◽  
pp. 157-179 ◽  
Author(s):  
S. Foucart ◽  
Y. Kryakin ◽  
A. Shadrin
Keyword(s):  
1994 ◽  
Vol 12 (4) ◽  
pp. 387-398 ◽  
Author(s):  
I. Bárány ◽  
A. Heppes
Keyword(s):  

2001 ◽  
Vol 10 (01) ◽  
pp. 107-113 ◽  
Author(s):  
LUIS P. CHIMENTO ◽  
ALEJANDRO S. JAKUBI

We have found exact constant solutions for the cosmological density parameter using a generalization of general relativity that incorporates a cosmic time-variation of the velocity of light in vacuum and the Newtonian gravitation constant. We have determined the conditions when these solutions are attractors for an expanding universe and solved the problems of the Standard Big Bang model for perfect fluids.


1972 ◽  
Vol 24 (5) ◽  
pp. 905-914
Author(s):  
Tetsuo Kodama

Let K be a field of characteristic p > 0 and let A be a separably generated algebraic function field of one variable with K as its exact constant field. Throughout this paper we shall use the following notations to classify differentials of A/K:D(A) : the K-module of all differentials,G(A) : the K-module of all differentials of the first kind,R(A) : the K-module of all residue free differentials in the sense of Chevalley [2, p. 48],E*(A) : the K-module of all pseudo-exact differentials in the sense of Lamprecht [7, p. 363], (compare the definition with our Lemma 8).


2019 ◽  
Vol 28 (06) ◽  
pp. 936-960
Author(s):  
Andrew J. Uzzell

AbstractIn r-neighbour bootstrap percolation on the vertex set of a graph G, a set A of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least r previously infected neighbours. When the elements of A are chosen independently with some probability p, it is natural to study the critical probability pc(G, r) at which it becomes likely that all of V(G) will eventually become infected. Improving a result of Balogh, Bollobás and Morris, we give a bound on the second term in the expansion of the critical probability when G = [n]d and d ⩾ r ⩾ 2. We show that for all d ⩾ r ⩾ 2 there exists a constant cd,r > 0 such that if n is sufficiently large, then $$p_c (\left[ n \right]^d ,{\rm{ }}r){\rm{\le }}\left( {\frac{{\lambda (d,r)}}{{\log _{(r - 1)} (n)}} - \frac{{c_{d,r} }}{{(\log _{(r - 1)} (n))^{3/2} }}} \right)^{d - r + 1} ,$$where λ(d, r) is an exact constant and log(k) (n) denotes the k-times iterated natural logarithm of n.


2013 ◽  
Vol 60 (11) ◽  
pp. 4920-4929 ◽  
Author(s):  
Angel Borrell ◽  
Miguel Castilla ◽  
Jaume Miret ◽  
Jose Matas ◽  
Luis Garcia de Vicuna

Sign in / Sign up

Export Citation Format

Share Document