William Raynaud

most citedSmallest cyclically covering subspaces of

F_{q}^{n}

, and lower bounds in Isbell's conjecture

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2019

Edge Isoperimetric Inequalities for Powers of the Hypercube

Cyrus Rashtchian, William Raynaud

For positive integers $n$ and $r$ , we let $Q_{n}^{r}$ denote the $r$ th power of the $n$ -dimensional discrete hypercube graph, i.e., the graph with vertex-set ${0, 1}^{n}$ , where two 0-1…

math.CO2018★ 1 cited

Smallest cyclically covering subspaces of $F_{q}^{n}$ , and lower bounds in Isbell's conjecture

Peter Cameron, David Ellis, William Raynaud

For a prime power $q$ and a positive integer $n$ , we say a subspace $U$ of $F_{q}^{n}$ is {\em cyclically covering} if the union of the cyclic shifts of $U$ is equal to $\ma…

Edge Isoperimetric Inequalities for Powers of the Hypercube

Smallest cyclically covering subspaces of Fqn​, and lower bounds in Isbell's conjecture

Smallest cyclically covering subspaces of $F_{q}^{n}$ , and lower bounds in Isbell's conjecture