scholarly journals ACC for log canonical threshold polytopes

2021 ◽  
Vol 143 (3) ◽  
pp. 681-714
Author(s):  
Jingjun Han ◽  
Zhan Li ◽  
Lu Qi
Entropy ◽  
2019 ◽  
Vol 21 (6) ◽  
pp. 561
Author(s):  
Miki Aoyagi

In recent years, selecting appropriate learning models has become more important with the increased need to analyze learning systems, and many model selection methods have been developed. The learning coefficient in Bayesian estimation, which serves to measure the learning efficiency in singular learning models, has an important role in several information criteria. The learning coefficient in regular models is known as the dimension of the parameter space over two, while that in singular models is smaller and varies in learning models. The learning coefficient is known mathematically as the log canonical threshold. In this paper, we provide a new rational blowing-up method for obtaining these coefficients. In the application to Vandermonde matrix-type singularities, we show the efficiency of such methods.


Author(s):  
Aleksandr V. Pukhlikov

AbstractWe show that the global (log) canonical threshold of d-sheeted covers of the M-dimensional projective space of index 1, where $$d\geqslant 4$$d⩾4, is equal to 1 for almost all families (except for a finite set). The varieties are assumed to have at most quadratic singularities, the rank of which is bounded from below, and to satisfy the regularity conditions. This implies birational rigidity of new large classes of Fano–Mori fibre spaces over a base, the dimension of which is bounded from above by a constant that depends (quadratically) on the dimension of the fibre only.


2004 ◽  
Vol 13 (3) ◽  
pp. 603-615 ◽  
Author(s):  
Tommaso de Fernex ◽  
Lawrence Ein ◽  
Mircea Mustaţǎ

2014 ◽  
Vol 212 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Jean-Pierre Demailly ◽  
Hoàng Hiệp Phạm

2015 ◽  
Vol 353 (1) ◽  
pp. 21-24 ◽  
Author(s):  
Alexander Rashkovskii

Sign in / Sign up

Export Citation Format

Share Document