Searcharxiv⌕ Search

arXiv subjects

Pengfei Huang

Publications and source records attributed to Pengfei Huang.

36 records · Page 2Linked to original sources

Simpson-Mochizuki Correspondence for $λ$-Flat Bundles

The notion of flat $λ$-connections as the interpolation of usual flat connections and Higgs fields was suggested by Deligne and further studied by Simpson. Mochizuki established the Kobayashi--Hitchin-type theorem for $λ$-flat bundles ($λ\neq 0$), which is called the Mochizuki correspondence. In this paper, on the one hand, we generalize Mochizuki's result to the case when the base being a compact balanced manifold, more precisely, we prove the existence of harmonic metrics on stable $λ$-flat bundles ($λ\neq 0$). On the other hand, we study two applications of the Simpson--Mochizuki correspondence to moduli spaces. More concretely, we show this correspondence provides a homeomorphism between the moduli space of (semi)stable $λ$-flat bundles over a complex projective manifold and the Dolbeault moduli space, and also provides dynamical systems with two parameters on the latter moduli space. We investigate such dynamical systems, in particular, we calculate the first variation, the fixed points and discuss the asymptotic behaviour.

math.DG↗

Rate-Constrained Shaping Codes for Finite-State Channels With Cost

Shaping codes are used to generate code sequences in which the symbols obey a prescribed probability distribution. They arise naturally in the context of source coding for noiseless channels with unequal symbol costs. Recently, shaping codes have been proposed to extend the lifetime of flash memory and reduce DNA synthesis time. In this paper, we study a general class of shaping codes for noiseless finite-state channels with cost and i.i.d. sources. We establish a relationship between the code rate and minimum average symbol cost. We then determine the rate that minimizes the average cost per source symbol (total cost). An equivalence is established between codes minimizing average symbol cost and codes minimizing total cost, and a separation theorem is proved, showing that optimal shaping can be achieved by a concatenation of optimal compression and optimal shaping for a uniform i.i.d. source.

cs.IT↗

The decompositions and positive semidefiniteness of fourth-order conjugate partial-symmetric tensors with applications

Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of the decomposition. In addition to traditional decompositions in the form of the sum of rank-one tensors, we focus on the orthogonal matrix decomposition of CPS tensors, which inherits nice properties from decomposition of matrices. It then induces a procedure that reobtain the CPS decomposable property of CPS tensors. We also discuss the nonnegativity of the quartic real-valued symmetric conjugate form corresponding to fourth-order CPS tensors in real and complex cases, and establish its relationship to different positive semidefiniteness based on different decompositions. Finally, we give some examples to illustrate the applications of presented propositions.

math.NA↗

Curvature formulas related to a family of stable Higgs bundles

In this paper, we investigate the geometry of the base complex manifold of an effectively parametrized holomorphic family of stable Higgs bundles over a fixed compact Kähler manifold. The starting point of our study is Schumacher-Toma/Biswas-Schumacher's curvature formulas for Weil-Petersson-type metrics, in Sect. 2, we give some applications of their formulas on the geometric properties of the base manifold. In Sect. 3, we calculate the curvature on the higher direct image bundle, which recovers Biswas-Schumacher's curvature formula. In Sect. 4, we construct a smooth and strongly pseudo-convex complex Finsler metric for the base manifold, the corresponding holomorphic sectional curvature is calculated explicitly.

math.DG↗

Newton-based methods for finding the positive ground state of Gross-Pitaevskii equations

The discretization of Gross-Pitaevskii equations (GPE) leads to a nonlinear eigenvalue problem with eigenvector nonlinearity (NEPv). In this paper, we use two Newton-based methods to compute the positive ground state of GPE. The first method comes from the Newton-Noda iteration for saturable nonlinear Schrödinger equations proposed by Liu, which can be transferred to GPE naturally. The second method combines the idea of the Bisection method and the idea of Newton method, in which, each subproblem involving block tridiagonal linear systems can be solved easily. We give an explicit convergence and computational complexity analysis for it. Numerical experiments are provided to support the theoretical results.

math.NA↗

Simpson Filtration and Oper Stratum Conjecture

In this paper, we prove that for the oper stratification of the de Rham moduli space $M_{\mathrm{dR}}(X,r)$, the closed oper stratum is the unique minimal stratum with dimension $r^2(g-1)+g+1$, and the open dense stratum consisting of irreducible flat bundles with stable underlying vector bundles is the unique maximal stratum.

math.AG↗

Finding the Global Optimum of a Class of Quartic Minimization Problem

We consider a special nonconvex quartic minimization problem over a single spherical constraint, which includes the discretized energy functional minimization problem of non-rotating Bose-Einstein condensates (BECs) as one of the important applications. Such a problem is studied by exploiting its characterization as a nonlinear eigenvalue problem with eigenvector nonlinearity (NEPv), which admits a unique nonnegative eigenvector, and this eigenvector is exactly the global minimizer to the quartic minimization. With these properties, any algorithm converging to the nonnegative stationary point of this optimization problem finds its global minimum, such as the regularized Newton (RN) method. In particular, we obtain the global convergence to global optimum of the inexact alternating direction method of multipliers (ADMM) for this problem. Numerical experiments for applications in non-rotating BEC validate our theories.

math.NA↗

Non-Abelian Hodge Theory and Related Topics

This paper is a survey aimed on the introduction of non-Abelian Hodge theory that gives the correspondence between flat bundles and Higgs bundles. We will also introduce some topics arising from this theory, especially some recent developments on the study of the relevant moduli spaces together with some interesting open problems.

math.AG↗

Stability and Indecomposability of the Representations of Quivers of $A_n$-type

In his paper \cite{MR1}, Markus Reineke proposed a conjecture that there exists a stable weight system $Θ$ for every indecomposable representation of Dynkin type quiver. In this paper, we showed this conjecture is true for quivers of $A_n$-type by combinatorial construction of a special weight system. We also reinterpret this weight system in terms of semi-invariant theory.

math.RT↗

Rate-Constrained Shaping Codes for Structured Sources

Shaping codes are used to encode information for use on channels with cost constraints. Applications include data transmission with a power constraint and, more recently, data storage on flash memories with a constraint on memory cell wear. In the latter application, system requirements often impose a rate constraint. In this paper, we study rate-constrained fixed-to-variable length shaping codes for noiseless, memoryless costly channels and general i.i.d. sources. The analysis relies on the theory of word-valued sources. We establish a relationship between the code expansion factor and minimum average symbol cost. We then determine the expansion factor that minimizes the average cost per source symbol (total cost), corresponding to a conventional optimal source code with cost. An equivalence is established between codes minimizing average symbol cost and codes minimizing total cost, and a separation theorem is proved, showing that optimal shaping can be achieved by a concatenation of optimal compression and optimal shaping for a uniform i.i.d. source. Shaping codes often incorporate, either explicitly or implicitly, some form of non-equiprobable signaling. We use our results to further explore the connections between shaping codes and codes that map a sequence of i.i.d. source symbols into an output sequence of symbols that are approximately independent and distributed according to a specified target distribution, such as distribution matching (DM) codes. Optimal DM codes are characterized in terms of a new performance measure - generalized expansion factor (GEF) - motivated by the costly channel perspective. The GEF is used to study DM codes that minimize informational divergence and normalized informational divergence.

cs.IT↗

The Hitchin--Kobayashi Correspondence for Quiver Bundles over Generalized Kähler Manifolds

In this paper, we establish the Hitchin--Kobayashi correspondence for the $I_\pm$-holomorphic quiver bundle $\mathcal{E}=(E,ϕ)$ over a compact generalized Kähler manifold $(X, I_+,I_-,g, b)$ such that $g$ is Gauduchon with respect to both $I_+$ and $I_-$, namely $\mathcal{E}$ is $(α,σ,τ)$-polystable if and only if $\mathcal{E}$ admits an $(α,σ,τ)$-Hermitian--Einstein metric.

math.DG↗

Multi-Erasure Locally Recoverable Codes Over Small Fields

Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for storage arrays. Compared to previous related works, we focus on the construction of ME-LRCs over small fields. We first develop upper and lower bounds on the minimum distance of ME-LRCs. Our main contribution is to propose a general construction of ME-LRCs based on generalized tensor product codes, and study their erasure-correcting properties. A decoding algorithm tailored for erasure recovery is given, and correctable erasure patterns are identified. We then prove that our construction yields optimal ME-LRCs with a wide range of code parameters, and present some explicit ME-LRCs over small fields. Finally, we show that generalized integrated interleaving (GII) codes can be treated as a subclass of generalized tensor product codes, thus defining the exact relation between these codes.

cs.IT↗

Syndrome-Coupled Rate-Compatible Error-Correcting Codes

Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs, thus proving the existence of good rate-compatible codes. Then, we propose a general framework for constructing rate-compatible ECCs based on cosets and syndromes of a set of nested linear codes. We evaluate our construction from two points of view. From a combinatorial perspective, we show that we can construct rate-compatible codes with increasing minimum distances. From a probabilistic point of view, we prove that we are able to construct capacity-achieving rate-compatible codes.

cs.IT↗

Performance of Optimal Data Shaping Codes

Data shaping is a coding technique that has been proposed to increase the lifetime of flash memory devices. Several data shaping codes have been described in recent work, including endurance codes and direct shaping codes for structured data. In this paper, we study information-theoretic properties of a general class of data shaping codes and prove a separation theorem stating that optimal data shaping can be achieved by the concatenation of optimal lossless compression with optimal endurance coding. We also determine the expansion factor that minimizes the total wear cost. Finally, we analyze the performance of direct shaping codes and establish a condition for their optimality.

cs.IT↗

Multi-Erasure Locally Recoverable Codes Over Small Fields For Flash Memory Array

Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for flash memory array. Compared to previous related works, we focus on the construction of ME-LRCs over small fields. We first develop upper and lower bounds on the minimum distance of ME-LRCs. These bounds explicitly take the field size into account. Our main contribution is to propose a general construction of ME-LRCs based on generalized tensor product codes, and study their erasure-correcting property. A decoding algorithm tailored for erasure recovery is given. We then prove that our construction yields optimal ME-LRCs with a wide range of code parameters. Finally, we present several families of ME-LRCs over different fields.

cs.IT↗

Performance of Multilevel Flash Memories with Different Binary Labelings: A Multi-User Perspective

In this work, we study the performance of different decoding schemes for multilevel flash memories where each page in every block is encoded independently. We focus on the multi-level cell (MLC) flash memory, which is modeled as a two-user multiple access channel suffering from asymmetric noise. The uniform rate regions and sum rates of Treating Interference as Noise (TIN) decoding and Successive Cancelation (SC) decoding are investigated for a Program/Erase (P/E) cycling model and a data retention model. We examine the effect of different binary labelings of the cell levels, as well as the impact of further quantization of the memory output (i.e., additional read thresholds). Finally, we extend our analysis to the three-level cell (TLC) flash memory.

cs.IT↗

Binary Linear Locally Repairable Codes

Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do not explicitly take into consideration the field size $q$, i.e., the size of the code alphabet. In particular, for the binary case, only a few results are known. In this work, we present an upper bound on the minimum distance $d$ of linear LRCs with availability, based on the work of Cadambe and Mazumdar. The bound takes into account the code length $n$, dimension $k$, locality $r$, availability $t$, and field size $q$. Then, we study binary linear LRCs in three aspects. First, we focus on analyzing the locality of some classical codes, i.e., cyclic codes and Reed-Muller codes, and their modified versions, which are obtained by applying the operations of extend, shorten, expurgate, augment, and lengthen. Next, we construct LRCs using phantom parity-check symbols and multi-level tensor product structure, respectively. Compared to other previous constructions of binary LRCs with fixed locality or minimum distance, our construction is much more flexible in terms of code parameters, and gives various families of high-rate LRCs, some of which are shown to be optimal with respect to their minimum distance. Finally, availability of LRCs is studied. We investigate the locality and availability properties of several classes of one-step majority-logic decodable codes, including cyclic simplex codes, cyclic difference-set codes, and $4$-cycle free regular low-density parity-check (LDPC) codes. We also show the construction of a long LRC with availability from a short one-step majority-logic decodable code.

cs.IT↗

Cross-Layer Scheduling in Multi-user System with Delay and Secrecy Constraints

Recently, physical layer security based approaches have drawn considerable attentions and are envisaged to provide secure communications in the wireless networks. However, most existing literatures only focus on the physical layer. Thus, how to design an effective transmission scheme which also considers the requirements from the upper layers is still an unsolved problem. We consider such cross-layer resource allocation problem in the multi-user downlink environment for both having instantaneous and partial eavesdropping channel information scenarios. The problem is first formulated in a new security framework. Then, the control scheme is designed to maximize the average admission rate of the data, incorporating delay, power, and secrecy as constraints, for both non-colluding and colluding eavesdropping cases in each scenario. Performance analysis is given based on the stochastic optimization theory and the simulations are carried out to validate the effectiveness of our scheme.

cs.IT↗