1 citations · 1 across the 11 of their papers we have counts for
11 papers
Reflect-Push Methods Part I: Two Dimensional Techniques
Nikola Kuzmanovski, Jamie Radcliffe
We determine all maximum weight downsets in the product of two chains, where the weight function is a strictly increasing function of the rank. Many discrete isoperimetric problems…
Neighborhood Variants of the KKM Lemma, Lebesgue Covering Theorem, and Sperner's Lemma on the Cube
Jason Vander Woude, Peter Dixon, A. Pavan +2
We establish a "neighborhood" variant of the cubical KKM lemma and the Lebesgue covering theorem and deduce a discretized version which is a "neighborhood" variant of Sperner's lem…
Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma
Jason Vander Woude, Peter Dixon, A. Pavan +2
A partition of is called a -secluded partition if, for every , the ball $\overline{B}_{\infty}(\varepsilon,…
Geometry of Rounding
Jason Vander Woude, Peter Dixon, A. Pavan +2
Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of are equivalent, we introduce the followi…
Perfect shuffling with fewer lazy transpositions
Carla Groenland, Tom Johnston, Jamie Radcliffe +1
A lazy transposition is the random permutation that equals the identity with probability and the transposition with probability . How long must a…
Short reachability networks
Carla Groenland, Tom Johnston, Jamie Radcliffe +1
We investigate the following generalisation of permutation networks. We say a sequence of transpositions in forms a -reachability network if, for ev…
Many cliques in bounded-degree hypergraphs
Rachel Kirsch, Jamie Radcliffe
Recently Chase determined the maximum possible number of cliques of size in a graph on vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the…
Generalized saturation problems for cliques, paths, and stars
Jamie Radcliffe, Adam Volk
A graph is -saturated if it does not contain any copy of , but the addition of any missing edge in creates at least one copy of . Inspired by work of Alon and Shik…
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of Sparse Paving Matroids
Kyungyong Lee, George D. Nasr, Jamie Radcliffe
We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all m…
A Combinatorial Formula for Kazhdan-Lusztig Polynomials of -Removed Uniform Matroids
Kyungyong Lee, George D. Nasr, Jamie Radcliffe
Let be a non-negative integer. A -removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of disjoint bases. We present a combinato…
Stability and Erdős--Stone type results for -free graphs with a fixed number of edges
Jamie Radcliffe, Andrew Uzzell
A fundamental problem of extremal graph theory is to ask, 'What is the maximum number of edges in an -free graph on vertices?' Recently Alon and Shikhelman proposed a more g…