We investigate the block basis for modular coinvariants of finite pseudo-reflection groups.We are particularly interested in the case of a subgroup G of the parabolic subgroups of GLn(q)which generalizes the Weyl grou...We investigate the block basis for modular coinvariants of finite pseudo-reflection groups.We are particularly interested in the case of a subgroup G of the parabolic subgroups of GLn(q)which generalizes the Weyl groups of restricted Cartan typeLiealgebra.展开更多
Let F be a field with characteristic 0, V = Fn the n-dimensional vector space over F and let G be a finite pseudo-reflection group which acts on V . Let χ ： G→ F＊ be a 1- dimensional representation of G. In this a...Let F be a field with characteristic 0, V = Fn the n-dimensional vector space over F and let G be a finite pseudo-reflection group which acts on V . Let χ ： G→ F＊ be a 1- dimensional representation of G. In this article we show that χ（g） = （detg）α（0 ≤ α ≤ r - 1）, where g ∈ G and r is the order of g. In addition, we characterize the relation between the relative invariants and the invariants of the group G, and then we use Molien’s Theorem of invariants to compute the Poincar′e series of relative invariants.展开更多
Possessing advantages such as high computing efficiency and ease of programming,the Symplectic Euler algorithm can be applied to construct a groundpenetrating radar(GPR)wave propagation numerical model for complex geo...Possessing advantages such as high computing efficiency and ease of programming,the Symplectic Euler algorithm can be applied to construct a groundpenetrating radar(GPR)wave propagation numerical model for complex geoelectric structures.However,the Symplectic Euler algorithm is still a difference algorithm,and for a complicated boundary,ladder grids are needed to perform an approximation process,which results in a certain amount of error.Further,grids that are too dense will seriously decrease computing efficiency.This paper proposes a conformal Symplectic Euler algorithm based on the conformal grid technique,amends the electric/magnetic fieldupdating equations of the Symplectic Euler algorithm by introducing the effective dielectric constant and effective permeability coefficient,and reduces the computing error caused by the ladder approximation of rectangular grids.Moreover,three surface boundary models(the underground circular void model,the undulating stratum model,and actual measurement model)are introduced.By comparing reflection waveforms simulated by the traditional Symplectic Euler algorithm,the conformal Symplectic Euler algorithm and the conformal finite difference time domain(CFDTD),the conformal Symplectic Euler algorithm achieves almost the same level of accuracy as the CFDTD method,but the conformal Symplectic Euler algorithm improves the computational efficiency compared with the CFDTD method dramatically.When the dielectric constants of the two materials vary greatly,the conformal Symplectic Euler algorithm can reduce the pseudo-waves almost by 80% compared with the traditional Symplectic Euler algorithm on average.展开更多
基金supported by NSFC(No.12101544)Fundamental Research Funds of Yunnan Province(No.202301AT070415).
文摘We investigate the block basis for modular coinvariants of finite pseudo-reflection groups.We are particularly interested in the case of a subgroup G of the parabolic subgroups of GLn(q)which generalizes the Weyl groups of restricted Cartan typeLiealgebra.
基金Supported by the National Natural Science Foundation of China (Grant No.10771023)
文摘Let F be a field with characteristic 0, V = Fn the n-dimensional vector space over F and let G be a finite pseudo-reflection group which acts on V . Let χ ： G→ F＊ be a 1- dimensional representation of G. In this article we show that χ（g） = （detg）α（0 ≤ α ≤ r - 1）, where g ∈ G and r is the order of g. In addition, we characterize the relation between the relative invariants and the invariants of the group G, and then we use Molien’s Theorem of invariants to compute the Poincar′e series of relative invariants.
基金funded by the National Key Research and Development Program of China(No.2017YFC1501204)the National Natural Science Foundation of China(Nos.51678536,41404096)+2 种基金the Scientific and Technological Research Program of Henan Province(No.171100310100)Program for Innovative Research Team(in Science and Technology)in University of Henan Province(19HASTIT043)the Outstanding Young Talent Research Fund of Zhengzhou University(1621323001).
文摘Possessing advantages such as high computing efficiency and ease of programming,the Symplectic Euler algorithm can be applied to construct a groundpenetrating radar(GPR)wave propagation numerical model for complex geoelectric structures.However,the Symplectic Euler algorithm is still a difference algorithm,and for a complicated boundary,ladder grids are needed to perform an approximation process,which results in a certain amount of error.Further,grids that are too dense will seriously decrease computing efficiency.This paper proposes a conformal Symplectic Euler algorithm based on the conformal grid technique,amends the electric/magnetic fieldupdating equations of the Symplectic Euler algorithm by introducing the effective dielectric constant and effective permeability coefficient,and reduces the computing error caused by the ladder approximation of rectangular grids.Moreover,three surface boundary models(the underground circular void model,the undulating stratum model,and actual measurement model)are introduced.By comparing reflection waveforms simulated by the traditional Symplectic Euler algorithm,the conformal Symplectic Euler algorithm and the conformal finite difference time domain(CFDTD),the conformal Symplectic Euler algorithm achieves almost the same level of accuracy as the CFDTD method,but the conformal Symplectic Euler algorithm improves the computational efficiency compared with the CFDTD method dramatically.When the dielectric constants of the two materials vary greatly,the conformal Symplectic Euler algorithm can reduce the pseudo-waves almost by 80% compared with the traditional Symplectic Euler algorithm on average.
