scholarly journals A lower bound of the hyperbolic dimension for meromorphic functions having a logarithmic Hölder tract

2018 ◽  
Vol 22 (5) ◽  
pp. 62-77
Author(s):  
Volker Mayer
Keyword(s):  
Lower Bound ◽  
Meromorphic Functions ◽  
Hyperbolic Dimension

scholarly journals Meromorphic solutions of higher order non-homogeneous linear difference equations

2021 ◽  
Vol 13(62) (2) ◽  
pp. 433-450
Author(s):  
Benharrat Belaıdi ◽  
Rachid Bellaama
Keyword(s):  
Lower Bound ◽  
Difference Equation ◽  
Lower Order ◽  
Meromorphic Functions ◽  
Linear Difference Equation ◽  
Complex Numbers ◽  
Meromorphic Solutions ◽  
Linear Difference Equations ◽  
Early Results ◽  
Homogeneous Linear

In this paper, we investigate the growth of meromorphic solutions of nonhomogeneous linear difference equation A_n(z)f(z + c_n) + · · · + A_1(z)f(z + c_1) + A_0(z)f(z) = A_{n+1}(z), where A_{n+1 (z), · · · , A0 (z) are (entire) or meromorphic functions and c_j (1, · · · , n) are non-zero distinct complex numbers. Under some conditions on the (lower) order and the (lower) type of the coefficients, we obtain estimates on the lower bound of the order of meromorphic solutions of the above equation. We extend early results due to Luo and Zheng.

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

Sign in / Sign up

Export Citation Format

Share Document