SearcharxivSearch

arXiv subjects

Wenqian Zhang

Publications and source records attributed to Wenqian Zhang.

At least 19 recordsLinked to original sources

The toughness of random graphs

For a connected and non-complete graph $G$ of order $n$, its toughness is defined as \[ τ(G)=\min\bigl\{|S|/c(G-S):S\subseteq V(G),\ c(G-S)>1\bigr\}, \] where $c(G-S)$ denotes the number of components of $G-S$. Let $α(G)$ denote the independence number of $G$. An elementary bound on toughness is $$τ(G)\leq\frac{n-α(G)}{α(G)}.$$ Fix $p\in(0,1)$, and let $G(n,p)$ be the binomial random graph on vertex set $[n]$. Set $a=α(G(n,p))$. In this paper, we mainly prove that \[ τ(G(n,p))\in\left\{\frac{n-a}{a},\frac{n-a-1}{a}\right\} \] with high probability.

math.CO

Compositional Machine Design as Program Synthesis with LLMs

Large language models (LLMs) have shown strong abilities in writing and revising programs, yet many program-synthesis benchmarks still evaluate programs in symbolic or digital environments. We introduce compositional machine design, a physically grounded form of program synthesis where machines are written as programs that compose standardized parts, and success is determined by simulated physical behavior. To study this problem, we present BesiegeField, a testbed built on the machine-building game Besiege. In BesiegeField, LLM agents generate machine programs from textual functional demands, execute the resulting machines in simulation, and receive rewards and state feedback. We benchmark LLM agents across representative machine-design tasks under single-agent generation, iterative editing, and hierarchical workflows. Strong models recover task-relevant structures and sometimes achieve nontrivial physical performance, but often struggle with spatially precise assembly, mechanism-level planning, and translating feedback into useful structural edits. We further finetune Qwen2.5-14B, an open-source LLM, with reinforcement learning from simulation-derived rewards. We find that, under a fixed generation budget, RL improves the best machine discovered. We additionally evaluate human performance to provide a reference point for task difficulty. These results establish compositional machine design as a testbed for studying LLM agents that synthesize executable machine programs and improve them through physical feedback.

cs.AI

Extremal graphs for disjoint union of stars and paths

Let $F$ be a graph. A graph $G$ is called $F$-free if $G$ does not contain $F$ as a subgraph. Let ${\rm EX}(n,F)$ denote the set of $F$-free graphs of order $n$ with the maximum edges. In this paper, we characterize the graphs in ${\rm EX}(n,F)$ for large $n$, where $F$ is the disjoint union of paths and stars. This generalizes a result in \cite{LLP}.

math.CO

Walks, infinite series and spectral radius of graphs

For a graph G, the spectral radius \r{ho}(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we seek the relationship between \r{ho}(G) and the walks of the subgraphs of G. Especially, if G contains a complete multi-partite graph as a spanning subgraph, we give a formula for \r{ho}(G) by using an infinite series on walks of the subgraphs of G. These results are useful for the current popular spectral extremal problem.

math.CO

Spectral radius and maximum matching covered graphs with bounded matching number

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its {\em adjacency matrix}. A {\em matching} of $G$ is a set of disjoint edges of $G$. The {\em matching number} of $G$ is the size of a maximum matching (i.e., a matching with maximum edges). The graph $G$ is called {\em maximum matching covered} if each edge of $G$ is contained in a maximum matching. In this paper, we give a sharp spectral radius condition for graphs with bounded matching number to be maximum matching covered.

math.CO

Spectral radius and edge-disjoint connected factors of graphs

For a graph $G$, the spectral radius of $G$ is the largest eigenvalue of its adjacency matrix. A connected factor of $G$ is a connected spanning subgraph of $G$. For example, a spanning tree of $G$ is a 1-connected factor of $G$. Let $G$ be a graph of order $n$ with minimum degree $δ\geq6$, where $n\geq3δ$. In this paper, we give a sharp spectral radius condition for $G$ to contain $k$ edge-disjoint 2-connected factors and $\left\lfloor\frac{δ-4k}{2}\right\rfloor$ edge-disjoint spanning trees, where $1\leq k\leq\left\lfloor\fracδ{4}\right\rfloor$ is an integer.

math.CO

A lower bound of toughness of regular graphs: in terms of second largest eigenvalue

Let $G$ be a connected (non-complete) $d$-regular graph with $d\geq3$. Let $c(G-S)$ denote the number of components of $G-S$ for any cut $S$ of $G$. The toughness $t(G)$ of $G$ is defined as $\min\left\{\frac{|S|}{c(G-S)}\right\}$, where the minimum is taken over all proper cuts $S$ of $G$. Let $λ_{2}(G)$ denote the second largest eigenvalue of $G$. In this paper, we prove $$t(G)\geq\min\left\{\frac{d+1}{d}(d-λ_{2}(G)),1\right\}.$$

math.CO

Context as Prior: Bayesian-Inspired Intent Inference for Non-Speaking Agents with a Household Cat Testbed

Many agents in real-world environments cannot reliably communicate their goals through language, including household pets, pre-verbal infants, and other non-speaking embodied agents. In such settings, intent must be inferred from incomplete behavioral observations in context-rich environments. This creates a core ambiguity: observable behavior is often noisy or underspecified, while context provides strong prior information but can also induce brittle shortcut predictions if used naively. We present CatSignal, a Bayesian-inspired probabilistic framework for multimodal intent inference that models spatial context as a prior-like constraint and behavioral observations as evidence. Rather than treating context as an ordinary input feature, our method uses a context-gated Product-of-Experts formulation to compute posterior-like intent distributions from context, pose dynamics, and acoustic cues. We instantiate this formulation in a household cat setting as a focused proof-of-concept for intent inference in non-speaking agents. Under Leave-One-Video-Out evaluation on a multimodal domestic cat dataset, the proposed prior-guided fusion achieves the best overall accuracy of 77.72%, outperforming feature concatenation (71.83%) and stronger late-fusion baselines. More importantly, it substantially reduces context-driven shortcut failures in ambiguous cases. While simpler fusion strategies remain competitive in Macro-F1 and selective prediction, the proposed model provides the strongest overall accuracy and the best suppression of context-based shortcut collapse.

cs.CV

A closure result on spanning $k$-trees of graphs with given minimum degree

Let $k\geq2$ be an integer. A $k$-tree is a tree with maximum degree at most $k$. In this paper, we give a closure result on spanning $k$-trees of graphs with given minimum degree. Let $δ\geq1$ be an integer, and $G$ be a connected graph of order $n$ with minimum degree $δ$. Let $u$ and $v$ be two nonadjacent vertices of $G$ satisfying $d_{G}(u)+d_{G}(v)\geq n-1-(k-2)δ$. Then $G$ has a spanning $k$-tree if and only if $G+uv$ has a spanning $k$-tree.

math.CO

How to find all extremal graphs using symmetric subgraphs

Let $\mathcal{F}$ be a finite family of graphs with $\min_{F\in \mathcal{F}}χ(F)=r+1\geq3$, where $χ(F)$ is the chromatic number of $F$. Set $t=\max_{F\in\mathcal{F}}|F|$. Let ${\rm EX}(n,\mathcal{F})$ be the set of graphs with maximum edges among all the graphs of order $n$ without any $F\in\mathcal{F}$ as a subgraph. Let $T(n,r)$ be the Turán graph of order $n$ with $r$ parts. Assume that some $F_{0}\subseteq\mathcal{F}$ is a subgraph of the graph obtained from $T(rt,r)$ by embedding a path in its one part. Simonovits \cite{S1} introduced the concept of symmetric subgraphs, and proved that there exist graphs in ${\rm EX}(n,\mathcal{F})$ which have symmetrical property. In this paper, we aim to find a way to characterize all the extremal graphs for such $\mathcal{F}$ using symmetric subgraphs. Some new extremal results are obtained.

math.CO

Some lemmas on spectral radius of graphs: including an application

For a graph $G$, the spectral radius $ρ(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. In this paper, we give three lammas on $ρ(G)$ when $G$ contains a spanning complete bipartite graph. Using these lemmas and typical spectral method, we characterized the unique extremal graph with the maximum spectral radius among all planar graphs of large order $n$ without a cycle of length $\ell$, where $5\leq \ell\leq n$.

math.CO

EulerESG: Automating ESG Disclosure Analysis with LLMs

Environmental, Social, and Governance (ESG) reports have become central to how companies communicate climate risk, social impact, and governance practices, yet they are still published primarily as long, heterogeneous PDF documents. This makes it difficult to systematically answer seemingly simple questions. Existing tools either rely on brittle rule-based extraction or treat ESG reports as generic text, without explicitly modelling the underlying reporting standards. We present \textbf{EulerESG}, an LLM-powered system for automating ESG disclosure analysis with explicit awareness of ESG frameworks. EulerESG combines (i) dual-channel retrieval and LLM-driven disclosure analysis over ESG reports, and (ii) an interactive dashboard and chatbot for exploration, benchmarking, and explanation. Using four globally recognised companies and twelve SASB sub-industries, we show that EulerESG can automatically populate standard-aligned metric tables with high fidelity (up to 0.95 average accuracy) while remaining practical in end-to-end runtime, and we compare several recent LLM models in this setting. The full implementation, together with a demonstration video, is publicly available at https://github.com/UNSW-database/EulerESG.

cs.CL

Spectral extrema of graphs forbidding a fan

For a graph $G$, its spectral radius is the largest eigenvalue of its adjacency matrix. A fan $H_{\ell}$ is a graph obtained by connecting a single vertex to all vertices of a path of order $\ell\geq4$. Let ${\rm SPEX(n,H_{\ell})}$ be the set of all extremal graphs $G$ of order $n$ with the maximum spectral radius, where $G$ contains no $H_{\ell}$ as a subgraph. In this paper, we completely characterized the graphs in ${\rm SPEX(n,H_{\ell})}$ for any $\ell\geq4$ and sufficiently large $n$. An interesting phenomenon was revealed: ${\rm SPEX(n,H_{2k+2})}\subseteq {\rm SPEX(n,H_{2k+3})}$ for any $k\geq1$ and sufficiently large $n$.

math.CO

A spectral condition for Hamilton cycles in tough bipartite graphs

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its adjacency matrix. For a non-complete bipartite graph $G$ with parts $X$ and $Y$, the {\em bipartite toughness} of $G$ is defined as $t^{B}(G)=\min\left\{\frac{|S|}{c(G-S)}\right\}$, where the minimum is taken over all proper subsets $S\subset X$ (or $S\subset Y$) such that $c(G-S)>1$. In this paper, we give a sharp spectral radius condition for balanced bipartite graphs $G$ with $t^{B}(G)\geq1$ to guarantee that $G$ contains Hamilton cycles. This solves a problem proposed in \cite{CFL}.

math.CO

Spectral conditions for graphs to contain $k$-factors

Let $G$ be a graph. The spectral radius $ρ(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. For an integer $k\geq1$, a $k$-factor of $G$ is a $k$-regular spanning subgraph of $G$. Assume that $k$ and $n$ are integers satisfying $k\geq2,kn\equiv0~(\mod2)$ and $n\geq\max\left\{k^{2}+6k+7,20k+10\right\}$. Let $G$ be a graph of order $n$ and with minimum degree at least $k$. In this paper, we give a sharp lower bound of $ρ(G)$ to guarantee that $G$ contains a $k$-factor.

math.CO

Vertex-based auxiliary space multigrid method and its application to linear elasticity equations

In this paper, a vertex-based auxiliary space multigrid(V-ASMG) method as a preconditioner of the PCG method is proposed for solving the large sparse linear equations derived from the linear elasticity equations. The main key of such V-ASMG method lies in an auxiliary region-tree structure based on the geometrically regular subdivision. The computational complexity of building such a region-tree is $\mathcal{O}\left(q N\log_2 N\right)$, where $N$ is the number of the given original grid vertices and $q$ is the power of the ratio of the maximum distance $d_{max}$ to minimum distance $d_{min}$ between the given original grid vertices. The process of constructing the auxiliary region-tree is similar to the method in [17], but the selection of the representative points is changed. To be more specific, instead of choosing the barycenters, the correspondence between each grid layer is constructed based on the position relationship of the grid vertices. There are two advantages for this approach: the first is its simplicity, there is no need to deal with hanging points when building the auxiliary region-tree, and it is possible to construct the restriction/prolongation operator directly by using the bilinear interpolation function, and it is easy to be generalized to other problems as well, due to all the information we need is only the grid vertices; the second is its strong convergence, the corresponding relative residual can quickly converge to the given tolerance(It is taken to be $10^{-6}$ in this paper), thus obtaining the desired numerical solution. Two- and three-dimensional numerical experiments are given to verify the strong convergence of the proposed V-ASMG method as a preconditioner of the PCG method.

math.NA

Spectral skeletons and applications

For a graph $G$, its spectral radius $ρ(G)$ is the largest eigenvalue of its adjacency matrix. Let $\mathcal{F}$ be a finite family of graphs with $\min_{F\in \mathcal{F}}χ(F)=r+1\geq3$, where $χ(F)$ is the chromatic number of $F$. Set $t=\max_{F\in\mathcal{F}}|F|$. Let $T(rt,r)$ be the Turán graph of order $rt$ with $r$ parts. Assume that some $F_{0}\subseteq\mathcal{F}$ is a subgraph of the graph obtained from $T(rt,r)$ by embedding a path or a matching in one part. Let ${\rm EX}(n,\mathcal{F})$ be the set of graphs with the maximum number of edges among all the graphs of order $n$ containing not any $F\in\mathcal{F}$. Simonovits \cite{S1,S2} gave general results on the graphs in ${\rm EX}(n,\mathcal{F})$. Let ${\rm SPEX}(n,\mathcal{F})$ be the set of graphs with the maximum spectral radius among all the graphs of order $n$ containing not any $F\in\mathcal{F}$. Motivated by the work of Simonovits, we characterize the specified structure of the graphs in ${\rm SPEX}(n,\mathcal{F})$ in this paper. Moreover, some applications are also included.

math.CO

Extremal graphs for disjoint union of vertex-critical graphs

For a graph $F$, let ${\rm EX}(n,F)$ be the set of $F$-free graphs of order $n$ with the maximum number of edges. The graph $F$ is called vertex-critical, if the deletion of its some vertex induces a graph with smaller chromatic number. For example, an odd wheel (obtained by connecting a vertex to a cycle of even length) is a vertex-critical graph with chromatic number 3. For $h\geq2$, let $F_{1},F_{2},...,F_{h}$ be vertex-critical graphs with the same chromatic number. Let $\cup_{1\leq i\leq h}F_{i}$ be the disjoint union of them. In this paper, we characterize the graphs in ${\rm EX}(n,\cup_{1\leq i\leq h}F_{i})$, when there is a proper order among the graphs $F_{1},F_{2},...,F_{h}$. This solves a conjecture (on extremal problem for disjoint union of odd wheels) proposed by Xiao and Zamora \cite{XZ}.

math.CO