Searcharxiv⌕ Search

arXiv subjects

Minhao Zhang

Publications and source records attributed to Minhao Zhang.

At least 19 recordsLinked to original sources

A proof of the Theta conjecture

We prove the touching refinement of the Theta conjecture of Interdonato and Iraci, giving a formula for $Θ_{e_\ell}Θ_{e_k}\nabla E_{d,j}$ as a weighted sum over parking functions with decorated rises and valleys and touch number $j$. Summing over $j$ gives the Theta conjecture. As corollaries, we prove the valley Delta conjecture of Haglund, Remmel, and Wilson and its generalized version proposed by Qiu and Wilson. Our proof compares algebraic and combinatorial recurrences using an extension of the plethystic substitution $X\mapsto(q-1)X$ to quasisymmetric functions. The algebraic recurrence follows from an endomorphism constructed by D'Adderio, Interdonato, Iraci and Pagaria on the Dyck path algebra of Carlsson and Mellit. The combinatorial recurrence is obtained by introducing signed labels and deleting the main diagonal. The two recurrences have the same initial conditions, which identifies the corresponding generating functions.

math.CO↗

The Schur positivity of Lucas binomial differences

For positive integers $a\le b\le c\le d$ with $ad=bc$, we prove that the Lucas binomial coefficients satisfy $(-1)^{a+1}(L_{b,c}[X]-L_{a,d}[X])\in\mathbb{N}[e_1[X],e_2[X],h_2[X]]$, resolving Bergeron's conjecture on Schur positivity in two variables. We also prove the same positivity for $L_{u,v}[X]-e_1[X]^{uv-rs}L_{r,s}[X]$ when $rs<uv$. Using Lucas atoms, we establish $e$-positivity for degree-adjusted Lucas multinomial differences under dominance order.

math.CO↗

Single-Loop Stochastic Projected Damped Extragradient Methods for Nonconvex--(Strongly) Concave Minimax Optimization

We develop single-loop stochastic projected damped extragradient methods for nonconvex--(strongly) concave minimax optimization, with complexity guarantees for both game stationarity (GS) and optimization stationarity (OS). Our approach combines a stochastic projected damped extragradient (SPDE) method with a recursive variance-reduced variant, VR-SPDE, both of which retain a single-loop structure. Under an unbiased stochastic gradient oracle with uniformly bounded variance, SPDE finds an $\varepsilon$-game-stationary point with stochastic first-order oracle (SFO) complexities of $O(κ\varepsilon^{-4})$ and $O(\varepsilon^{-5})$ in the nonconvex--strongly concave and nonconvex--concave settings, respectively, where $κ=L/μ$. Under an additional mean-square Lipschitz condition on the stochastic gradients, VR-SPDE improves these GS complexities to $O(κ^{3/2}\varepsilon^{-3})$ and $O(\varepsilon^{-9/2})$, respectively. For an $\varepsilon$-optimization-stationary point, SPDE achieves SFO complexities of $O(κ\varepsilon^{-4})$ and $O(\varepsilon^{-6})$, while VR-SPDE achieves $O(κ^{3/2}\varepsilon^{-3})$ and $O(\varepsilon^{-6})$, in the two settings, respectively. These OS guarantees match the best-known bounds achieved by multi-loop methods while preserving a single-loop implementation. To the best of our knowledge, our results provide the best-known SFO complexity guarantees among single-loop stochastic first-order methods for the respective stationarity criteria and problem classes.

math.OC↗

The $(km,kn)$-square paths theorem

For positive integers $k,m,n$ with $\gcd(m,n)=1$, we prove a $(km,kn)$-square paths theorem: the symmetric function $(-1)^{k-1}\frac{[km]_q}{[k]_q}p_k[-MX^{m,n}]\cdot1$ is a weighted sum over $(km,kn)$-preference functions. This proves a corrected form of the conjecture of Iraci, Pagaria, Paolini, and Vanden Wyngaerd and generalizes the square paths theorem of Sergel. We encode preference functions by row strict tableaux and closed walks on a set of states, compare them with parking functions for each value of the touch statistic, and apply Mellit's compositional $(km,kn)$-shuffle theorem. Finally, we establish a fall Delta square theorem conjectured by Iraci, Pagaria, and Paolini.

math.CO↗

The nabla operator, Hall--Littlewood polynomials and LLT polynomials

Bergeron, Garsia, Haiman, and Tesler conjectured that $(-1)^{n-\ell(μ)}\nabla\widetilde H_μ[X;0,t]$ and $\nablaω\widetilde H_μ[X;0,t^{-1}]$ are Schur positive, and that $\nablaω\widetilde H_μ[X;0,t^{-1}]-\nablaω\widetilde H_ν[X;0,t^{-1}]$ is Schur positive when $μ$ dominates $ν$. The first statement follows from the compositional shuffle conjecture of Haglund, Morse, and Zabrocki, proved by Carlsson and Mellit. We prove the other two statements. All three statements also hold for $\nabla^r$ with $r\geq1$. The main new step is an identity: when $μ$ covers $ν$, the difference $ω\widetilde H_μ[X;0,t^{-1}]-ω\widetilde H_ν[X;0,t^{-1}]$ is minus a power of $t$ times one LLT polynomial. Using the Catalanimals and the Cauchy identity of Blasiak, Haiman, Morse, Pun, and Seelinger, we show that $\nabla^r$ of this LLT polynomial is, up to sign, a positive sum of LLT polynomials. We also extend the main results to the Schiffmann algebra setting.

math.CO↗

Near-Optimal Single-Loop Predictor--Corrector Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization

We study smooth strongly convex--strongly concave minimax optimization in the deterministic unconstrained setting, without assuming a bilinear or separable structure. Although existing multi-loop methods attain near-optimal condition-number dependence, standard single-loop methods generally exhibit a substantial complexity gap. To close this gap, we propose the Single-Loop Predictor--Corrector Extragradient Method with Damped Momentum (PCE-DM), which combines an extragradient prediction--correction scheme with a novel auxiliary feedback recursion for the weaker-curvature variable. PCE-DM uses fixed parameters and two new full-gradient evaluations per iteration after one initialization query, while requiring no inner solves, accuracy schedules, or staged restarts. We develop a Lyapunov analysis that controls the predictor--corrector mismatch through corrected-gradient increments and establish last-iterate linear convergence. Specifically, PCE-DM computes an $\varepsilon$-accurate relative solution, measured by the squared Euclidean distance to the saddle point, within $\mathcal{O}\!\left(\sqrt{κ_xκ_y} \log(2κ_xκ_y/\varepsilon)\right)$ full-gradient queries. This result closes the condition-number complexity gap between standard single-loop methods and near-optimal multi-loop methods, matching the known lower-bound order up to logarithmic factors while retaining fixed, explicit single-loop updates. Numerical experiments on regularized linear regression and AUC maximization demonstrate the computational efficiency of PCE-DM.

math.OC↗

The Schur positivity of $\nabla m_μ$

Bergeron, Garsia, Haiman and Tesler conjectured in 1999 that, for all partitions $μ,λ\vdash n$, the polynomial $(-1)^{|μ|-\ell(μ)}\langle \nabla m_μ, s_λ\rangle$ has nonnegative integer coefficients, where $\nabla$ is the Bergeron--Garsia nabla operator, which acts diagonally on the modified Macdonald basis, and $m_μ$ is the monomial symmetric function. In this article, we prove this conjecture, and more generally that $(-1)^{|μ|-\ell(μ)}\langle\nabla^r m_μ,s_λ\rangle\in\mathbb{N}[q,t]$ for all $r\geq 1$. We establish a recursion showing that $(-1)^{|μ|-\ell(μ)}m_μ$ has an expansion with coefficients in $\mathbb{Q}_{\geq 0}[q]$ in the symmetric functions $C_α(1)$, where $C_a$ denotes the operator introduced by Haglund, Morse and Zabrocki. Combining this expansion with the compositional shuffle theorems of Carlsson--Mellit and Mellit, and with the Schur positivity of LLT polynomials, completes the proof. The same method, using the $e$-positivity of column LLT polynomials after the substitution $q\mapsto q+1$, also gives an $e$-positive analogue.

math.CO↗

Higher odd-order nonlinear Hall effect in magnetic topological insulator Mn(Bi1-xSbx)2Te4

The nonlinear Hall effect is a new member of the Hall effect family, which attracts intense research interests, and it is closely related to the quantum geometry of quantum materials. The previous studies primarily concentrate on the second-order and third-order nonlinear Hall effect. However, the experimental study of higher-order nonlinear Hall effect is scarce at present. In this work, we report the observations of the higher odd-order (third-, fifth-, seventh-order) nonlinear Hall effect in magnetic topological insulator Mn(Bi1-xSbx)2Te4 thin flakes. The higher odd-order nonlinear Hall voltage exhibits a twofold angular dependence and exists only below the Néel temperature. It reaches its maximum near the charge neutral point and decays exponentially as the order of the nonlinear Hall effect increases. Furthermore, such higher odd-order nonlinear Hall effect is observed in both odd- and even-layer samples with comparable magnitudes. Theoretical analysis indicates that the higher odd-order nonlinear Hall effect responses may arise from the Berry curvature multipoles. Our work paves the way for the study of the higher-order nonlinear transport phenomena.

cond-mat.mes-hall↗

Room-temperature third-order nonlinear anomalous Hall effect in ferromagnetic metal Fe3GaTe2

Berry curvature, as the imaginary component of quantum geometry, plays a crucial role in condensed matter physics. The spatial distribution of Berry curvature can be characterized by its dipole and multipole moments, which can induce the nonlinear anomalous Hall effect (NLAHE). To date, the NLAHE has been demonstrated in various materials, yet reports on room-temperature NLAHE are still limited. In this work, we report the observation of the third-order NLAHE in ferromagnetic metal Fe3GaTe2. The third-order NLAHE shows hysteretic behavior with the variation of magnetic field, where the coercive field is the same as that of the anomalous Hall effect, and the third-order NLAHE remains observable up to the Curie temperature (~350 K). The scaling analysis suggests that the third-order NLAHE may be attributed to the Berry curvature quadrupole. Our work not only provides an approach to study magnetic materials through nonlinear electric transports, but also opens up possibilities for the future development of room-temperature third-order nonlinear electronic devices.

cond-mat.mtrl-sci↗

The nonsymmetric compositional Delta theorem

Extending the symmetric framework of D'Adderio and Mellit, we establish a nonsymmetric generalization of the compositional Delta theorem. Building on Blasiak et al.'s theory of flagged LLT polynomials, we derive signed and unsigned nonsymmetric identities evaluated in terms of flagged LLT polynomials. Furthermore, by introducing nonsymmetric variants of the $\nabla$ and $τ^*$ operators, we obtain a novel operator formulation. We show that applying Weyl symmetrization to these nonsymmetric identities systematically recovers the original compositional Delta theorem. Finally, we propose analogous conjectures regarding stable atom positivity.

math.CO↗

A Sc2C2@C88 cluster based ultra-compact multi-level probabilistic bit for matrix multiplication

Information units are progressively approaching the fundamental physical limits of the integration density, including in terms of extremely small sizes, multistates and probabilistic traversal. However, simultaneously encompassing all of these characteristics in a unit remains elusive. Here, via real-time in situ electrical monitoring, we clearly observed stochastic alterations of multiple conductance states in Sc2C2@C88. The true random bit sequence generated exhibited an autocorrelation function whose confidence interval fell within \pm 0.02, demonstrating high-quality randomness. The alterations of multiple conductance states are controllable, that is, whose probability distributions could traverse from 0 to 1, enabling us to factorize 551 into its prime factors. Furthermore, we proposed a matrix-chain multiplication scheme and experimentally verified the multiplication of two 4 \times 4 state-transition matrices with a small maximum error < 0.05. Combined with theoretical calculations, the stochastic but controllable multistates are probably attributed to the rich energy landscape, which could be stepwise changed by the electric field. Our findings reveal extremely small multi-level probabilistic bit for matrix multiplication, which pave the way for ultracompact intelligent electronic devices.

cond-mat.mtrl-sci↗

Leveraging Large Language Model as Simulated Patients for Clinical Education

Simulated Patients (SPs) play a crucial role in clinical medical education by providing realistic scenarios for student practice. However, the high cost of training and hiring qualified SPs, along with the heavy workload and potential risks they face in consistently portraying actual patients, limit students' access to this type of clinical training. Consequently, the integration of computer program-based simulated patients has emerged as a valuable educational tool in recent years. With the rapid development of Large Language Models (LLMs), their exceptional capabilities in conversational artificial intelligence and role-playing have been demonstrated, making them a feasible option for implementing Virtual Simulated Patient (VSP). In this paper, we present an integrated model-agnostic framework called CureFun that harnesses the potential of LLMs in clinical medical education. This framework facilitates natural conversations between students and simulated patients, evaluates their dialogue, and provides suggestions to enhance students' clinical inquiry skills. Through comprehensive evaluations, our approach demonstrates more authentic and professional SP-scenario dialogue flows compared to other LLM-based chatbots, thus proving its proficiency in simulating patients. Additionally, leveraging CureFun's evaluation ability, we assess several medical LLMs and discuss the possibilities and limitations of using LLMs as virtual doctors from the perspective of their diagnostic abilities.

cs.CL↗

Electrically controlled nonvolatile switching of single-atom magnetism in a Dy@C84 single-molecule transistor

Single-atom magnetism switching is a key technique towards the ultimate data storage density of computer hard disks and has been conceptually realized by leveraging the spin bistability of a magnetic atom under a scanning tunnelling microscope. However, it has rarely been applied to solid-state transistors, an advancement that would be highly desirable for enabling various applications. Here, we demonstrate realization of the electrically controlled Zeeman effect in Dy@C84 single-molecule transistors, thus revealing a transition in the magnetic moment from 3.8 μB to 5.1 μB for the ground-state GN at an electric field strength of 3-10 MV/cm. The consequent magnetoresistance significantly increases from 600% to 1100% at the resonant tunneling point. Density functional theory calculations further corroborate our realization of nonvolatile switching of single-atom magnetism, and the switching stability emanates from an energy barrier of 92 meV for atomic relaxation. These results highlight the potential of using endohedral metallofullerenes for high-temperature, high-stability, high-speed, and compact single-atom magnetic data storage.

cond-mat.mtrl-sci↗

Two is Better Than One: Answering Complex Questions by Multiple Knowledge Sources with Generalized Links

Incorporating multiple knowledge sources is proven to be beneficial for answering complex factoid questions. To utilize multiple knowledge bases (KB), previous works merge all KBs into a single graph via entity alignment and reduce the problem to question-answering (QA) over the fused KB. In reality, various link relations between KBs might be adopted in QA over multi-KBs. In addition to the identity between the alignable entities (i.e. full link), unalignable entities expressing the different aspects or types of an abstract concept may also be treated identical in a question (i.e. partial link). Hence, the KB fusion in prior works fails to represent all types of links, restricting their ability to comprehend multi-KBs for QA. In this work, we formulate the novel Multi-KB-QA task that leverages the full and partial links among multiple KBs to derive correct answers, a benchmark with diversified link and query types is also constructed to efficiently evaluate Multi-KB-QA performance. Finally, we propose a method for Multi-KB-QA that encodes all link relations in the KB embedding to score and rank candidate answers. Experiments show that our method markedly surpasses conventional KB-QA systems in Multi-KB-QA, justifying the necessity of devising this task.

cs.CL↗

ADMUS: A Progressive Question Answering Framework Adaptable to Multiple Knowledge Sources

With the introduction of deep learning models, semantic parsingbased knowledge base question answering (KBQA) systems have achieved high performance in handling complex questions. However, most existing approaches primarily focus on enhancing the model's effectiveness on individual benchmark datasets, disregarding the high costs of adapting the system to disparate datasets in real-world scenarios (e.g., multi-tenant platform). Therefore, we present ADMUS, a progressive knowledge base question answering framework designed to accommodate a wide variety of datasets, including multiple languages, diverse backbone knowledge bases, and disparate question answering datasets. To accomplish the purpose, we decouple the architecture of conventional KBQA systems and propose this dataset-independent framework. Our framework supports the seamless integration of new datasets with minimal effort, only requiring creating a dataset-related micro-service at a negligible cost. To enhance the usability of ADUMS, we design a progressive framework consisting of three stages, ranges from executing exact queries, generating approximate queries and retrieving open-domain knowledge referring from large language models. An online demonstration of ADUMS is available at: https://answer.gstore.cn/pc/index.html

cs.CL↗

Joint Channel Estimation and Turbo Equalization of Single-Carrier Systems over Time-Varying Channels

Block transmission systems have been proven successful over frequency-selective channels. For time-varying channel such as in high-speed mobile communication and underwater communication, existing equalizers assume that channels over different data frames are independent. However, the real-world channels over different data frames are correlated, thereby indicating potentials for performance improvement. In this paper, we propose a joint channel estimation and equalization/decoding algorithm for a single-carrier system that exploits temporal correlations of channel between transmitted data frames. Leveraging the concept of dynamic compressive sensing, our method can utilize the information of several data frames to achieve better performance. The information not only passes between the channel and symbol, but also the channels over different data frames. Numerical simulations using an extensively validated underwater acoustic model with a time-varying channel establish that the proposed algorithm outperforms the former bilinear generalized approximate message passing equalizer and classic minimum mean square error turbo equalizer in bit error rate and channel estimation normalized mean square error. The algorithm idea we present can also find applications in other bilinear multiple measurements vector compressive sensing problems.

eess.SP↗

Fano Interference in a Single-Molecule Junction

Trends of miniaturized devices and quantum interference electronics lead to the long desire of Fano interference in single-molecule junctions, here, which is successfully demonstrated using the 2,7-di(4-pyridyl)-9,9'-spirobifluorene molecule with a long backbone group and a short side group. Experimentally, the two electrically coupled groups are found to contribute to two blurred degenerate points in the differential conductance mapping. This forms a characteristic non-centrosymmetric double-crossing feature, with distinct temperature response for each crossing. Theoretically, we describe the practical in-junction electron transmission using a new two-tunnelling-channel coupling model and obtain a working formula with a Fano term and a Breit-Wigner term. The formula is shown to provide a good fit for all the mapping data and their temperature dependence in three dimensions, identifying the Fano component. Our work thus forms a complete set of evidence of the Fano interference in a single-molecule junction induced by two-tunnelling-channel coupling transport. Density functional theory calculations are used to corroborate this new physics.

cond-mat.mes-hall↗

Crake: Causal-Enhanced Table-Filler for Question Answering over Large Scale Knowledge Base

Semantic parsing solves knowledge base (KB) question answering (KBQA) by composing a KB query, which generally involves node extraction (NE) and graph composition (GC) to detect and connect related nodes in a query. Despite the strong causal effects between NE and GC, previous works fail to directly model such causalities in their pipeline, hindering the learning of subtask correlations. Also, the sequence-generation process for GC in previous works induces ambiguity and exposure bias, which further harms accuracy. In this work, we formalize semantic parsing into two stages. In the first stage (graph structure generation), we propose a causal-enhanced table-filler to overcome the issues in sequence-modelling and to learn the internal causalities. In the second stage (relation extraction), an efficient beam-search algorithm is presented to scale complex queries on large-scale KBs. Experiments on LC-QuAD 1.0 indicate that our method surpasses previous state-of-the-arts by a large margin (17%) while remaining time and space efficiency. The code and models are available at https://github.com/AOZMH/Crake.

cs.CL↗