Based on a graph-theoretic analysis,we determine all the irreducible reflection subgroups of the imprimitive complex reflection groups G(m,p,n),and describe the irreducible subsystems of all possible types in the root...Based on a graph-theoretic analysis,we determine all the irreducible reflection subgroups of the imprimitive complex reflection groups G(m,p,n),and describe the irreducible subsystems of all possible types in the root system R(m,p,n)of G(m,p,n).展开更多
Kostka functions K_(λ,μ)~±(t), indexed by r-partitions λ and μ of n, are a generalization of Kostka polynomials K_(λ,μ)(t) indexed by partitions λ,μ of n. It is known that Kostka polynomials have an inter...Kostka functions K_(λ,μ)~±(t), indexed by r-partitions λ and μ of n, are a generalization of Kostka polynomials K_(λ,μ)(t) indexed by partitions λ,μ of n. It is known that Kostka polynomials have an interpretation in terms of Lusztig's partition function. Finkelberg and Ionov(2016) defined alternate functions K_(λ,μ)(t) by using an analogue of Lusztig's partition function, and showed that K_(λ,μ)(t) ∈Z≥0[t] for generic μ by making use of a coherent realization. They conjectured that K_(λ,μ)(t) coincide with K_(λ,μ)^-(t). In this paper, we show that their conjecture holds. We also discuss the multi-variable version, namely, r-variable Kostka functions K_(λ,μ)~±(t_1,…,t_r).展开更多
A finite (pseudo-)reflection group G naturally gives rise to a hyperplane arrangement,i.e.,its reflection arrangement.We show that G is reducible if and only if its reflection arrangement is reducible.
Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in...Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in accuracy and efficiency.To address these challenges,we propose an adaptive multi-learning cooperation search algorithm(AMLCSA)for efficient identification of unknown parameters in PV models.AMLCSA is a novel algorithm inspired by teamwork behaviors in modern enterprises.It enhances the original cooperation search algorithm in two key aspects:(i)an adaptive multi-learning strategy that dynamically adjusts search ranges using adaptive weights,allowing better individuals to focus on local exploitation while guiding poorer individuals toward global exploration;and(ii)a chaotic grouping reflection strategy that introduces chaotic sequences to enhance population diversity and improve search performance.The effectiveness of AMLCSA is demonstrated on single-diode,double-diode,and three PV-module models.Simulation results show that AMLCSA offers significant advantages in convergence,accuracy,and stability compared to existing state-of-the-art algorithms.展开更多
We carried out surveying on the shallow structure and faulted-stratum of the Haihe fault in Tianjin using acoustic surveying methods such as the single-channel seismic technique. The result shows that the method can o...We carried out surveying on the shallow structure and faulted-stratum of the Haihe fault in Tianjin using acoustic surveying methods such as the single-channel seismic technique. The result shows that the method can obtain satisfactory results in wide and deep river courses. It also shows that in the Tanggu area of Tianjin, the upper fault point of Haihe fault is about 30m beneath the river bed and the corresponding latest active period is Qp^3- Qh^1 , which is consistent with the former borehole survey result. In the offshore area of the Bohai Sea, Haihe fault shows as a NWW-NEE strike dense fault zone and its upper fault point is less than 30m beneath the seabed. It shows that the active characteristics of Haihe fault in the Bohai Sea correspond to the Tanggu area.展开更多
We prove the Murphy and Cohen＇s conjecture that the maximum number of collisions of n ＋ 1 elastic particles moving freely on a line is n（n＋1）/2 if no interior particle has mass less than the arithmetic mean of th...We prove the Murphy and Cohen＇s conjecture that the maximum number of collisions of n ＋ 1 elastic particles moving freely on a line is n（n＋1）/2 if no interior particle has mass less than the arithmetic mean of the masses of its immediate neighbors. In fact, we prove the stronger result that, for the same conclusion, the condition that no interior particle has mass less than the geometric mean, rather than the arithmetic mean, of the masses of its immediate neighbors suffices.展开更多
In this paper, we study the sharp Jackson inequality for the best approximation of f ∈L2,k（Rd） by a subspace Ek2（σ） （SEk2（σ））, which is a subspace of entire functions of exponential type （spherical exponen...In this paper, we study the sharp Jackson inequality for the best approximation of f ∈L2,k（Rd） by a subspace Ek2（σ） （SEk2（σ））, which is a subspace of entire functions of exponential type （spherical exponential type） at most σ. Here L2,k（Rd） denotes the space of all d-variate functions f endowed with the L2-norm with the weight vk（x）=Пζ∈R＋}（ζ,x）}2k（ζ）,which is defined by a positive subsystem R＋ of a finite root system R Rd and a function k（ζ）：R→R＋ invariant under the reflection group G（R） generated by R. In the case G（R） = Z2d, we get some exact results. Moreover, the deviation of best approximation by the subspace Ek2（σ） （SE2（σ）） of some class of the smooth functions in the space L2,k（Rd） is obtained.展开更多
基金supported by National Natural Science Foundation of China(Grant Nos.10631010,10971138)the General Research Project of Shanghai Normal University(Grant No.SK200702)+2 种基金the Science Foundation of University Doctoral Project of China(Grant No.20060269011)Program for Changjiang Scholars and Innovative Research Team in University(Grant No.41192803)Shanghai Leading Academic Discipline Project(Grant No.B407)
文摘Based on a graph-theoretic analysis,we determine all the irreducible reflection subgroups of the imprimitive complex reflection groups G(m,p,n),and describe the irreducible subsystems of all possible types in the root system R(m,p,n)of G(m,p,n).
文摘Kostka functions K_(λ,μ)~±(t), indexed by r-partitions λ and μ of n, are a generalization of Kostka polynomials K_(λ,μ)(t) indexed by partitions λ,μ of n. It is known that Kostka polynomials have an interpretation in terms of Lusztig's partition function. Finkelberg and Ionov(2016) defined alternate functions K_(λ,μ)(t) by using an analogue of Lusztig's partition function, and showed that K_(λ,μ)(t) ∈Z≥0[t] for generic μ by making use of a coherent realization. They conjectured that K_(λ,μ)(t) coincide with K_(λ,μ)^-(t). In this paper, we show that their conjecture holds. We also discuss the multi-variable version, namely, r-variable Kostka functions K_(λ,μ)~±(t_1,…,t_r).
基金supported by National Natural Science Foundation of China(Grant No. 11071010)
文摘A finite (pseudo-)reflection group G naturally gives rise to a hyperplane arrangement,i.e.,its reflection arrangement.We show that G is reducible if and only if its reflection arrangement is reducible.
基金supported by the National Natural Science Foundation of China(Grant Nos.62303197,62273214)the Natural Science Foundation of Shandong Province(ZR2024MFO18).
文摘Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in accuracy and efficiency.To address these challenges,we propose an adaptive multi-learning cooperation search algorithm(AMLCSA)for efficient identification of unknown parameters in PV models.AMLCSA is a novel algorithm inspired by teamwork behaviors in modern enterprises.It enhances the original cooperation search algorithm in two key aspects:(i)an adaptive multi-learning strategy that dynamically adjusts search ranges using adaptive weights,allowing better individuals to focus on local exploitation while guiding poorer individuals toward global exploration;and(ii)a chaotic grouping reflection strategy that introduces chaotic sequences to enhance population diversity and improve search performance.The effectiveness of AMLCSA is demonstrated on single-diode,double-diode,and three PV-module models.Simulation results show that AMLCSA offers significant advantages in convergence,accuracy,and stability compared to existing state-of-the-art algorithms.
基金the China Digital Seismic Observation Network Program and the Active Fault Detecting Sub-program of the tenth"Five-Year Plan" of China Earthquake Administration
文摘We carried out surveying on the shallow structure and faulted-stratum of the Haihe fault in Tianjin using acoustic surveying methods such as the single-channel seismic technique. The result shows that the method can obtain satisfactory results in wide and deep river courses. It also shows that in the Tanggu area of Tianjin, the upper fault point of Haihe fault is about 30m beneath the river bed and the corresponding latest active period is Qp^3- Qh^1 , which is consistent with the former borehole survey result. In the offshore area of the Bohai Sea, Haihe fault shows as a NWW-NEE strike dense fault zone and its upper fault point is less than 30m beneath the seabed. It shows that the active characteristics of Haihe fault in the Bohai Sea correspond to the Tanggu area.
基金the Special Funds for Chinese Major State Basic Research Projects "Nonlinear Science".
文摘We prove the Murphy and Cohen＇s conjecture that the maximum number of collisions of n ＋ 1 elastic particles moving freely on a line is n（n＋1）/2 if no interior particle has mass less than the arithmetic mean of the masses of its immediate neighbors. In fact, we prove the stronger result that, for the same conclusion, the condition that no interior particle has mass less than the geometric mean, rather than the arithmetic mean, of the masses of its immediate neighbors suffices.
基金Supported by National Natural Science Foundation of China(Grant No.11071019)the research Fund for the Doctoral Program of Higher Education and Beijing Natural Science Foundation(Grant No.1102011)
文摘In this paper, we study the sharp Jackson inequality for the best approximation of f ∈L2,k（Rd） by a subspace Ek2（σ） （SEk2（σ））, which is a subspace of entire functions of exponential type （spherical exponential type） at most σ. Here L2,k（Rd） denotes the space of all d-variate functions f endowed with the L2-norm with the weight vk（x）=Пζ∈R＋}（ζ,x）}2k（ζ）,which is defined by a positive subsystem R＋ of a finite root system R Rd and a function k（ζ）：R→R＋ invariant under the reflection group G（R） generated by R. In the case G（R） = Z2d, we get some exact results. Moreover, the deviation of best approximation by the subspace Ek2（σ） （SE2（σ）） of some class of the smooth functions in the space L2,k（Rd） is obtained.
