Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 25 February
The sixth generation (6G) network is expected to deploy larger multiple-input multiple-output (MIMO) arrays to support massive connectivity, which will increase overhead and latency at the physical layer. Meanwhile, emerging 6G demands such as immersive communications and environmental sensing pose challenges to traditional signal processing. To address these issues, we propose the “semantic-aware MIMO” paradigm, which leverages specialist models and large models to perceive, utilize, and fuse the inherent semantics of channels and sources for improved performance. Moreover, for representative MIMO physical-layer tasks, e.g., random access activity detection, channel feedback, and precoding, we design specialist models that exploit channel and source semantics for better performance. Additionally, in view of the more diversified functions of 6G MIMO, we further explore large models as a scalable solution for multi-task semantic-aware MIMO and review recent advances along with their advantages and limitations. Finally, we discuss the challenges, insights, and prospects of the evolution of specialist models and large models empowered semantic-aware MIMO paradigms.
Functional Analysis
An optimal time-singularity of the estimate for the heat semigroup related to the critical Sobolev embedding
We give a certain $L^{\infty}(\mathbb{R}^2)$-estimate for the heat semigroup $\{e^{t\Delta}\}_{t \ge 0}$ that is closely related to the fact $H^1(\mathbb{R}^2) \not\subset L^{\infty}(\mathbb{R}^2)$, i.e., the critical Sobolev (non-)embedding and the standard Brezis-Gallouët inequality. While we provide several approaches to show such an assertion, we also reveal that the time-singularity of our estimate as $t \to 0^+$ is indeed optimal.
Read the full abstract
Combinatorics
On the Number of Connected Edge Cover Sets of Some Graph Families
Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge cover polynomial of $G$ is defined as $E_c(G,x)=\sum_{i} e_c(G,i)x^i$, where $e_c(G,i)$ denotes the number of connected edge covers of $G$ with exactly $i$ edges. In this paper, we derive explicit formulas for both the connected edge cover polynomials and the total number of connected edge covers for several important graph families, including wheels, complete graphs $K_n$, complete bipartite graphs $K_{2,n}$, friendship graphs, and lollipop graphs. Each formula is accompanied by a combinatorial proof and verified by computational enumeration for small orders.
Read the full abstract
Geometric Topology
Crossing Numbers of Knots on Closed Surfaces
Let c(K;F) denote the surface crossing number of a knot K with respect to a closed connected surface F in S^3. We relate c(K;F) to the tunnel number t(K) and to the Heegaard deficiency delta(F)=g(M_1;F)+g(M_2;F)-g(F), where S^3=M_1 union_F M_2. The zero-crossing case gives a structural obstruction: if c(K;F)=0, then t(K) <= delta(F). Conversely, if t(K)>delta(F), then c(K;F) >= 2(t(K)-delta(F))+1. Thus the Heegaard deficiency of F measures the amount of tunnel complexity that can be absorbed by F without producing crossings. The proof combines a surface ascending-number estimate, a bridge-number estimate for surface diagrams, and an amalgamation argument for Heegaard splittings relative to F. We also construct connected-sum families showing that the lower bound has the correct linear order.
Read the full abstract
Mathematical Physics
Semi-classical limit of an attractive Fermi gas in one or two dimensions
We study the ground-state of a Fermi gas with short range attrative interactions in one or two dimensions. N fermions are placed in a confining potential, and interact with each other through a negative potential, whose range is larger than the typical distance between particles. We show the convergence of the ground state energy of the Hamiltonian to a Thomas-Fermi energy in the large N limit. Furthermore, we prove convergence of the ground states, in the sense of their Husimi functions. These results extend to the case of a repulsive interaction of positive Fourier transform.
Read the full abstract
Combinatorics
Spanning-Tree Extremality in $C_4$-Free Graphs
We study the maximum number of spanning trees in connected $n$-vertex $C_4$-free graphs. For projective-plane orders $n=q^2+q+1$, we determine the spanning-tree count of every polarity graph and show that polarity graphs with exactly $q+1$ absolute points maximize this count within the polarity family, attaining $n^{(n-3)/2}$ spanning trees. Combined with a stability theorem of He, Ma and Yang \cite{HeMaYangCSIAM23}, this yields the same exact upper bound for all sufficiently dense $C_4$-free graphs in the known polarity stability regime. For arbitrary $C_4$-free graphs at these orders, we derive a global upper bound implying \[ \log \mathrm{st}(n,C_4)=\frac{n-3}{2}\log n+O(\sqrt n), \] where $\mathrm{st}(n,C_4)$ denotes the maximum number of spanning trees over connected $n$-vertex $C_4$-free graphs.
Read the full abstract
Information Theory
Permutation Polynomials Under Multiplicative-Additive Perturbations: Characterization via Difference Distribution Tables
We investigate permutation polynomials F over finite fields F_{p^n} whose generalized derivative maps x -> F(x + a) - cF(x) are themselves permutations for all nonzero shifts a. This property, termed perfect c-nonlinearity (PcN), represents optimal resistance to c-differential attacks - a concern highlighted by recent cryptanalysis of the Kuznyechik cipher variant. We provide the first characterization using the classical difference distribution table (DDT): F is PcN if and only if Delta_F(a,b) Delta_F(a,c^{-1}b) = 0 for all nonzero a,b. This enables verification in O(p^{2n}) time given a precomputed DDT, a significant improvement over the naive O(p^{3n}) approach. We prove a strict dichotomy for monomial permutations: the derivative F(x + alpha) - cF(x) is either a permutation for all nonzero shifts or for none, with the general case remaining open. For quadratic permutations, we provide explicit algebraic characterizations. We identify the first class of affine transformations preserving c-differential uniformity and derive tight nonlinearity bounds revealing fundamental incompatibility between PcN and APN properties. These results position perfect c-nonlinearity as a structurally distinct regime within permutation polynomial theory.
Read the full abstract
Dynamical Systems
Towers and Bratteli-Vershik systems in Fibonacci-like unimodal maps
For a class of Fibonacci-like unimodal maps, the restriction to the $\omega$-limit set of the unique turning point defines a minimal Cantor system. We construct these Cantor sets geometrically using a nested sequence of finite covers with a tower structure. From this tower structure, we recover the associated Bratteli-Vershik model determined by the cutting times and obtain an explicit formula for the unique ergodic invariant probability measure supported on the $\omega$-limit set. We conclude with applications illustrating the scope of the construction.
Read the full abstract
Classical Analysis and ODEs
Every semi-normalized unconditional Schauder frame in Hilbert spaces contains a frame
Let $H$ be an infinite-dimensional Hilbert space. We prove that every unconditional Schauder frame for $H$ contains a subsequence that can be normalized to form a frame for $H$. As a consequence, every semi-normalized unconditional Schauder frame contains a frame for $H.$ Here we say that a sequence $\{x_n\}_{n\in \mathbb{N}}$ in a Hilbert space $H$ is an unconditional Schauder frame for $H$ if there exists some sequence $\{y_n\}_{n\in \mathbb{R}}subseteq H$ such that $$x=\sum_{n=1}^\infty \langle x,y_n\rangle x_n\quad \text{for all }x\in H,$$ with the unconditional convergence of the series in the norm of $H.$ We say that $\{x_n\}_{n\in\mathbb{N}}$ is semi-normalized if $m\leq \|x_n\|\leq M$ for all $n\in \mathbb{N}$ for some positive constants $m,M.$ We then apply our main results to answer several open questions concerning the existence of certain unconditional Schauderf frames. For example, we prove that if a closed subspace of $L^2(\mathbb{R}^d)$ contains $\{e^{2\pi ib\cdot x}g\}_{b\in \Lambda}$ for some infinite uniformly discrete subset $\Lambda$ of $\mathbb{R}^d$ and some nonzero function $g$ in the Feichtinger algebra, it does not admit any unconditional Schauder frames of translates with finitely many generators. We will also show that no Gabor system with the critical lower Beurling density can be an unconditional Schauder frame when the window function belongs to the Feichtinger algebra. Furthermore, we present an example of a compact set of $\mathbb{R}$ which does not admit any unconditional Schauder frames of exponentials with the critical lower Beurling density. All results in this paper apply equivalently to sequences that can be rescaled to form a frame for $H.$
Read the full abstract
Information Theory
Concatenated Sum-Rank Codes
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the Gilbert-Varshamov-like bound, were constructed in a recent paper published in IEEE Trans. Inf. Theory by E. Berardini and X. Caruso. We call this bound the Tsfasman-Vladut-Zink-like bound. In this paper, we introduce the concatenation of a sum-rank code and a Hamming metric code. Then many sum-rank codes with good parameters, which are better than sum-rank BCH codes, are constructed simply and explicitly. Moreover, we obtain an asymptotically good sequence of sum-rank codes exceeding the Tsfasman-Vladut-Zink-like bound and the Gilbert-Varshamov-like bound.
Read the full abstract
Commutative Algebra
An application of Fontaine's monoidal maps to perfectoid towers
To connect arithmetic and ring-theoretic properties of rings of mixed characteristic with those of positive characteristic, we introduce monoidal maps for perfectoid towers. Using these maps, we discuss the almost integrality of perfectoid towers and of their tilts. We also show that the towers constructed by F. Andreatta via ramification theory become perfectoid towers, and we apply the monoidal maps to deduce the normality of their small tilts.
Read the full abstract
Optimization and Control
Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets
We solve the (weighted) sum-rate maximization problem over the set of achievable rates characterized by a nonlinear spectral radius function. This set has been recently shown to be convex in some practically relevant settings in modern wireless networks, including cell-less networks. However, even under convexity, sum-rate maximization is challenging because the nonlinear spectral radius characterization of the achievable rate region is difficult to handle directly. We overcome this difficulty by exploiting subgradient projections onto the level sets of suitably reformulated spectral radius functions. Notably, the derived subgradient projection algorithm provably converges to the global optimum of the sum-rate maximization problem under the convexity condition. The efficacy of the proposed algorithm is illustrated in simulations for cell-less networks.
Read the full abstract
Combinatorics
Equivariant log concavity and the $\operatorname{FI^\sharp}$-module structure on $H^i(\operatorname{Conf}(n,\mathbb{R}^d))$
Previous work has conjectured that the graded $\mathfrak{S}_n$-representations $H^\bullet(\operatorname{Conf}(n,\mathbb{R}^d);\mathbb{Q})$ are strongly equivariantly log concave, and has proven this conjecture in low degrees. By leveraging the theory of representation stability, we are able instead prove a stronger statement about the $\operatorname{FI^\sharp}$-module structure on $H^i(\operatorname{Conf}(n,\mathbb{R}^d);\mathbb{Q})$ which implies the original conjecture up to degree 19. We conjecture that this equivariant log concavity-like property holds in all degrees for the $\operatorname{FI^\sharp}$-modules $H^i(\operatorname{Conf}(n,\mathbb{R}^d);\mathbb{Q})$.
Read the full abstract
Combinatorics
Spectral radius, toughness and $k$-factor of graphs
A $k$-regular spanning subgraph of $G$ is called a $k$-factor. Fan, Lin and Lu [European J. Combin. 110 (2023) 103701] presented a tight sufficient condition in terms of the spectral radius for a connected 1-tough graph to contain a connected 2-factor (Hamilton cycle). Then it is interesting to consider the following problem: What is the spectral radius condition to guarantee the existence of a $k$-factor with $k\ge3$ in a connected 1-tough graph $G$ with $\delta(G)\ge k$? In this paper, we completely solve this problem.
Read the full abstract
Analysis of PDEs
A Topological Approach to Singular Double-Phase Equations with Variable Exponents
In the present paper, we study a singular double phase variable exponent Dirichlet problem in the setting of a new Musielak-Orlicz Sobolev space with the nonlinearity (the external source) having gradient dependence (so-called convection terms). We apply a topological existence result incorporating the Leray-Schauder degree and homotopy mapping together to prove the existence of at least one nontrivial solution.
Read the full abstract
Numerical Analysis
Convergence Analysis of a Linear, Unconditionally Energy-Stable SAV Finite Element Method for the Cahn-Hilliard Equation
This paper proposes a finite element scheme, based on the Scalar Auxiliary Variable (SAV) approach, for the Cahn-Hilliard equation–a model that possesses significant physical relevance and a rich mathematical structure. A convergence analysis of the fully discrete scheme is conducted under suitable regularity assumptions, confirming optimal-order convergence in both time and space for the phase variable, chemical potential, and auxiliary variable in the H1-norm. Furthermore, the scheme is proven to be unconditionally energy stable. Finally, a numerical example is presented to demonstrate the effectiveness of the method and to confirm the theoretical convergence rates.
Read the full abstract
Optimization and Control
Narrowing the Gap: SOS Ranks of $4 \times 3$ Biquadratic Forms and a Lower Bound of $8$
We investigate the maximum sum-of-squares (SOS) rank of biquadratic forms in the critical case of $4 \times 3$ variables, where the general bounds are currently $7 \leq \mathrm{BSR}(4,3) \leq 11$. By analyzing two important structured subclasses, we obtain exact determinations and improved upper bounds that significantly narrow this gap. For simple biquadratic forms those containing only distinct terms of the type $x_i^2 y_j^2$ we prove that the maximum achievable SOS rank is exactly 7, a value attained by a form corresponding to a $C_4$-free bipartite graph with the maximum number of edges. This settles the question for simple forms. For $y$-deficient biquadratic forms a class introduced here that permits cross terms among two of the three $y$-variables while the third appears only in pure square terms we prove an upper bound of $9$ by combining Calderön's theorem on $m\times 2$ forms with the known value $\mathrm{BSR}(4,2) = 5$. Our main result is a constructive proof that $\mathrm{BSR}(4,3) \geq 8$. We present an explicit non-simple, non-deficient $4\times 3$ biquadratic form and prove it requires exactly eight squares, thereby improving the general lower bound. This shows that any form achieving a rank higher than $8$ must possess a more complex algebraic structure, and it reduces the search space for determining the true value of $\mathrm{BSR}(4,3)$. Connections to Zarankiewicz numbers, extremal graph theory, and classical results on sums of squares are highlighted throughout.
Read the full abstract
Statistics Theory
How many asymmetric communities are there in multi-layer directed networks?
Estimating the asymmetric numbers of communities in multi-layer directed networks is a challenging problem due to the multi-layer structures and inherent directional asymmetry, leading to possibly different numbers of sender and receiver communities. This work addresses this issue under the multi-layer stochastic co-block model, a model for multi-layer directed networks with distinct community structures in sending and receiving sides, by proposing a novel goodness-of-fit test. The test statistic relies on the deviation of the largest singular value of an aggregated normalized residual matrix from the constant 2. The test statistic exhibits a sharp dichotomy: Under the null hypothesis of correct model specification, its upper bound converges to zero with high probability; under underfitting, the test statistic itself diverges to infinity. With this property, we develop a sequential testing procedure that searches through candidate pairs of sender and receiver community numbers in a lexicographic order. The process stops at the smallest such pair where the test statistic drops below a decaying threshold. For robustness, we also propose a ratio-based variant algorithm, which detects sharp changes in the sequence of test statistics by comparing consecutive candidates. Both methods are proven to consistently determine the true numbers of sender and receiver communities under the multi-layer stochastic co-block model.
Read the full abstract
Analysis of PDEs
Refined wave breaking for the one-dimensional nonlinear shallow water equations
This paper aims to give a refined wave breaking description of the Cauchy problem to the one-dimensional nonlinear shallow water equations providing a sharp estimate of the lifespan of the solutions depending on the amplitude and topography parameters, under a non-cavitation condition which excludes the scenario that the solutions have compact support. We construct smooth initial data with finite $\dot{H}^5$-norm such that the $L^\infty$-norm of the spatial derivative of the solution blows up at one single point in finite time with a precise blowup profile.
Read the full abstract
Information Theory
Impact of Pointing Errors and Correlated Wall Blockages on Practical Grid-based Indoor Terahertz Communication Systems
Terahertz (THz) communications has emerged as a promising technology for future wireless systems due to its potential to support extremely high data rates. However, severe path loss, blockage effects, and sensitivity to beam misalignment pose major challenges to reliable indoor THz communications. In this paper, we investigate the coverage probability of downlink transmission in a three-dimensional (3D) indoor THz communication system under structured access point (AP) deployments, with a focus on square and hexagonal grid topologies. A tractable analytical framework is developed to jointly account for human blockages, correlated wall blockages across APs, beam training, and residual pointing error. Numerical results demonstrate that wall blockage correlation significantly reduces the association and coverage probabilities, and its impact cannot be neglected in system performance analysis. Compared with square grid AP deployments, hexagonal grids consistently achieve higher coverage by mitigating correlated wall blockage effects and reducing the distances between user equipments (UEs) and their associated APs. Furthermore, coverage performance is shown to strongly depend on the UE location, with noticeable degradation as the UE moves away from its nearest AP. Residual pointing error is found to introduce substantial coverage loss, especially for longer links. In addition, beam training analysis reveals a non-monotonic relationship between antenna array size and training overhead, highlighting an inherent tradeoff among antenna configuration, beamwidth selection, and beam training efficiency. These findings provide useful insights into the design and deployment of practical indoor THz communication systems.
Read the full abstract
Algebraic Geometry
Topology of projective Tate-Shafarevich twists
A Tate-Shafarevich twist $X^\phi\to B$ of a fibration $X\to B$ modifies it by a $1$-cocycle of flows of vector fields relative to the base, locally in the analytic topology. Saccà conjectured that the total spaces of two projective Lagrangian fibrations related by such a twist are deformation-equivalent. Assuming that the class of the twist is torsion (which is often equivalent to the twist being realizable in the étale topology), we show that there is an isomorphism $H^\ast(X;\mathbb Q)\cong H^\ast(X^\phi;\mathbb Q)$ of graded vector spaces that respects (1) the Hodge structures and (2) the Hodge-Riemann pairing. Consequently, the rational Beauville-Bogomolov-Fujiki lattices of these two spaces are Hodge-similar. Assuming further that $B$ is smooth, and both the original fibration and its twist admit $C^\infty$-sections, we show Saccà's conjecture using the theory of degenerate twistor deformations.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Integral formula for the propagator of the one-dimensional Hubbard model
We present an exact integral formula for the multi-particle propagator of the one-dimensional Fermi–Hubbard model on an infinite lattice. The proof is based on the nested Bethe ansatz without relying on the string hypothesis. Our formula enables an explicit integral representation of the time evolution of arbitrary finite-particle wave functions and thereby provides a foundation for the exact analysis of nonequilibrium dynamics in the Hubbard model. It can further be applied to related open quantum models.
Read the full abstract
Mathematical Physics
Normal-ordered equivalent of the Weyl ordering of $\hat{q}^j \hat{p}^k$
The problem of quantizing a bivariate dynamical system can be reduced to evaluating the ordering of $\hat{q}^j \hat{p}^k$. Here, we consider the Weyl ordering of $\hat{q}^j \hat{p}^k$ that is then expressed in term of the annihilation $\hat{a}$ and creation $\hat{a}^\dagger$ operator. The explicit formula for the normal-ordered equivalent (all $\hat{a}^\dagger$'s preceeding all $\hat{a}$'s) of the resulting expression is then given, and some relations are discussed.
Read the full abstract
Analysis of PDEs
Spreading dynamics for the Lotka-Volterra system with general initial supports: the strong competition
This paper studies the spreading dynamics of a high-dimensional strong competition Lotka-Volterra system where two species initially occupy disjoint measurable (possibly unbounded) subsets in $\mathbb{R}^N$, which are called initial support. Recently, Hamel and Rossi [14] introduced some new geometric notions, such as bounded or unbounded directions and positive-distance interior, for single-species equations with general initial supports. Under these notions and appropriate assumptions, we characterize directional spreading behavior for the two-species system: precise spreading speeds and sets for both species are derived.
Read the full abstract
Differential Geometry
Generalized Frobenius Manifold Structures on the Orbit Spaces of Affine Weyl Groups II
This is a sequel to arXiv:2506.13656, in which an approach to construct a class of generalized Frobenius manifold structures on the orbit spaces of affine Weyl groups is presented. In this paper we apply this construction to the affine Weyl groups of type $A_\ell, B_\ell, C_\ell$ and $D_\ell$.
Read the full abstract
Combinatorics
Signs of Hamiltonian Circles in Simple Plane Signed Graphs
We study which signs can occur among Hamiltonian circles in simple plane signed graphs. Using a face-based viewpoint, we relate the sign of a Hamiltonian circle to the product of the signs of the faces inside it, and we introduce co-Hamiltonian sequences. This yields a criterion for the existence of opposite-sign Hamiltonian circles via two co-Hamiltonian sequences with opposite face-products. Motivated by signed grid graphs, we develop local structural theorems that allow one to certify the existence of both signs without explicitly constructing the full sequences, including a ladder-type configuration where toggling along two $4$-circles produces Hamiltonian circles of opposite sign, as well as hexagon configurations that realize both signs.
Read the full abstract
Information Theory
Guided Wireless Technology for Near-Field Communication
Guided wireless technology is an innovative approach that combines the strengths of guided waves and wireless communication. In traditional wireless systems, signals propagate through the air, where they are vulnerable to interference, attenuation, and jamming. Guided communication, in contrast, confines signals within a physical medium, significantly reducing interference and supporting higher data rates over longer distances. Guided wireless technology harnesses these benefits by creating guided wireless channels and offering a controlled pathway for electromagnetic waves. This work harnesses these benefits by focusing on the modeling of near-field communication through long connected arrays deployed in linear-cell environments. We derive a circuit model for long array as an infinitely long dipole with multiple periodic feed points before approximating it with a finite array through open circuiting. Through our simulations, we show how the standing wave phenomenon is confirmed by the oscillations in spectral efficiency. We also demonstrate the capability of the LMMSE transmit beamformer in mitigating interference and minimizing the mean square error by adaptively allocating more power to the user experiencing the most severe channel attenuation, resulting in a more balanced variation of achievable rates across users.
Read the full abstract
Combinatorics
2-dimensional unit vector flows
We study $2$-dimensional unit vector flows on graphs, that is, nowhere-zero flows that assign to each oriented edge a unit vector in $\mathbb R^{3}$. We give a new geometric characterization of $\mathbb S^{2}$-flows on cubic graphs. We also prove that the class of cubic graphs admitting an $\mathbb S^{2}$-flow is closed under a natural composition operation, which yields further constructions; in particular, blowing up a vertex into a triangle preserves the existence of an $\mathbb S^{2}$-flow. Our second contribution is algebraic: we extend the rank-based approach of [SIAM J. Discrete Math., 29 (2015), pp.~2166–2178] from $\mathbb S^{1}$-flows to $\mathbb S^{2}$-flows. More precisely, we show that if an $\mathbb S^{2}$-flow $\varphi$ satisfies $\operatorname{rank}(S_{\mathbb{Q}}(\varphi))\le 2$ and $S_{\mathbb{Q}}(\varphi)$ is odd-coordinate-free, then the graph admits a nowhere-zero $4$-flow.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.soft
Confinement-Induced Symmetry Breaking of Active Surfaces
The actomyosin cortex, a thin layer of a cross-linked polymer network near the cell surface, generates active forces that are responsible for cell shape changes. Many developmental processes that involve such cell shape changes, most prominently embryonic cell division, are spatially confined by eggshells. To investigate the potential role of confinement in redirecting active stresses and enabling symmetry breaking phenomena during cell shape transformations, we study a hydrodynamic minimal model in which the cell cortex is represented as an active fluid surface that undergoes symmetric division in the absence of confinement. When enclosed by an ellipsoidal shell, a spontaneous symmetry-breaking transition emerges at a critical degree of confinement, where symmetrically dividing surfaces become unstable and polarized geometries appear. We show that this transition is controlled by the tightness of the confinement and analyze the solution space of stationary surfaces to identify the mechanisms underlying confinement-induced symmetry breaking.
Read the full abstract
Analysis of PDEs
Hydrodynamic limit of rarefaction wave for the Vlasov-Maxwell-Landau system with Coulomb potential
In this paper, we investigate the hydrodynamic limit of rarefaction wave for the two-species Vlasov-Maxwell-Landau(VML) system with Coulomb potential. We prove that for any given time interval, the solution of the Vlasov-Maxwell-Landau system with appropriate initial data converges to a rarefaction wave as the Knudsen number $\epsilon$ approaches zero. The main difficulty in the analysis lies in the loss of dissipation in the interaction between the electromagnetic field and the microscopic component, and the weak dissipation induced by the Lorentz force and the scaling with small parameter $\epsilon$. For this, we introduce a velocity weight function and a space-time scaling parameter together with suitable $\epsilon$-dependent energy estimates.