The Experts below are selected from a list of 13434 Experts worldwide ranked by ideXlab platform
Jingming Zhu - One of the best experts on this subject based on the ideXlab platform.
-
On metric spaces with given transfinite asymptotic dimensions
arXiv: General Topology, 2020Co-Authors: Jingming Zhu, Taras RadulAbstract:For every countable Ordinal Number $\xi$, we construct a metric space $X_{\xi}$ whose transfinite asymptotic dimension and complementary-finite asymptotic dimension are both $\xi$. We also prove that the metric space $X_{\xi}$ has finite decomposition complexity.
-
A metric space with its transfinite asymptotic dimension ω + 1
Topology and its Applications, 2020Co-Authors: Jingming ZhuAbstract:Abstract We construct a metric space whose transfinite asymptotic dimension and complementary-finite asymptotic dimension are both ω + 1 , where ω is the smallest infinite Ordinal Number. Therefore, we prove that the omega conjecture is not true.
-
Metric spaces with complexity of the smallest infinite Ordinal Number
Topology and its Applications, 2018Co-Authors: Jingming ZhuAbstract:Abstract In this paper, we are concerned with the study of metric spaces with complexity of the smallest infinite Ordinal Number. We give equivalent formulations of the definition of metric spaces with complexity of the smallest infinite Ordinal Number and prove that the exact complexity of the finite product Z ≀ Z × Z ≀ Z × ⋯ × Z ≀ Z of wreath products is ω, where ω is the smallest infinite Ordinal Number. Consequently, we obtain that the complexity of ( Z ≀ Z ) ≀ Z is ω + 1 .
-
Metric spaces with complexity of the smallest infinite Ordinal Number
arXiv: Group Theory, 2016Co-Authors: Jingming ZhuAbstract:In this paper, we are concerned with the study on metric spaces with complexity of the smallest infinite Ordinal Number. We give equivalent formulations of the definition of metric spaces with complexity of the smallest infinite Ordinal Number and prove that the exact complexity of the finite product of wreath product is the smallest infinite Ordinal Number. Consequently, we obtain the complexity of (ZwrZ)wrZ is w+1.
Michele Intermont - One of the best experts on this subject based on the ideXlab platform.
-
The A-Complexity of a Space
Journal of the London Mathematical Society, 2002Co-Authors: Wojciech Chacholski, W. G. Dwyer, Michele IntermontAbstract:Suppose that A is a pointed CW-complex. The paper looks at how difficult it is to construct an A-cellular space B from copies of A by repeatedly taking homotopy colimits, this is determined by an Ordinal Number called the complexity of B. Studying the complexity leads to an iterative technique, based on resolutions, for constructing the A-cellular approximation CWA(X) of an arbitrary space X.
Zhuo Chen - One of the best experts on this subject based on the ideXlab platform.
-
performance of the alamouti scheme with imperfect transmit antenna selection
Personal Indoor and Mobile Radio Communications, 2005Co-Authors: Zhuo Chen, Branka Vucetic, Jinhong YuanAbstract:In this paper, the error performance of the Alamouti scheme with transmit antenna selection is investigated in the context of imperfect subset selection. The asymptotic bit error performance is derived for binary phase-shift keying (BPSK) modulation in flat Rayleigh fading channels. It is shown that the transmit diversity order is equal to the larger Ordinal Number of the antenna within the selected antenna subset, while the smaller Ordinal Number only determines horizontal location of the error performance curve without an impact on asymptotic diversity order. Simulation results are provided to substantiate the theoretical analysis
-
Asymptotic performance of space-time block codes with imperfect transmit antenna selection
Electronics Letters, 2005Co-Authors: Zhuo Chen, Branka Vucetic, Jinhong YuanAbstract:The asymptotic bit error performance of the Alamouti scheme with transmit antenna selection is investigated for imperfect selection of antenna subset. It is shown that the transmit diversity order is equal to the largest Ordinal Number of the antenna within the selected antenna subset.
-
Asymptotic performance of transmit antenna selection with maximal-ratio combining for generalized selection criterion
IEEE Communications Letters, 2004Co-Authors: Zhuo ChenAbstract:In this letter, we investigate the asymptotic error performance of an uncoded multiple-input-multiple-output (MIMO) scheme combining transmit antenna selection and receiver maximal-ratio combining (MRC) with a generalized selection criterion. A single transmit antenna corresponding to a fixed Ordinal Number of order statistic is selected for uncoded transmission. The order statistics consist of instantaneous channel power gain between each transmit and all the receive antennas. A general asymptotic bit error rate (BER) expression is derived for all values of Ordinal Number. An interesting conclusion is reached that the system diversity order is proportional to the Ordinal Number of the selected antenna.
-
PIMRC - Performance of the Alamouti Scheme with Imperfect Transmit Antenna Selection
2005 IEEE 16th International Symposium on Personal Indoor and Mobile Radio Communications, 1Co-Authors: Zhuo Chen, Branka Vucetic, Jinhong YuanAbstract:In this paper, the error performance of the Alamouti scheme with transmit antenna selection is investigated in the context of imperfect subset selection. The asymptotic bit error performance is derived for binary phase-shift keying (BPSK) modulation in flat Rayleigh fading channels. It is shown that the transmit diversity order is equal to the larger Ordinal Number of the antenna within the selected antenna subset, while the smaller Ordinal Number only determines horizontal location of the error performance curve without an impact on asymptotic diversity order. Simulation results are provided to substantiate the theoretical analysis
Jinhong Yuan - One of the best experts on this subject based on the ideXlab platform.
-
performance of the alamouti scheme with imperfect transmit antenna selection
Personal Indoor and Mobile Radio Communications, 2005Co-Authors: Zhuo Chen, Branka Vucetic, Jinhong YuanAbstract:In this paper, the error performance of the Alamouti scheme with transmit antenna selection is investigated in the context of imperfect subset selection. The asymptotic bit error performance is derived for binary phase-shift keying (BPSK) modulation in flat Rayleigh fading channels. It is shown that the transmit diversity order is equal to the larger Ordinal Number of the antenna within the selected antenna subset, while the smaller Ordinal Number only determines horizontal location of the error performance curve without an impact on asymptotic diversity order. Simulation results are provided to substantiate the theoretical analysis
-
Asymptotic performance of space-time block codes with imperfect transmit antenna selection
Electronics Letters, 2005Co-Authors: Zhuo Chen, Branka Vucetic, Jinhong YuanAbstract:The asymptotic bit error performance of the Alamouti scheme with transmit antenna selection is investigated for imperfect selection of antenna subset. It is shown that the transmit diversity order is equal to the largest Ordinal Number of the antenna within the selected antenna subset.
-
PIMRC - Performance of the Alamouti Scheme with Imperfect Transmit Antenna Selection
2005 IEEE 16th International Symposium on Personal Indoor and Mobile Radio Communications, 1Co-Authors: Zhuo Chen, Branka Vucetic, Jinhong YuanAbstract:In this paper, the error performance of the Alamouti scheme with transmit antenna selection is investigated in the context of imperfect subset selection. The asymptotic bit error performance is derived for binary phase-shift keying (BPSK) modulation in flat Rayleigh fading channels. It is shown that the transmit diversity order is equal to the larger Ordinal Number of the antenna within the selected antenna subset, while the smaller Ordinal Number only determines horizontal location of the error performance curve without an impact on asymptotic diversity order. Simulation results are provided to substantiate the theoretical analysis
Luan Jing - One of the best experts on this subject based on the ideXlab platform.
-
SOME PROPERTIES OF TWO-TYPE Ordinal NumberS
Journal of Mathematics, 2000Co-Authors: Liu Heng, Luan JingAbstract:In this paper,we introduce a definition of two type Ordinal Numbers, and discuss some properties of them on ZFc conglomerate axiomatic system[3].The paper shows that the two type Ordinal Numbers satisfy the Minimal Element Theorem and the Principle of Transfinite Induction.We can conclude that the two-type Ordinal Number theory is a extension of the Ordinal Number theory.