• Title/Summary/Keyword: FANO

Search Result 52, Processing Time 0.023 seconds

A SUFFICIENT CONDITION FOR A TORIC WEAK FANO 4-FOLD TO BE DEFORMED TO A FANO MANIFOLD

  • Sato, Hiroshi
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1081-1107
    • /
    • 2021
  • In this paper, we introduce the notion of toric special weak Fano manifolds, which have only special primitive crepant contractions. We study their structure, and in particular completely classify smooth toric special weak Fano 4-folds. As a result, we can confirm that almost every smooth toric special weak Fano 4-fold is a weakened Fano manifold, that is, a weak Fano manifold which can be deformed to a Fano manifold.

ON BARYCENTRIC TRANSFORMATIONS OF FANO POLYTOPES

  • Hwang, DongSeon;Kim, Yeonsu
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1247-1260
    • /
    • 2021
  • We introduce the notion of barycentric transformation of Fano polytopes, from which we can assign a certain type to each Fano polytope. The type can be viewed as a measure of the extent to which the given Fano polytope is close to be Kähler-Einstein. In particular, we expect that every Kähler-Einstein Fano polytope is of type B. We verify this expectation for some low dimensional cases. We emphasize that for a Fano polytope X of dimension 1, 3 or 5, X is Kähler-Einstein if and only if it is of type B.

THE F-VECTORS OF SOME TORIC FANO VARIETIES

  • Park, Hye-Sook
    • Journal of applied mathematics & informatics
    • /
    • v.11 no.1_2
    • /
    • pp.437-444
    • /
    • 2003
  • A toric variety is defined by a certain collection of cones. Especially a toric Fano variety is obtained from a special nonsingular fan. In this paper, we define the f-vectors of toric Fano varieties as the numbers of faces of the corresponding fans, and investigate the f-vectors of some toric Fano varieties.

Quenched Fano effect due to one Majorana zero mode coupled to the Fano interferometer

  • Wang, Qi;Zhu, Yu-Lian
    • Current Applied Physics
    • /
    • v.18 no.11
    • /
    • pp.1275-1279
    • /
    • 2018
  • We investigate the change of the Fano effect by considering one Majorana zero mode to couple laterally to the single-dot Fano interferometer. It is found that the Majorana zero mode quenches the Fano effect thoroughly and causes the conductance to be independent of the dot level, the dot-lead coupling, and the increase of the Majorana-dot coupling. As a result, the linear conductance becomes only related to the interlead coupling and the magnetic-flux phase factor. These results can be helpful for the detection of Majorana zero mode.

Reduced Complexity K-BEST Lattice Decoding Algorithm for MIMO Systems (다중 송수신 안테나 시스템 기반에서 복잡도를 감소시킨 K-BEST 복호화 알고리듬)

  • Lee Sung-Ho;Shin Myeong-Cheol;Jung Sung-Hun;Seo Jeong-Tae;Lee Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.95-102
    • /
    • 2006
  • This paper proposes the KB-Fano algorithm which has lower decoding complexity by applying modified Fano-like metric bias to the conventional K-best algorithm. Additionally, an efficient K-best decoding algorithm, named the KR-Fano scheme, is proposed by jointly combining the K-reduction and the KB-Fano schemes. Simulations show that the proposed algerian provides the remarkable improvement from the viewpoints of the BER performance and the decoding complexity as compared to the conventional K-best scheme.

Fano Decoding with Timeout: Queuing Analysis

  • Pan, W. David;Yoo, Seong-Moo
    • ETRI Journal
    • /
    • v.28 no.3
    • /
    • pp.301-310
    • /
    • 2006
  • In mobile communications, a class of variable-complexity algorithms for convolutional decoding known as sequential decoding algorithms is of interest since they have a computational time that could vary with changing channel conditions. The Fano algorithm is one well-known version of a sequential decoding algorithm. Since the decoding time of a Fano decoder follows the Pareto distribution, which is a heavy-tailed distribution parameterized by the channel signal-to-noise ratio (SNR), buffers are required to absorb the variable decoding delays of Fano decoders. Furthermore, since the decoding time drawn by a certain Pareto distribution can become unbounded, a maximum limit is often employed by a practical decoder to limit the worst-case decoding time. In this paper, we investigate the relations between buffer occupancy, decoding time, and channel conditions in a system where the Fano decoder is not allowed to run with unbounded decoding time. A timeout limit is thus imposed so that the decoding will be terminated if the decoding time reaches the limit. We use discrete-time semi-Markov models to describe such a Fano decoding system with timeout limits. Our queuing analysis provides expressions characterizing the average buffer occupancy as a function of channel conditions and timeout limits. Both numerical and simulation results are provided to validate the analytical results.

  • PDF

MORPHISMS BETWEEN FANO MANIFOLDS GIVEN BY COMPLETE INTERSECTIONS

  • Choe, Insong
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.4
    • /
    • pp.689-697
    • /
    • 2009
  • We study the existence of surjective morphisms between Fano manifolds of Picard number 1, when the source is given by the intersection of a cubic hypersurface and either a quadric or another cubic hypersurface in a projective space.

  • PDF

Sequential Decoding of Convolutional Codes with Universal Metric over Bursty-Noise Channel (버스트잡음 채널에서 Universal Metric을 이용한 컨벌루션 부호의 축차복호)

  • Moon, Byung-Hyun;Lee, Chae-Wook
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1997.11a
    • /
    • pp.435-449
    • /
    • 1997
  • In this paper, a new metric, universal metric, is Proposed for sequential decoding of convolutional decoding. The complexity of Fano metric for Fano's sequential decoding algorithm is compared with that of the proposed universal metric. Since the Fano metric assumes that it has previous knowledge of channel transition probability, the complexity of Fano metric increases as the assumed channel error probability does not coincide with the true channel error probability. However, the universal metric dose not require the previous knowledge of the channel transition probability since it is estimated on a branch by branch basis. It is shown that the complexity of universal metric is much less than that of the Fano metric for bursty noisy channel.

  • PDF

Decoupling of Background and Resonance Scatterings in Multichannel Quantum Defect Theory and Extraction of Dynamic Parameters from Lu-Fano Plot

  • Lee, Chun-Woo
    • Bulletin of the Korean Chemical Society
    • /
    • v.30 no.4
    • /
    • pp.891-896
    • /
    • 2009
  • Giusti-Suzor and Fano introduced translations of the scales of Lu-Fano plots by phase renormalization in order to decouple the intra- and inter-channel couplings in multichannel quantum defect theory (MQDT). Their theory was further developed by others to deal with systems involving a larger number of channels. In different directions, MQDT was reformulated into forms with a one-to-one correspondence to those in Fano's configuration mixing theory of resonance for photofragmentation processes involving one closed and many open channels. In this study, the theory was further developed to fully reveal the coupling nature, decoupling of the background and resonance scattering in physical scattering matrices as well as to further extract the dynamic parameters undiscovered by Fano and his colleagues. This theory was applied to the photoabsorption spectrum of $H_2$ observed by Herzberg's group.