A lower bound in Nehari's theorem on the polydisc

By theorems of Ferguson and Lacey ($d=2$) and Lacey and Terwilleger ($d>2$), Nehari's theorem is known to hold on the polydisc $\D^d$ for $d>1$, i.e., if $H_\psi$ is a bounded Hankel form on $H^2(\D^d)$ with analytic symbol $\psi$, then there is a function $\varphi$ in $L^\infty(\T^d)$ such that $\psi$ is the Riesz projection of $\varphi$. A method proposed in Helson's last paper is used to show that the constant $C_d$ in the estimate $\|\varphi\|_\infty\le C_d \|H_\psi\|$ grows at least exponentially with $d$; it follows that there is no analogue of Nehari's theorem on the infinite-dimensional polydisc.

Approximate solution to the speed of spreading viruses

Recently, it has been shown that the speed of virus infections can be explained by time-delayed reactiondiffusion [J. Fort and V. Me´ndez, Phys. Rev. Lett. 89, 178101 (2002)], but no analytical solutions were found. Here we derive formulas for the front speed, valid in appropriate limits. We also integrate numerically the evolution equations of the system. There is good agreement with both numerical and experimental speeds

Universal Quantum Cloning

After introducing the no-cloning theorem and the most common forms of approximate quantum cloning, universal quantum cloning is considered in detail. The connections it has with universal NOT-gate, quantum cryptography and state estimation are presented and briefly discussed. The state estimation connection is used to show that the amount of extractable classical information and total Bloch vector length are conserved in universal quantum cloning. The 1  2 qubit cloner is also shown to obey a complementarity relation between local and nonlocal information. These are interpreted to be a consequence of the conservation of total information in cloning. Finally, the performance of the 1  M cloning network discovered by Bužek, Hillery and Knight is studied in the presence of decoherence using the Barenco et al. approach where random phase fluctuations are attached to 2-qubit gates. The expression for average fidelity is calculated for three cases and it is found to depend on the optimal fidelity and the average of the phase fluctuations in a specific way. It is conjectured to be the form of the average fidelity in the general case. While the cloning network is found to be rather robust, it is nevertheless argued that the scalability of the quantum network implementation is poor by studying the effect of decoherence during the preparation of the initial state of the cloning machine in the 1 ! 2 case and observing that the loss in average fidelity can be large. This affirms the result by Maruyama and Knight, who reached the same conclusion in a slightly different manner.

The von Neumann Minimax Theorem and its relatives and a study of externality in on-line auctions

This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships with fundamental theorems of convex analysis. The second part is about externality in sponsored search auctions. It shows that in these auctions, advertisers have externality effects on each other which influence their bidding behavior. It proposes Hal R.Varian model and shows how adding externality to this model will affect its properties. In order to have a better understanding of the interaction among advertisers in on-line auctions, it studies the structure of the Google advertisements networ.k and shows that it is a small-world scale-free network.

An Interactive Theorem Prover for First-Order Dynamic Logic

Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.

Approximate cost of completing the railway from Port Dalhousie to St. Catharines and an estimate of the cost of the piers at Port Dalhousie signed by William Hamilton Merritt

Approximate cost of completing the railway from Port Dalhousie to St. Catharines and an estimate of the cost of the piers at Port Dalhousie signed by William Hamilton Merritt (5 pages, handwritten), July 8, 1854.

Approximate estimate of the cost of completing the Port Dalhousie Railway to the Grand Central Railway Station at Lock 12

Approximate estimate of the cost of completing the Port Dalhousie Railway to the Grand Central Railway Station at Lock 12. This document is badly torn and burned but most of the text is legible, July 14, 1854.

Approximate estimate of the cost of constructing and completing the Port Dalhousie and Thorold Railway to St. Catharines

Approximate estimate of the cost of constructing and completing the Port Dalhousie and Thorold Railway to St. Catharines signed by S.D. Woodruff (2 pages, handwritten), Jan. 8, 1855.

Approximate estimate of the cost of extending the Port Dalhousie and Thorold Railway from Geneva Street to the Great Western Railway Station at Lock no. 12

Approximate estimate of the cost of extending the Port Dalhousie and Thorold Railway from Geneva Street to the Great Western Railway Station at Lock no. 12 (2 copies) [one appears to be a rough copy] (2 pages, handwritten), Feb. 2, 1855.

Memorandum respecting differences between the approximate and the final estimate

Memorandum respecting differences between the approximate and the final estimate (3 ¼ pages, handwritten), n.d.

Second copy of the memorandum respecting differences between the approximate and final estimate but this one has “memorandum of extras of Brown and McDonall contract” written on the outer page

Second copy of the memorandum respecting differences between the approximate and final estimate but this one has “memorandum of extras of Brown and McDonall contract” written on the outer page (3 pages, handwritten), n.d.

Approximate estimate of the cost of macadamizing, grading, bridging and putting in culverts from Hurst’s Bridge above Thorold to Port Robinson

Approximate estimate of the cost of macadamizing, grading, bridging and putting in culverts from Hurst’s Bridge above Thorold to Port Robinson (2 pages, handwritten), n.d.

Chart of approximate quantity of excavation in slides in the deep cut

Chart of approximate quantity of excavation in slides in the deep cut, July 1, 1848.