نتایج جستجو برای: lower and upper bound

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

In this paper, we intend to define and study concepts of weight and weighted spaces of holomorphic (analytic) functions on the upper half plane. We study two special classes of these spaces of holomorphic functions on the upper half plane. Firstly, we prove these spaces of holomorphic functions on the upper half plane endowed with weighted norm supremum are Banach spaces. Then, we investigate t...

A. Behmaram, R. Rasi S. Sheikholeslami

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم پایه دامغان - دانشکده علوم زمین 1388

به منظور مطالعه بیواستراتیگرافی و پالئواکولوژی رسوبات دونین پسین، برشی در استان کرمان انتخاب گردید، که از لحاظ موقعیت زمین شناسی در ناحیه ایران مرکزی قرار دارد. برش باغین در شمال شرق باغین و 20 کیلومتری غرب کرمان واقع شده است. قدیمی ترین واحد دونین در این منطقه، سازند پادهاست که شامل ماسه سنگ های سفید و قرمز می باشد، این سازند به وسیله واحد هایی از دونین که معادل سازند بهرام می باشد، پوشیده می...

2009
Hans L. Bodlaender

In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems,...

Habibe Sadeghi Leila Karimi

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

ژورنال: پژوهش های ریاضی 2019

Introduction In this paper, we intend to show that without any certain growth condition on the weight function, we always able to present a weighted sup-norm on the upper half plane in terms of weighted sup-norm on the unit disc and supremum of holomorphic functions on the certain lines in the upper half plane. Material and methods We use a certain transform between the unit dick and the uppe...

2017
ZARATHUSTRA BRADY

with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [3] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, and that they tend to 1 exponentially as s goes to infinity. Let β = β(κ) be the infimum of s such that fκ(s) > 0. S...

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

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