• Title/Summary/Keyword: upper/lower bounds

Search Result 254, Processing Time 0.028 seconds

MONOTONICITY CRITERION AND FUNCTIONAL INEQUALITIES FOR SOME q-SPECIAL FUNCTIONS

  • Mehrez, Khaled
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.133-147
    • /
    • 2021
  • Our aim in this paper is to derive several new monotonicity properties and functional inequalities of some functions involving the q-gamma, q-digamma and q-polygamma functions. More precisely, some classes of functions involving the q-gamma function are proved to be logarithmically completely monotonic and a class of functions involving the q-digamma function is showed to be completely monotonic. As applications of these, we offer upper and lower bounds for this special functions and new sharp upper and lower bounds for the q-analogue harmonic number harmonic are derived. Moreover, a number of two-sided exponential bounding inequalities are given for the q-digamma function and two-sided exponential bounding inequalities are then obtained for the q-tetragamma function.

Redesigning Radio Networks Considering Frequency Demands and Frequency Reassignment Cost (주파수 수요와 주파수 재할당 비용을 고려한 무선통신 네트워크 재설계)

  • Han, Junghee
    • Journal of Information Technology Services
    • /
    • v.10 no.1
    • /
    • pp.117-133
    • /
    • 2011
  • In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

UPPER AND LOWER BOUNDS FOR THE POWER OF EIGENVALUES IN SEIDEL MATRIX

  • IRANMANESH, ALI;FARSANGI, JALAL ASKARI
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.5_6
    • /
    • pp.627-633
    • /
    • 2015
  • In this paper, we generalize the concept of the energy of Seidel matrix S(G) which denoted by Sα(G) and obtain some results related to this matrix. Also, we obtain an upper and lower bound for Sα(G) related to all of graphs with |detS(G)| ≥ (n - 1); n ≥ 3.

ON THE INCREMENTS OF A d-DIMENSIONAL GAUSSIAN PROCESS

  • LIN ZHENGYAN;HWANG KYO-SHIN
    • Journal of the Korean Mathematical Society
    • /
    • v.42 no.6
    • /
    • pp.1215-1230
    • /
    • 2005
  • In this paper we establish some results on the increments of a d-dimensional Gaussian process with the usual Euclidean norm. In particular we obtain the law of iterated logarithm and the Book-Shore type theorem for the increments of ad-dimensional Gaussian process, via estimating upper bounds and lower bounds of large deviation probabilities on the suprema of the d-dimensional Gaussian process.

BOUNDS ON THE HYPER-ZAGREB INDEX

  • FALAHATI-NEZHAD, FARZANEH;AZARI, MAHDIEH
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.3_4
    • /
    • pp.319-330
    • /
    • 2016
  • The hyper-Zagreb index HM(G) of a simple graph G is defined as the sum of the terms (du+dv)2 over all edges uv of G, where du denotes the degree of the vertex u of G. In this paper, we present several upper and lower bounds on the hyper-Zagreb index in terms of some molecular structural parameters and relate this index to various well-known molecular descriptors.

A CODING THEOREM ON GENERALIZED R-NORM ENTROPY

  • Hooda, D.S.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.3
    • /
    • pp.881-888
    • /
    • 2001
  • Recently, Hooda and Ram [7] have proposed and characterized a new generalized measure of R-norm entropy. In the present communication we have studied its application in coding theory. Various mean codeword lengths and their bounds have been defined and a coding theorem on lower and upper bounds of a generalized mean codeword length in term of the generalized R-norm entropy has been proved.

Average Length and Bounds on the Busy Period for a k-out-of-n : G System with Non-identical Components

  • Jung, Kyung-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.2
    • /
    • pp.123-130
    • /
    • 1992
  • The model of k-out-of n : G repairable system with identical components is extended to a repairable system with n different components. The objective is to analytically derive the mean time of the busy period for a k-out-of-n : G system with unrestricted repair. Then, the lower and upper bounds on the average time of the busy period of the n-component system with restricted repair are also shown.

  • PDF

HANKEL DETERMINANTS FOR STARLIKE FUNCTIONS WITH RESPECT TO SYMMETRICAL POINTS

  • Nak Eun Cho;Young Jae Sim;Derek K. Thomas
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.2
    • /
    • pp.389-404
    • /
    • 2023
  • We prove sharp bounds for Hankel determinants for starlike functions f with respect to symmetrical points, i.e., f given by $f(z)=z+{\sum{_{n=2}^{\infty}}}\,{\alpha}_nz^n$ for z ∈ 𝔻 satisfying $$Re{\frac{zf^{\prime}(z)}{f(z)-f(-z)}}>0,\;z{\in}{\mathbb{D}}$$. We also give sharp upper and lower bounds when the coefficients of f are real.

INVESTIGATION OF BOUNDS FOR 𝕽 GRAPH VIA TOPOLOGICAL INDICES

  • GIRISHA. A;VENUGOPAL. G;KAVITA PERMI
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.4
    • /
    • pp.777-783
    • /
    • 2024
  • Topoloical index is a numerical quantity which is correlates to properties of chemical compound . In this paper, we define operator graph namely, Edge ss-corona graph and we study structured properties of that graph. Also, establish the upper and lower bounds for First Zagreb index, Second Zagreb index, First Gourava index, SK1 index, Forgotten topological index and EM1 index of edge SS-corona graph.