Bieberbach's Conjecture, the de Branges and Weinstein Functions and the Askey-Gasper Inequality

The Bieberbach conjecture about the coefficients of univalent functions of the unit disk was formulated by Ludwig Bieberbach in 1916 [Bieberbach1916]. The conjecture states that the coefficients of univalent functions are majorized by those of the Koebe function which maps the unit disk onto a radially slit plane. The Bieberbach conjecture was quite a difficult problem, and it was surprisingly proved by Louis de Branges in 1984 [deBranges1985] when some experts were rather trying to disprove it. It turned out that an inequality of Askey and Gasper [AskeyGasper1976] about certain hypergeometric functions played a crucial role in de Branges' proof. In this article I describe the historical development of the conjecture and the main ideas that led to the proof. The proof of Lenard Weinstein (1991) [Weinstein1991] follows, and it is shown how the two proofs are interrelated. Both proofs depend on polynomial systems that are directly related with the Koebe function. At this point algorithms of computer algebra come into the play, and computer demonstrations are given that show how important parts of the proofs can be automated.

New results and open problems on Toeplitz operators in Bergman spaces

We discuss some of the recent progress in the field of Toeplitz operators acting on Bergman spaces of the unit disk, formulate some new results, and describe a list of open problems -- concerning boundedness, compactness and Fredholm properties -- which was presented at the conference "Recent Advances in Function Related Operator Theory'' in Puerto Rico in March 2010.

Hankel operators on Fock spaces

We study Hankel operators on the weighted Fock spaces Fp. The boundedness and compactness of these operators are characterized in terms of BMO and VMO, respectively. Along the way, we also study Berezin transform and harmonic conjugates on the plane. Our results are analogous to Zhu's characterization of bounded and compact Hankel operators on Bergman spaces of the unit disk.

Toeplitz operators on Dirichlet-Besov spaces

We study Toeplitz operators on the Besov spaces in the case of the open unit disk. We prove that a symbol satisfying a weak Lipschitz type condition induces a bounded Toeplitz operator. Such symbols do not need to be bounded functions or have continuous extensions to the boundary of the open unit disk. We discuss the problem of the existence of nontrivial compact Toeplitz operators, and also consider Fredholm properties and prove an index formula.

Zeros de Polinômios Perturbados

Pós-graduação em Matematica Aplicada e Computacional - FCT

WEAVE: Efficient Geographical Routing in Large-Scale Networks

We propose WEAVE, a geographical 2D/3D routing protocol that maintains information on a small number of waypoints and checkpoints for forwarding packets to any destination. Nodes obtain the routing information from partial traces gathered in incoming packets and use a system of checkpoints along with the segments of routes to weave end-to-end paths close to the shortest ones. WEAVE does not generate any control traffic, it is suitable for routing in both 2D and 3D networks, and does not require any strong assumption on the underlying network graph such as the Unit Disk or a Planar Graph. WEAVE compares favorably with existing protocols in both testbed experiments and simulations.

A 3D multi-objective optimization planning algorithm for wireless sensor networks

The complexity of planning a wireless sensor network is dependent on the aspects of optimization and on the application requirements. Even though Murphy's Law is applied everywhere in reality, a good planning algorithm will assist the designers to be aware of the short plates of their design and to improve them before the problems being exposed at the real deployment. A 3D multi-objective planning algorithm is proposed in this paper to provide solutions on the locations of nodes and their properties. It employs a developed ray-tracing scheme for sensing signal and radio propagation modelling. Therefore it is sensitive to the obstacles and makes the models of sensing coverage and link quality more practical compared with other heuristics that use ideal unit-disk models. The proposed algorithm aims at reaching an overall optimization on hardware cost, coverage, link quality and lifetime. Thus each of those metrics are modelled and normalized to compose a desirability function. Evolutionary algorithm is designed to efficiently tackle this NP-hard multi-objective optimization problem. The proposed algorithm is applicable for both indoor and outdoor 3D scenarios. Different parameters that affect the performance are analyzed through extensive experiments; two state-of-the-art algorithms are rebuilt and tested with the same configuration as that of the proposed algorithm. The results indicate that the proposed algorithm converges efficiently within 600 iterations and performs better than the compared heuristics.

On Two Saigo’s Fractional Integral Operators in the Class of Univalent Functions

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

Inclusion Properties for Certain Classes of Analytic Functions Involving a Family of Fractional Integral Operators

2000 Math. Subject Classification: 30C45

Fekete-Szegö Inequality for Universally Prestarlike Functions

MSC 2010: 30C45

A Note on Univalent Functions with Finitely many Coefficients

MSC 2010: 30C45

Weighted composition followed by differentiation between weighted Banach spaces of holomorphic functions

2010 Mathematics Subject Classification: 47B33, 47B38.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

The disk-percolation model on graphs

We study a long-range percolation model whose dynamics describe the spreading of an infection on an infinite graph. We obtain a sufficient condition for phase transition and prove all upper bound for the critical parameter of spherically symmetric trees. (C) 2008 Elsevier B.V. All rights reserved.

Graphs of oblique photo scale factors and nadir point distances. For unit altitude, focal lengths: 6,12,24,36, and 48 inches; tilts: 0⁰ to 90⁰.

"Prepared ... for the U.S. Navy Bureau of Aeronautics, under contract NOas 57-585-c."