◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Dixon

2 papers hereh-index 252.3k citations115 works total

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

author position
  • sole author2

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

fields
  • math.GR2
same name
  • J. Dixon — 35 papers, h 11
  • J. Dixon — 2 papers, h 7
  • J. Dixon — 1 paper, h 1
  • J. Dixon — 1 paper, h 1
  • J. Dixon — 1 paper, h 62

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

most citedLongest common subsequences in binary sequences

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.GR2016

Recognizing cyclic matrices and a conjecture of J.G. Thompson

John D. Dixon

In 2006 J.G. Thompson conjectured: "If F is a field and A is in GL(n,F), then there is a permutation matrix P such that AP is cyclic, that is, the minimal polynomial of AP is also…

math.GR2013★ 2 cited

Longest common subsequences in binary sequences

John D. Dixon

Given two {0,1}-sequences X and Y of lengths m and n, respectively, we write L(X,Y) to denote the length of the longest common subsequence (LCS) of X and Y, and write L(m,n) to den…

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