Runze Wang

collaborators

4 papers

math.CO2025

Strong hub cover pebbling number

Runze Wang

In a graph $G$ , we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$ , we can find a path between them whose internal vertices are all in this se…

math.CO2025

On Relative Ordered Turán Density

Dylan King, Bernard Lidický, Minghui Ouyang +3

For an ordered graph $F$ , denote the Turán density by $π (F)$ . The relative Turán density, denoted by $ρ (F)$ , is the supremum over $α \in [0, 1]$ such that every ordered graph $G$ …

math.CO2025

Discrete isoperimetric inequalities on the strong products of paths

Runze Wang

For a graph $G = (V, E)$ and a nonempty set $S \subseteq V$ , the \emph{vertex boundary} of $S$ , denoted by $\partial_{G} (S)$ , is defined to be the set of vertices that are not in $S$ b…

math.RT2024

The stable wave front set of theta representations

Edmund Karasiewicz, Emile Okada, Runze Wang

We compute the stable wave front set of theta representations for certain tame Brylinski-Deligne covers of a connected reductive $p$ -adic group. The computation involves two main i…