◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

R. Brent

60 papers hereh-index 4613.5k citations309 works total

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

author position
  • sole author25
  • first author27
  • middle author6
  • last author1

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

fields
  • math.NT17
  • math.CO15
  • math.NA11
  • cs.DS10
  • cs.MS3
  • math.HO2
same name
  • R. Brent — 2 papers, h 5

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
20072021
most citedOn the stability of the Bareiss and related Toeplitz factorization algorithms

61 citations · 445 across the 59 of their papers we have counts for

collaborators
Showing 2012 · math.COShow all

4 papers · 2 filters

math.CO2012★ 9 cited

Lower bounds on maximal determinants of +-1 matrices via the probabilistic method

Richard P. Brent, Judy-anne H. Osborn, Warren D. Smith

We show that the maximal determinant D(n) for n×n ±1-matrices satisfies R(n):=D(n)/nn/2≥κd​>0. Here nn/2 is the Hadamard upper bound, and κd​ de…

math.CO2012

Bounds on minors of binary matrices

Richard P. Brent, Judy-anne H. Osborn

We prove an upper bound on sums of squares of minors of {+1, -1} matrices. The bound is sharp for Hadamard matrices, a result due to de Launey and Levin (2009), but our proof is si…

math.CO2012★ 5 cited

On minors of maximal determinant matrices

Richard P. Brent, Judy-anne H. Osborn

By an old result of Cohn (1965), a Hadamard matrix of order n has no proper Hadamard submatrices of order m > n/2. We generalise this result to maximal determinant submatrices of H…

math.CO2012★ 3 cited

General lower bounds on maximal determinants of binary matrices

Richard P. Brent, Judy-anne H. Osborn

We give general lower bounds on the maximal determinant of n by n {+1,-1}-matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier r…

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