◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Amber Gentle

2 papers hereh-index 13 citations3 works total

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

author position
  • first author2

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

fields
  • math.CO2

identity via Semantic Scholar / OpenAlex

most citedOn Perfect Sequence Covering Arrays

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

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2024

Excess Coverage Arrays and Levenshtein's Conjecture

Amber E. Gentle, Daniel Horsley, Ian M. Wanless

A sequence covering array, denoted \textsf{SCA}(N;t,v), is a set of N permutations of {0,…,v−1} such that each sequence of t distinct elements of $\{0, \dots, v-1\…

math.CO2022★ 4 cited

On Perfect Sequence Covering Arrays

Aidan R. Gentle, Ian M. Wanless

A PSCA(v,t,λ) is a multiset of permutations of the v-element alphabet {0,…,v−1} such that every sequence of t distinct elements of the alphabet appears in the spe…

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