Source author record

Zishen Qu

Zishen Qu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

4works
6topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

From Diffusion to Rectified Flow: Rethinking Text-Based Segmentation

Text-based image segmentation aims to delineate object boundaries within an image from text prompts, offering higher flexibility and broader application scope compared to traditional fixed-category segmentation tasks. Recent studies have shown that diffusion models (e.g., Stable Diffusion) can provide rich multimodal semantic features, leading to studies of using diffusion models as feature extractors for segmentation tasks. Such methods, however, inherit the generative natures of diffusion models that are harmful to discriminative segmentation tasks. In response, we propose RLFSeg, a novel framework that leverages Rectified Flow to learn direct mapping from the image to the segmentation mask within the latent space. The model is thus freed from the noise-denoise process and the need to optimize the time step of diffusion models, resulting in substantially better performance than previous diffusion-based methods, especially on zero-shot scenarios. By introducing label refinement and an Adaptive One-Step Sampling strategy, the model achieves higher accuracy even on a single inference step. The framework redirects a pretrained generative model to the discriminative segmentation task with zero modification to model structure, thus reveals promising application potential and significant research value.

preprint2025arXiv

Quiver superconformal index and giant gravitons: asymptotics and expansions

We study asymptotics of the $d=4$, $\mathcal{N}=1$ superconformal index for toric quiver gauge theories. Using graph-theoretic and algebraic factorization techniques, we obtain a cycle expansion for the large-$N$ index in terms of the $R$-charge-weighted adjacency matrix. Applying saddle-point techniques at the on-shell $R$-charges, we determine the asymptotic degeneracy in the univariate specialization for $\hat{A}_{m}$, and along the main diagonal for the bivariate index for $\mathcal{N}=4$ and $\hat{A}_{3}$. In these cases we find $\ln |c_{n}| \sim γn^{\frac{1}{2}}+ β\ln n + α$ (Hardy-Ramanujan type). We also identify polynomial growth for $dP3$, $Y^{3,3}$ and $Y^{p,0}$, and give numerical evidence for $γ$ in further $Y^{p,p}$ examples. Finally, we generalize Murthy's giant graviton expansion via the Hubbard-Stratonovich transformation and Borodin-Okounkov formula to multi-matrix models relevant for quivers.

preprint2023arXiv

Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs

Given a graph $G$ and a graph property $P$ we say that $G$ is minimal with respect to $P$ if no proper induced subgraph of $G$ has the property $P$. An HC-obstruction is a minimal 2-connected non-Hamiltonian graph. Given a graph $H$, a graph $G$ is $H$-free if $G$ has no induced subgraph isomorphic to $H$. The main motivation for this paper originates from a theorem of Duffus, Gould, and Jacobson (1981), which characterizes all the minimal connected graphs with no Hamiltonian path. In 1998, Brousek characterized all the claw-free HC-obstructions. On a similar note, Chiba and Furuya (2021), characterized all (not only the minimal) 2-connected non-Hamiltonian $\{K_{1,3}, N_{3,1,1}\}$-free graphs. Recently, Cheriyan, Hajebi, and two of us (2022), characterized all triangle-free HC-obstructions and all the HC-obstructions which are split graphs. A wheel is a graph obtained from a cycle by adding a new vertex with at least three neighbors in the cycle. In this paper we characterize all the HC-obstructions which are wheel-free graphs.

preprint2022arXiv

Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs

In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw ($K_{1,3}$) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being connected, these two are the only minimal (under taking induced subgraphs) graphs with no Hamiltonian path. Brousek (1998) characterized the minimal graphs that are $2$-connected, non-Hamiltonian and do not contain the claw as an induced subgraph. We characterize the minimal graphs that are $2$-connected and non-Hamiltonian for two classes of graphs: (1) split graphs, (2) triangle-free graphs. We remark that testing for Hamiltonicity is NP-hard in both of these classes.