◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Larsen

97 papers hereh-index 335.8k citations156 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author10
  • first author38
  • middle author24
  • last author24

Across the 96 of 97 papers where every author was matched, so the position is known.

fields
  • math.NT30
  • math.GR27
  • math.AG13
  • math.RT13
  • math.RA3
  • math.AT2
same name
  • M. Larsen — 9 papers, h 2
  • M. Larsen — 4 papers, h 28
  • M. Larsen — 3 papers, h 13
  • M. Larsen — 3 papers, h 6
  • M. Larsen — 1 paper, h 2
  • M. Larsen — 1 paper, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
19922023
most citedAlternating sign matrices and domino tilings

280 citations · 1k across the 82 of their papers we have counts for

collaborators
Showing 2003Show all

4 papers · 1 filter

math.NT2003

Constructing semisimple p-adic Galois representations with prescribed properties

Chandrashekhar Khare, Michael Larsen, Ravi Ramakrishna

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 prim…

math.RT2003★ 5 cited

Determining a semisimple group from its representation degrees

Michael J. Larsen

The Lie algbera of a compact semisimple Lie group G is determined by the degrees of the irreducible representations of G. However, two different groups can have the same representa…

math.NT2003

Weak approximation for linear systems of quadrics

Bo-Hae Im, Michael Larsen

We give local conditions at the infinite places of a number field K ensuring that the intersection of n quadrics in projective N-space over K, N >> n, satisfies weak approximation.

math.GR2003★ 2 cited

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

Michael Larsen

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).

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.