Frontiers of Mathematics in China

ISSN 1673-3452

ISSN 1673-3576(Online)

CN 11-5739/O1

Postal Subscription Code 80-964

2018 Impact Factor: 0.565

   Online First

Administered by

, Volume 19 Issue 3

For Selected: View Abstracts Toggle Thumbnails
The acyclic chromatic index of planar graphs without 4-, 6-cycles and intersecting triangles
Yuehua BU, Qi JIA, Hongguo ZHU
Front. Math. China. 2024, 19 (3): 117-136.  
https://doi.org/10.3868/s140-DDD-024-0003-x

Abstract   HTML   PDF (926KB)

A proper edge k-coloring is a mapping ϕ:E(G){1,2,,k} such that any two adjacent edges receive different colors. A proper edge k-coloring ϕ of G is called acyclic if there are no bichromatic cycles in G. The acyclic chromatic index of G, denoted by χa(G), is the smallest integer k such that G is acyclically edge k-colorable. In this paper, we show that if G is a plane graph without 4-, 6-cycles and intersecting 3-cycles, Δ(G)9, then χa(G)Δ(G)+1.

References | Related Articles | Metrics
Low-rank spectral estimation algorithm of learning Markov model
Yongye ZHAO, Shujun BI
Front. Math. China. 2024, 19 (3): 137-155.  
https://doi.org/10.3868/s140-DDD-024-0009-x

Abstract   HTML   PDF (5820KB)

This paper proposes a low-rank spectral estimation algorithm of learning Markov model. First, an approximate projection algorithm for the rank-constrained frequency matrix set is proposed, and thereafter its local Lipschitzian error bound established. Then, we propose a low-rank spectral estimation algorithm for estimating the state transition frequency matrix and the probability matrix of Markov model by applying the approximate projection algorithm to correct the maximum likelihood estimation of the frequency matrix, and prove that there is only a multiplying constant difference in estimation errors between the low-rank spectral estimation and the maximum likelihood estimation under appropriate conditions. Finally, numerical comparisons with the prevailing maximum likelihood estimation, spectral estimation, and rank-constrained maximum likelihood estimation show that the low-rank spectral estimation algorithm is effective.

Figures and Tables | References | Related Articles | Metrics
An overview of image restoration based on variational regularization
Qibin FAN, Yuling JIAO
Front. Math. China. 2024, 19 (3): 157-180.  
https://doi.org/10.3868/s140-DDD-024-0010-x

Abstract   HTML   PDF (523KB)

Image restoration is a complicated process in which the original information can be recovered from the degraded image model caused by lots of factors. Mathematically, image restoration problems are ill-posed inverse problems. In this paper image restoration models and algorithms based on variational regularization are surveyed. First, we review and analyze the typical models for denoising, deblurring and inpainting. Second, we construct a unified restoration model based on variational regularization and summarize the typical numerical methods for the model. At last, we point out eight diffcult problems which remain open in this field.

References | Related Articles | Metrics
3 articles