Searcharxiv⌕ Search

arXiv subjects

Michael Larsen

Publications and source records attributed to Michael Larsen.

98 records · Page 6Linked to original sources
arXiv2003

Constructing semisimple p-adic Galois representations with prescribed properties

In this paper we show that two dimensional (mod p) Galois representations satisfying mild hypotheses can be lifted to p-adic Galois representations ramified at infinitely many primes such that the characteristic polynomials of Frobenius at a density one set of unramified primes are defined over the rational integers. In particular we show that often one can "density one compatibly" lift mod p and mod q Galois representations.

math.NT↗
arXiv2003

The support problem for abelian varieties

Let $A$ be an abelian variety over a number field $K$. If $P$ and $Q$ are $K$-rational points of $A$ such that the order of the reduction of $Q$ divides that of $P$ for all but finitely many primes of the ring of integers of $K$, then there exists a $K$-endomorphism $ϕ$ of $A$ and a positive integer $k$ such that $kQ = ϕ(P)$.

math.NT↗
arXiv2003

Navigating the Cayley graph of SL(2,Z/pZ)

This paper describes a non-deterministic polynomial-time algorithm to find a path of length O(log p loglog p) between any two vertices of the Cayley graph of SL(2,Z/pZ).

math.GR↗
arXiv2002

The shape of a typical boxed plane partition

Using a calculus of variations approach, we determine the shape of a typical plane partition in a large box (i.e., a plane partition chosen at random according to the uniform distribution on all plane partitions whose solid Young diagrams fit inside the box). Equivalently, we describe the distribution of the three different orientations of lozenges in a random lozenge tiling of a large hexagon. We prove a generalization of the classical formula of MacMahon for the number of plane partitions in a box; for each of the possible ways in which the tilings of a region can behave when restricted to certain lines, our formula tells the number of tilings that behave in that way. When we take a suitable limit, this formula gives us a functional which we must maximize to determine the asymptotic behavior of a plane partition in a box. Once the variational problem has been set up, we analyze it using a modification of the methods employed by Logan and Shepp and by Vershik and Kerov in their studies of random Young tableaux.

math.CO↗
arXiv2001

Motivic measures and stable birational geometry

We study the motivic Grothendieck group of algebraic varieties from the point of view of stable birational geometry. In particular, we obtain a counter-example to a conjecture of M. Kapranov on the rationality of motivic zeta-function.

math.AG↗
arXiv2000

A modular functor which is universal for quantum computation

We show that the topological modular functor from Witten-Chern-Simons theory is universal for quantum computation in the sense a quantum circuit computation can be efficiently approximated by an intertwining action of a braid on the functor's state space. A computational model based on Chern-Simons theory at a fifth root of unity is defined and shown to be polynomially equivalent to the quantum circuit model. The chief technical advance: the density of the irreducible sectors of the Jones representation, have topological implications which will be considered elsewhere.

quant-ph↗
arXiv1991

Alternating sign matrices and domino tilings

We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives the number of domino tilings of the Aztec diamond of order $n$ but also provides information about the orientation of the dominoes (vertical versus horizontal) and the accessibility of one tiling from another by means of local modifications. Several proofs of the formula are given. The problem turns out to have connections with the alternating sign matrices of Mills, Robbins, and Rumsey, as well as the square ice model studied by Lieb.

math.CO↗