The classification and lattice model construction of symmetry-protected topological (SPT) phases in interacting fermion systems are very interesting but challenging. In this paper, we give a systematic fixed-point wave function construction of fermionic SPT (FSPT) states for generic fermionic symmetry group G_f = \mathbb{Z}^f_2 ×_{ω_2} G_b which is a central extension of bosonic symmetry group Gb (may contain time-reversal symmetry) by the fermion parity symmetry group \mathbb{Z}^f_2 = {1,P_f}. Our construction is based on the concept of an equivalence class of finite-depth fermionic symmetric local unitary transformations and decorating symmetry domain wall picture, subjected to certain obstructions. We also discuss the systematical construction and classification of boundary anomalous SPT states which leads to a trivialization of the corresponding bulk FSPT states. Thus, we conjecture that the obstruction-free and trivialization-free constructions naturally lead to a classification of FSPT phases. Each fixed-point wave function admits an exactly solvable commuting-projector Hamiltonian. We believe that our classification scheme can be generalized to point and space group symmetry as well as continuum Lie group symmetry.

This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three dimensional photonic crystals with face centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of $5.184$ million dimension eigenvalue problems within $50$ to $104$ minutes on a workstation with two Intel Quad-C ore Xeon X5687 3.6 GHz CPUs.

In this paper, we prove the DonohoStark uncertainty principle for locally compact quantum groups and characterize the minimizer which are bi-shifts of group-like projections. We also prove the HirschmanBeckner uncertainty principle for compact quantum groups and discrete quantum groups. Furthermore, we show Hardy's uncertainty principle for locally compact quantum groups in terms of bi-shifts of group-like projections.

No abstract uploaded!

In this paper, we develop a discontinuous Galerkin (DG) method to solve the ideal special relativistic hydrodynamics (RHD) and design a bound-preserving (BP) limiter for this scheme by extending the idea in (X. Zhang and C.-W. Shu, Journal of Computational Physics, 229 (2010), 8918-8934). For RHD, the density and pressure are positive and the velocity is bounded by the speed of light. One difficulty in numerically solving the RHD in its conservative form is that the failure of preserving these physical bounds will result in ill-posedness of the problem and blowup of the code, especially in extreme relativistic cases. The standard way in dealing with this difficulty is to add extra numerical dissipation, while in doing so there is no guarantee in maintaining the high order of accuracy. Our BP limiter has the following features. It can theoretically guarantee to preserve the physical bounds for the numerical solution and maintain its designed high order accuracy. The limiter is local to the cell and hence is very easy to implement. Moreover, it renders $L^1$-stability to the numerical scheme. Numerical experiments are performed to demonstrate the good performance of this bound-preserving DG scheme. Even though we only discuss the BP limiter for DG schemes, it can be applied to high order finite volume schemes, such as weighted essentially non-oscillatory (WENO) finite volume schemes as well.