Supremum and infimum of subharmonic functions of order between 1 and 2

2011 ◽  
Vol 54 (3) ◽  
pp. 685-693
Author(s):  
P. C. Fenton

AbstractFor functions u, subharmonic in the plane, letand let N(r,u) be the integrated counting function. Suppose that $\mathcal{N}\colon[0,\infty)\rightarrow\mathbb{R}$ is a non-negative non-decreasing convex function of log r for which $\mathcal{N}(r)=0$ for all small r and $\limsup_{r\to\infty}\log\mathcal{N}(r)/\4\log r=\rho$, where 1 < ρ < 2, and defineA sharp upper bound is obtained for $\liminf_{r\to\infty}\mathcal{B}(r,\mathcal{N})/\mathcal{N}(r)$ and a sharp lower bound is obtained for $\limsup_{r\to\infty}\mathcal{A}(r,\mathcal{N})/\mathcal{N}(r)$.

Author(s):  
E. S. Barnes

Letbe n linear forms with real coefficients and determinant Δ = ∥ aij∥ ≠ 0; and denote by M(X) the lower bound of | X1X2 … Xn| over all integer sets (u) ≠ (0). It is well known that γn, the upper bound of M(X)/|Δ| over all sets of forms Xi, is finite, and the value of γn has been determined when n = 2 and n = 3.


1970 ◽  
Vol 22 (3) ◽  
pp. 569-581 ◽  
Author(s):  
S. K. Thomason

In this paper we shall prove that every finite lattice is isomorphic to a sublattice of the degrees of unsolvability, and that every one of a certain class of finite lattices is isomorphic to an initial segment of degrees.Acknowledgment. I am grateful to Ralph McKenzie for his assistance in matters of lattice theory.1. Representation of lattices. The equivalence lattice of the set S consists of all equivalence relations on S, ordered by setting θ ≦ θ’ if for all a and b in S, a θ b ⇒ a θ’ b. The least upper bound and greatest lower bound in are given by the ⋃ and ⋂ operations:


Author(s):  
W. K Hayman ◽  
E. L Ortiz

SYNOPSISLetbe Hermite's function of order λ and let h = h(λ) be the largest real zero of Hλ(t). SetIn this paper we establish the inequalitywhereEquality holds for S = ½. The result is also fairly accurate as S→0 and S→1. The proof is analytical except in the ranges −1·1 ≦ h ≦ −0·1 and where the argument is concluded by means of a computer.The following deduction is made elsewhere [2, Theorem A]. If u(x) is subharmonic in Rm(m ≧ 2) and the set E where u(x) > 0 has at least k components, where k ≧ 2, then the order ρ of u(x) is at least ϕ(1/k). In particular, if ρ < 1, E is connected. This result fails for ρ = 1.


Author(s):  
Fazal Hayat

The first multiplicative Zagreb index [Formula: see text] of a graph [Formula: see text] is the product of the square of every vertex degree, while the second multiplicative Zagreb index [Formula: see text] is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for [Formula: see text] and upper bound for [Formula: see text] of trees with given distance [Formula: see text]-domination number, and characterize those trees attaining the bounds.


2008 ◽  
Vol 51 (3) ◽  
pp. 399-405
Author(s):  
Xianmeng Meng

AbstractLet b1, b2 be any integers such that gcd(b1, b2) = 1 and c1|b1| < |b2| ≤ c2|b1|, where c1, c2 are any given positive constants. Let n be any integer satisfying gcd(n, bi) = 1, i = 1, 2. Let Pk denote any integer with no more than k prime factors, counted according to multiplicity. In this paper, for almost all b2, we prove (i) a sharp lower bound for n such that the equation b1p + b2m = n is solvable in prime p and almost prime m = Pk, k ≥ 3 whenever both bi are positive, and (ii) a sharp upper bound for the least solutions p, m of the above equation whenever bi are not of the same sign, where p is a prime and m = Pk, k ≥ 3.


1991 ◽  
Vol 44 (1) ◽  
pp. 54-74 ◽  
Author(s):  
Grahame Bennett

AbstractOur main result is the following monotonicity property for moment sequences μ. Let p be fixed, 1 ≤ p < ∞: thenis an increasing function of r(r = 1,2,…). From this we derive a sharp lower bound for an arbitrary Hausdorff matrix acting on ℓp.The corresponding upper bound problem was solved by Hardy.


2011 ◽  
Vol 95 (534) ◽  
pp. 433-436
Author(s):  
Daniel Shiu ◽  
Peter Shiu

Let π (x) count the primes p ≤ x, where x is a large real number. Euclid proved that there are infinitely many primes, so that π (x) → ∞ as x → ∞; in fact his famous argument ([1: Section 2.2]) can be used to show thatThere was no further progress on the problem of the distribution of primes until Euler developed various tools for the purpose; in particular he proved in 1737 [1: Theorem 427] that


2019 ◽  
Vol 168 (3) ◽  
pp. 505-518
Author(s):  
SUIJIE WANG ◽  
YEONG–NAN YEH ◽  
FENGWEI ZHOU

AbstractLet χ(t) = a0tn – a1tn−1 + ⋯ + (−1)rartn−r be the chromatic polynomial of a graph, the characteristic polynomial of a matroid, or the characteristic polynomial of an arrangement of hyperplanes. For any integer k = 0, 1, …, r and real number x ⩾ k − r − 1, we obtain a linear bound of the coefficient sequence, that is \begin{align*} {r+x\choose k}\leqslant \sum_{i=0}^{k}a_{i}{x\choose k-i}\leqslant {m+x\choose k}, \end{align*} where m is the size of the graph, matroid, or hyperplane arrangement. It extends Whitney’s sign-alternating theorem, Meredith’s upper bound theorem, and Dowling and Wilson’s lower bound theorem on the coefficient sequence. In the end, we also propose a problem on the combinatorial interpretation of the above inequality.


2016 ◽  
Vol 25 (5) ◽  
pp. 791-796
Author(s):  
DHRUV MUBAYI

The 3-uniform tight cycle Cs3 has vertex set ${\mathbb Z}_s$ and edge set {{i, i + 1, i + 2}: i ∈ ${\mathbb Z}_s$}. We prove that for every s ≢ 0 (mod 3) with s ⩾ 16 or s ∈ {8, 11, 14} there is a cs > 0 such that the 3-uniform hypergraph Ramsey number r(Cs3, Kn3) satisfies $$\begin{equation*} r(C_s^3, K_n^3)< 2^{c_s n \log n}.\ \end{equation*}$$ This answers in a strong form a question of the author and Rödl, who asked for an upper bound of the form $2^{n^{1+\epsilon_s}}$ for each fixed s ⩾ 4, where εs → 0 as s → ∞ and n is sufficiently large. The result is nearly tight as the lower bound is known to be exponential in n.


Sign in / Sign up

Export Citation Format

Share Document