University of Toronto

most citedHolonomic quantum computation in decoherence-free subspaces

149 citations

17 papers

math.AC2005

Power series rings and projectivity

R. -O. Buchweitz, H. Flenner

We show that a formal power series ring $A [[X]]$ over a noetherian ring $A$ is not a projective module unless $A$ is artinian. However, if $(A, m)$ is local, then $A[[X]…

cs.CC2005★ 50 cited

Computing over the Reals: Foundations for Scientific Computing

Mark Braverman, Stephen Cook

We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems…

math.DS2005

Renormalization in the Henon family, I: universality but non-rigidity

A. de Carvalho, M. Lyubich, M. Martens

In this paper geometric properties of infinitely renormalizable real Hénon-like maps $F$ in $R^{2}$ are studied. It is shown that the appropriately defined renormalizations $R^{n} F$ …

math-ph2005

Instability of Equilibrium States for Coupled Heat Reservoirs at Different Temperatures

M. Merkli, M. Mück, I. M. Sigal

We consider quantum systems consisting of a ``small'' system coupled to two reservoirs (called open systems). We show that such a system has no equilibrium states normal with respe…

math.AG2005

Some Remarks on the Jacobian Conjecture and Connections with Hilbert's Irreducibility Theorem

Richard J. Lipton, Evangelos Markakis

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our firs…

math.DS2005★ 4 cited

Combinatorial rigidity for unicritical polynomials

Artur Avila, Jeremy Kahn, Mikhail Lyubich +1

We prove that any unicritical polynomial $f_{c} : z \mapsto z^{d} + c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies t…