𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Sharp Lower Bound in the Distortion Theorem for the Sakaguchi Class

✍ Scribed by I.R. Nezhmetdinov

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
61 KB
Volume
242
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

A sharp lower bound is obtained for f Ј z in the class SSP of functions starlike with respect to symmetric points. As a consequence, some results are improved both for SSP and the class of uniformly starlike functions.

πŸ“œ SIMILAR VOLUMES

A sharp lower bound for the circumferenc
A sharp lower bound for the circumference of 1-tough graphs with large degree sums
✍ Vu Dinh Hoa πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

## Abstract We show that every 1‐tough graph __G__ on __n__ β‰₯ 3 vertices with Οƒ~3~≧ __n__ has a cycle of length at least min{__n, n__ + (Οƒ~3~/3 ) βˆ’ Ξ± + 1}, where Οƒ~3~ denotes the minimum value of the degree sum of any 3 pairwise nonadjacent vertices and Ξ± the cardinality of a miximum independent se

A Lower Bound for the Height in Abelian
A Lower Bound for the Height in Abelian Extensions
✍ Francesco Amoroso; Roberto Dvornicich πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 172 KB

We produce an absolute lower bound for the height of the algebraic numbers (different from zero and from the roots of unity) lying in an abelian extension of the rationals. The proof rests on elementary congruences in cyclotomic fields and on Kronecker Weber theorem.

Lower Bounds for the Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
✍ Nader H. Bshouty πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Γ„ 4 operations q, y, = , the standard bit operation Shift, Ro

A superlinear lower bound for the size o
A superlinear lower bound for the size of a critical set in a latin square
✍ Nicholas J. Cavenagh πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 157 KB πŸ‘ 1 views

## Abstract A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let __scs__(__n__) denote the smallest possible size of a critical set in a latin square of order __n__. We show that for all __n__, $scs(n)\geq n\lfloo