Searcharxiv⌕ Search

arXiv subjects

Huajun Zhang

Publications and source records attributed to Huajun Zhang.

At least 19 recordsLinked to original sources

The maximum product of nontrivial cross $t$-intersecting families

Let $\mathcal A$ and $\mathcal B$ be nonempty families of $k$-subsets of $\{1,\ldots,n\}$ such that $|A\cap B|\ge t$ for all $A\in\mathcal A$ and $B\in\mathcal B$, and suppose that each family has fewer than $t$ common elements. For $k\ge t+2\ge4$ and $n\ge(t+1)(k-t+1)$, we prove \[ |\mathcal A||\mathcal B|\le\max\{h_t(n,k)^2,b_t(n,k)^2\}, \] where \[ h_t(n,k)=\binom{n-t}{k-t}-\binom{n-k-1}{k-t}+t,\quad b_t(n,k)=(t+2)\binom{n-t-2}{k-t-1}+\binom{n-t-2}{k-t-2}. \] The bound is sharp, and we characterize all extremal pairs, whose families have equal sizes but need not coincide. The proof combines clique lifts, exchanges of generating families and a density inequality for cross-intersecting uniform layers. This gives a product version of the Hilton--Milner--Frankl theorem throughout the Erdős--Ko--Rado range. In particular, it answers a question of Wen and Lv on whether a threshold of order $kt$ suffices for the sharp product bound.

math.CO↗

Beyond Frankl's conjecture: Maximum sum of sizes of cross-intersecting families with restricted conditions

Let $\mathcal{F}$ and $\mathcal{G}$ be two families of subsets of $[n]$. We say that $\mathcal{F}$ and $\mathcal{G}$ are \emph{cross-intersecting} if $F \cap G \neq \emptyset$ for all $F \in \mathcal{F}$ and $G \in \mathcal{G}$. Let $n, k_1, k_2, m, r, t$ be positive integers satisfying $n > k_1 + k_2$. Suppose that $\mathcal{F} \subseteq \binom{[n]}{k_1}$ and $\mathcal{G} \subseteq \binom{[n]}{k_2}$ are two cross-intersecting families such that $\left\{F \in \binom{[n]}{k_1} : |F \cap [m]| \geq r\right\} \subseteq \mathcal{F}$ and $\mathcal{F}$ is $t$-intersecting. In this paper, we determine the maximum sum $|\mathcal{F}| + |\mathcal{G}|$ under these assumptions. By taking $k_1=k_2+t-1$, $m = k_2+t+s-1$ and $r=k_2+t-1$ for $s\ge 0$, our result recovers a conjecture of Frankl \cite{frankl2016new}, which was recently confirmed by Wu, Feng, and Li \cite{wu2025proof}. Further, we establish a complete characterization of all extremal families. Our approach extends the Ahlswede--Khachatrian generating set method to handle the simultaneous constraints of cross-intersection and $t$-intersection, subject to additional structural conditions.

math.CO↗

The sum of sizes of nontrivial cross-intersecting families

Families $\mathcal A_1,\ldots,\mathcal A_m\subseteq\binom{[n]}k$ are cross-intersecting if every member of one family meets every member of each other family. A family is nontrivial if its members have no common element. For $n>2k$ and $m\ge3$, we determine the maximum sum of the sizes of $m$ nonempty, nontrivial cross-intersecting families. We prove the sharp bound \[ \sum_{i=1}^{m}|\mathcal A_i| \le \max\bigl\{m\,h(n,k,1),\ g(n,k)+3(m-1)\bigr\}, \] where \[ h(n,k,1)=\binom{n-1}{k-1}-\binom{n-k-1}{k-1}+1 \] and \[ g(n,k)=\binom nk-2\binom{n-k}k -\binom{n-k-1}{k-1}+\binom{n-2k+1}k. \] We also characterize all equality cases. Two types of extremal configurations arise: copies of a maximum nontrivial intersecting family, and copies of a specific three-member nontrivial intersecting family together with its full cross-intersecting companion. The proof applies a known restricted lexicographic comparison to obtain the weighted bound for shifted families, and uses local generator reductions for critically shifted families. These reductions exploit shiftedness after removing the common core of a section, while preserving nontriviality and the required shadow relations between sections.

math.CO↗

Large Maximal Intersecting Families with Covering Number Three

Let $n>2k$ and $k\ge4$. The largest size of an intersecting family of $k$-subsets of $[n]$ with covering number at least three is \[ g_1(n,k)=\binom{n-1}{k-1}-3\binom{n-k-1}{k-1}+\binom{n-k-2}{k-1}+\binom{n-2k}{k-1}+3, \] attained by a unique family up to isomorphism. We prove that every other maximal intersecting family $\mathcal F$ with covering number three satisfies \[ |\mathcal F|\le M(n,k)=\max\{q(n,k),g_2(n,k)\}, \] where \begin{align*} q(n,k)&=\binom{n-1}{k-1}-3\binom{n-k-1}{k-1}+\binom{n-k-3}{k-1}+\binom{n-2k+1}{k-1}+3,\\ g_2(n,k)&=g_1(n,k)-\binom{n-k-3}{k-3}+1. \end{align*} This bound is attained for every $n>2k$ and $k\ge4$, so $M(n,k)$ is the second largest distinct size. For $k=4$, $g_1(n,4)=13n-69$ and $M(n,4)=12n-61$. For $k\ge5$, we have $M(n,k)=q(n,k)$ when $2k<n\le3k-2$ and $M(n,k)=g_2(n,k)$ when $n\ge3k-2$; the two terms coincide only at $n=3k-2$. We also classify all families attaining $M(n,k)$ that admit a critically shifted labeling, including additional nonisomorphic families at $n=2k+1$. The proof combines local replacements with an inverse-shift estimate and gives a new proof of the known maximum and its uniqueness.

math.CO↗

Sizes of cross-intersecting families

The size of cross-intersecting families ${\cal F}_1, \dots, {\cal F}_d$ is usually measured by the sum or the product of the sizes $|{\cal F}_i|$. These two natural size functions have different extremal structures, and different techniques have been developed for them. We introduce the cross-degree of a size function and show that the potential extremal structures of maximum cross-intersecting families are the same for all size functions of finite cross-degree, including the sum and the product. Our main tool is a strengthened form of the generating family method of Ahlswede--Khachatrian, based on standard generating families and on local modifications of cross-intersecting families, which we call mutations. It treats two completely different types of extremal structures in a unified way and, unlike the original method, needs shifting in only one step.

math.CO↗

On the product of nontrivial cross-intersecting families

Let $n\geq2\ell\geq2k\geq6$ and $n>k+\ell$. We determine the maximum of $|\mathcal A||\mathcal B|$ over all nonempty, nontrivial cross-intersecting families $\mathcal A\subseteq\binom{[n]}k$ and $\mathcal B\subseteq\binom{[n]}\ell$. The exact bound is $|\mathcal A||\mathcal B|\leq\max\{M_1,M_2\}$, where \[ \begin{aligned} M_1 &=\left(\binom{n-1}{k-1}-\binom{n-\ell-1}{k-1}+1\right) \left(\binom{n-1}{\ell-1}-\binom{n-k-1}{\ell-1}+1\right),\\ M_2 &=\left(\binom{n-2}{\ell-2}+1\right) \sum_{i=1}^{2} \left(\binom{n-i}{k-1}-\binom{n-\ell-i}{k-1}\right). \end{aligned} \] Both terms are attained by explicit constructions: a Hilton--Milner-type pair and a two-point construction, respectively. We classify all equality cases, including the additional cross-triangle pairs when $k=\ell=3$. Two structural results underlie the proof. First, we establish a restricted-lex comparison theorem showing that restricted lexicographic initial segments minimize disjointness neighborhoods, and characterize equality at the first nontrivial threshold. Second, a decomposition of critically shifted families into two parts with disjoint cores leads to a sharp product theorem, with equality characterized, for all cross-intersecting pairs admitting this decomposition, without additional nontriviality assumptions. Endpoint comparisons and reverse shifting complete the proof for unequal as well as equal uniformities.

math.CO↗

Non-trivial intersecting families for direct products

A family of sets is intersecting if any two of its sets intersect, and non-trivial intersecting if there is not any element which appears in every set of the family. The study of intersection problems (or Erdős-Ko-Rado problems) on families of sets is one of the most important topics in extremal combinatorics. A natural extension of the Erdős-Ko-Rado problem in direct products setting was introduced by Frankl, and developed by Alon and Katona et al. In 2018, Kwan, Sudakov and Vieira [J. Combin. Theory, Ser. A 156 (2018), 44--60] determine the maximum size of a non-trivial intersecting direct product family under the assumption that the sizes of all parts are sufficiently large relative to the set sizes in all parts. Meanwhile, they raised the question of whether this result holds for the size of each part which depends only on its corresponding set size, and the question of characterizing the extremal families. In the present paper, we answere these two questions. Furthermore, the bounds on the size of each part in our result are best possible.1

math.CO↗

The Erdős-Ko-Rado Theorem in $\ell_2$-Norm

The codegree squared sum ${\rm co}_2(\cal F)$ of a family (hypergraph) $\cal F \subseteq \binom{[n]} k$ is defined to be the sum of codegrees squared $d(E)^2$ over all $E\in \binom{[n]}{k-1}$, where $d(E)=|\{F\in \cal F: E\subseteq F\}|$. Given a family of $k$-uniform families $\mathscr H$, Balogh, Clemen and Lidický recently introduced the problem to determine the maximum codegree squared sum ${\rm co}_2(\cal F)$ over all $\mathscr H$-free $\cal F$. In the present paper, we consider the families which has as forbidden configurations all pairs of sets with intersection sizes less than $t$, that is, the well-known $t$-intersecting families. We prove the following Erdős-Ko-Rado Theorem in $\ell_2$-norm, which confirms a conjecture of Brooks and Linz. Let $t,k,n$ be positive integers such that $t\leq k\leq n$. If a family $\mathcal F\subseteq \binom{[n]}{k}$ is $t$-intersecting, then for $n\ge (t+1)(k-t+1)$, we have \[{\rm co}_2(\cal F)\le {\binom{n-t}{k-t}}(t+(n-k+1)(k-t)),\] equality holds if and only if $\mathcal{F}=\{F\in {\binom{[n]}{k}}: T\subset F\}$ for some $t$-subset $T$ of $[n]$. In addition, we prove a Frankl-Hilton-Milner Theorem in $\ell_2$-norm for $t\ge 2$, and a generalized Turán result, i.e., we determine the maximum number of copies of tight path of length 2 in $t$-intersecting families.

math.CO↗

Structured Prompt Optimization for Few-Shot Text Classification via Semantic Alignment in Latent Space

This study addresses the issues of semantic entanglement, unclear label structure, and insufficient feature representation in few-shot text classification, and proposes an optimization framework based on structured prompts to enhance semantic understanding and task adaptation under low-resource conditions. The framework first uses a pretrained language model to encode the input text and obtain basic semantic representations. It then introduces structured prompts composed of multi-dimensional semantic factors and integrates them with text features through a learnable combination mechanism, which forms task-related representations with clear boundaries in the latent space. To further strengthen the consistency between text representations and label semantics, the method constructs a structured label embedding matrix and employs a cross-space alignment mechanism to ensure stable matching between textual features and label attributes. In addition, the model applies prompt orthogonality constraints and a joint optimization objective to maintain independence across different semantic factors in the prompts, allowing the structured prompts to provide transparent and controllable guidance for classification decisions. Three types of sensitivity experiments, including learning rate sensitivity, prompt length sensitivity, and data scale sensitivity, are designed to evaluate the stability and robustness of the framework under different conditions. Experimental results show that the proposed structured prompt optimization framework effectively alleviates semantic conflicts and label ambiguity in few-shot text classification. It significantly improves performance on accuracy, precision, recall, and AUC, and demonstrates strong cross-task applicability.

cs.CL↗

Contrastive Knowledge Transfer and Robust Optimization for Secure Alignment of Large Language Models

This paper addresses the limitations of large-scale language models in safety alignment and robustness by proposing a fine-tuning method that combines contrastive distillation with noise-robust training. The method freezes the backbone model and transfers the knowledge boundaries of the teacher model to the student model through distillation, thereby improving semantic consistency and alignment accuracy. At the same time, noise perturbations and robust optimization constraints are introduced during training to ensure that the model maintains stable predictive outputs under noisy and uncertain inputs. The overall framework consists of distillation loss, robustness loss, and a regularization term, forming a unified optimization objective that balances alignment ability with resistance to interference. To systematically validate its effectiveness, the study designs experiments from multiple perspectives, including distillation weight sensitivity, stability analysis under computation budgets and mixed-precision environments, and the impact of data noise and distribution shifts on model performance. Results show that the method significantly outperforms existing baselines in knowledge transfer, robustness, and overall safety, achieving the best performance across several key metrics. This work not only enriches the theoretical system of parameter-efficient fine-tuning but also provides a new solution for building safer and more trustworthy alignment mechanisms.

cs.CL↗

Integrating Structure-Aware Attention and Knowledge Graphs in Explainable Recommendation Systems

This paper designs and implements an explainable recommendation model that integrates knowledge graphs with structure-aware attention mechanisms. The model is built on graph neural networks and incorporates a multi-hop neighbor aggregation strategy. By integrating the structural information of knowledge graphs and dynamically assigning importance to different neighbors through an attention mechanism, the model enhances its ability to capture implicit preference relationships. In the proposed method, users and items are embedded into a unified graph structure. Multi-level semantic paths are constructed based on entities and relations in the knowledge graph to extract richer contextual information. During the rating prediction phase, recommendations are generated through the interaction between user and target item representations. The model is optimized using a binary cross-entropy loss function. Experiments conducted on the Amazon Books dataset validate the superior performance of the proposed model across various evaluation metrics. The model also shows good convergence and stability. These results further demonstrate the effectiveness and practicality of structure-aware attention mechanisms in knowledge graph-enhanced recommendation.

cs.IR↗

On cross-2-intersecting families

Two families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$ are called cross-$t$-intersecting if $|A\cap B|\geq t$ for all $A\in\mathcal A$, $B\in\mathcal B$. Let $n$, $k$ and $\ell$ be positive integers such that $n\geq 3.38\ell$ and $\ell\geq k\geq 2$. In this paper, we will determine the upper bound of $|\mathcal A||\mathcal B|$ for cross-$2$-intersecting families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$. The structures of the extremal families attaining the upper bound are also characterized. The similar result obtained by Tokushige can be considered as a special case of ours when $k=\ell$, but under a more strong condition $n>3.42k$. Moreover, combined with the results obtained in this paper, the complicated extremal structures attaining the upper bound for nontrivial cases can be relatively easy to reach with similar techniques.

math.CO↗

Non-uniform Cross-intersecting Families

Let $m\geq 2$, $n$ be positive integers, and $R_i=\{k_{i,1} >k_{i,2} >\cdots> k_{i,t_i}\}$ be subsets of $[n]$ for $i=1,2,\ldots,m$. The families $\mathcal{F}_1\subseteq \binom{[n]}{R_1},\mathcal{F}_2\subseteq \binom{[n]}{R_2},\ldots,\mathcal{F}_m\subseteq \binom{[n]}{R_m}$ are said to be non-empty cross-intersecting if for each $i\in [m]$, $\mathcal{F}_i\neq\emptyset$ and for any $A\in \mathcal{F}_i,B\in\mathcal{F}_j$, $1\leq i<j\leq m$, $|A\bigcap B|\geq1$. In this paper, we determine the maximum value of $\sum_{j=1}^{m}|\mathcal{F}_j|$ for non-empty cross-intersecting family $\mathcal{F}_1, \mathcal{F}_2,\ldots,\mathcal{F}_m$ when $n\geq k_1+k_2$, where $k_1$ (respectively, $k_2$) is the largest (respectively, second largest) value in $\{k_{1,1},k_{2,1},\ldots,k_{m,1}\}$. This result is a generalization of the results by Shi, Frankl and Qian \cite{shi2022non} on non-empty cross-intersecting families. Moreover, the extremal families are completely characterized.

math.CO↗

Exact extremal non-trivial cross-intersecting families

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are called cross-intersecting if each pair of sets $A\in \mathcal{A}$ and $B\in \mathcal{B}$ has nonempty intersection. Let $\cal{A}$ and ${\cal B}$ be two cross-intersecting families of $k$-subsets and $\ell$-subsets of $[n]$. Matsumoto and Tokushige [J. Combin. Theory Ser. A 52 (1989) 90--97] studied the extremal problem of the size $|\cal{A}||\cal{B}|$ and obtained the uniqueness of extremal families whenever $n\ge 2 \ell\ge 2k$, building on the work of Pyber. This paper will explore the second extremal size of $|\cal{A}||\cal{B}|$ and obtain that if $\mathcal{A}$ and $\mathcal{B}$ are not the subfamilies of Matsumoto--Tokushige's extremal families, then, for $n\ge 2\ell >2k$ or $n> 2\ell=2k$, \begin{itemize} \item[1)]either $|\cal{A}||\cal{B}|\le \left({\binom{n-1}{k-1}}+{\binom{n-2 }{k-1}}\right){\binom{n-2}{\ell-2}}$ with the unique extremal families (up to isomorphism) \[\mbox{$\mathcal{A}=\{A\in {\binom{[n]}{k}}: 1\in A \: \rm{ or} \: 2\in A\}$ \quad and \quad $\mathcal{B}=\{B\in {\binom{[n]}{\ell}}: [2] \subseteq B\}$};\] \item[2)] or $|\cal{A}||\cal{B}|\le \left({\binom{n-1}{k-1}}+1\right)\left({\binom{n-1}{\ell-1}}-{\binom{n-k-1}{\ell-1}}\right)$ with the unique extremal families (up to isomorphism) \[\mbox{$\mathcal{A}=\{A\in {\binom{[n]}{k}}: 1\in A\}\cup \{[2,k+1] \}$\quad and \quad $\mathcal{B}=\{B\in {\binom{[n]}{\ell}}: 1\in B, B\cap [2,k+1]\neq \emptyset \}$.}\] \end{itemize} The bound ``$n\ge 2\ell >2k$ or $n> 2\ell=2k$" is sharp for $n$. To achieve the above results, we establish some size-sensitive inequalities for cross-intersecting families. As by-products, we will recover the main results of Frankl and Kupavskii [European J. Combin. 62 (2017) 263--271].

math.CO↗

On a conjecture of Tokushige for cross-$t$-intersecting families

Two families of sets $\mathcal{A}$ and $\mathcal{B}$ are called cross-$t$-intersecting if $|A\cap B|\ge t$ for all $A\in \mathcal{A}$, $B\in \mathcal{B}$. An active problem in extremal set theory is to determine the maximum product of sizes of cross-$t$-intersecting families. This incorporates the classical Erdős--Ko--Rado (EKR) problem. In the present paper, we prove that if $\mathcal{A}$ and $\mathcal{B}$ are cross-$t$-intersecting families of $\binom {[n]}k$ with $k\ge t\ge 3$ and $n\ge (t+1)(k-t+1)$, then $|\mathcal{A}||\mathcal{B}|\le {\binom{n-t}{k-t}}^2$; moreover, if $n>(t+1)(k-t+1)$, then equality holds if and only if $\mathcal{A}=\mathcal{B}$ is a maximum $t$-intersecting subfamily of $\binom{[n]}{k}$. This confirms a conjecture of Tokushige for $t\ge 3$.

math.CO↗

Measuring optical vortices by means of dual shearing-type Sagnac interferometers

Measuring the positions of optical vortices is an essential part in the researches of speckles and adaptive optics. The measurement accuracy is restricted by the performance of optical devices and the properties of optical vortices, such as density and size. In order to achieve high accuracy and wide range of application, the dual shearing-type Sagnac interferometers is proposed using two shearing plates to adjust the precision of optical vortices measurement. The shearing displacements are able to balance the measuring precision and the value of the intensity ratio point to provide optimum measurement performance. This method is useful for the observation of optical vortices with different sizes and densities, especially for the high density condition.

physics.optics↗

Phase discontinuities induced scintillation enhancement: coherent vortex beams propagating through weak oceanic turbulence

Under the impact of an infinitely extended edge phase dislocation, optical vortices (screw phase dislocations) induce scintillation enhancement. The scintillation index of a beam consisting of two Gaussian vortex beams with ${\pm{1}}$ topological charges through weak oceanic turbulence is researched via derivation and phase screen simulation. Different combinations of two types of phase discontinuities can be obtained by changing the overlapping degree and the phase difference of two coherent Gaussian vortex beams. The scintillation indexes for them verify that the formation condition of the phenomenon is the coexistence of two types of phase discontinuities. And the enhanced scintillation index can be several orders of magnitude larger than that of a plane wave under weak perturbation (Rytov variance). This phenomenon could be useful for both optical vortex detection and perturbation measurement.

physics.optics↗

Oceanic non-Kolmogorov optical turbulence and spherical wave propagation

Light propagation in turbulent media is conventionally studied with the help of the spatio-temporal power spectra of the refractive index fluctuations. In particular, for natural water turbulence several models for the spatial power spectra have been developed based on the classic, Kolmogorov postulates. However, as currently widely accepted, non-Kolmogorov turbulent regime is also common in the stratified flow fields, as suggested by recent developments in atmospheric optics. Until now all the models developed for the non-Kolmogorov optical turbulence were pertinent to atmospheric research and, hence, involved only one advected scalar, e.g., temperature. We generalize the oceanic spatial power spectrum, based on two advected scalars, temperature and salinity concentration, to the non-Kolmogorov turbulence regime, with the help of the so-called "Upper-Bound Limitation" and by adopting the concept of spectral correlation of two advected scalars. The proposed power spectrum can handle general non-Kolmogorov, anisotropic turbulence but reduces to Kolmogorov, isotropic case if the power law exponents of temperature and salinity are set to 11/3 and anisotropy coefficient is set to unity. To show the application of the new spectrum, we derive the expression for the second-order mutual coherence function of a spherical wave and examine its coherence radius (in both scalar and vector forms) to characterize the turbulent disturbance. Our numerical calculations show that the statistics of the spherical wave vary substantially with temperature and salinity non-Kolmogorov power law exponents and temperature-salinity spectral correlation coefficient. The introduced spectrum is envisioned to become of significance for theoretical analysis and experimental measurements of non-classic natural water double-diffusion turbulent regimes.

physics.ao-ph↗