researcher

Nick Gill

42 papers hereh-index 201.5k citations108 works total

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

author position

sole author11
first author22
middle author3
last author5

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

fields

math.GR41
math.CO1

same name

Nick Gill — 3 papers
Nick Gill — 1 paper, h 2

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

20062026

most citedGrowth in solvable subgroups of GL_r(Z/pZ)

24 citations · 93 across the 30 of their papers we have counts for

collaborators

Showing 2019 · math.GRShow all

2 papers · 2 filters

math.GR2019

Groups Obtained from $2 - (n, 4, 3)$ Supersimple Designs

Nick Gill, Jeremías Ramírez

We contribute towards the classification programme for Conway groupoids associated to a $2 - (n, 4, λ)$ design. Our main results improve the known bounds for a hole stabilizer to be pr…

math.GR2019★ 3 cited

A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank

N. Gill, L. Pyber, E. Szabó

We prove that if $G$ is a finite simple group of Lie type and $S_{1}, \dots, S_{k}$ are subsets of $G$ satisfying $\prod_{i = 1}^{k} ∣ S_{i} ∣ \geq ∣ G ∣^{c}$ for some $c$ depending only on the rank o…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Groups Obtained from 2−(n,4,3) Supersimple Designs

A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank

Groups Obtained from $2 - (n, 4, 3)$ Supersimple Designs