Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
                                            Some full text articles may not yet be available without a charge during the embargo (administrative interval).
                                        
                                        
                                        
                                            
                                                
                                             What is a DOI Number?
                                        
                                    
                                
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
- 
            For any Kawamata log terminal (klt) singularity and any minimizer of its normalized volume function, we prove that the associated graded ring is always finitely generated, as conjectured by Chi Li. As a consequence, we complete the last step of establishing the Stable Degeneration Conjecture proposed by Chi Li and the first named author for an arbitrary klt singularity.more » « lessFree, publicly-accessible full text available July 1, 2026
- 
            The feedback arc set problem is one of the most fundamental and well-studied ranking problems where n objects are to be ordered based on their pairwise comparison. The problem enjoys several efficient approximation algorithms in the offline setting. Unfortunately, online there are strong lower bounds on the competitive ratio establishing that no algorithm can perform well in the worst case.This paper introduces a new beyond-worst-case model for online feedback arc set. In the model, a sample of the input is given to the algorithm offline before the remaining instance is revealed online. This models the case in practice where yesterday's data is available and is similar to today's online instance. This sample is drawn from a known distribution which may not be uniform. We design an online algorithm with strong theoretical guarantees. The algorithm has a small constant competitive ratio when the sample is uniform---if not, we show we can recover the same result by adding a provably minimal sample. Empirical results validate the theory and show that such algorithms can be used on temporal data to obtain strong results.more » « less
- 
            We extend the algebraic K-stability theory to projective klt pairs with a biganticanonical class. While in general such a pair could behave pathologically,it is observed in this note that K-semistability condition will force them tohave a klt anticanonical model, whose stability property is the same as theoriginal pair.more » « less
- 
            We extend the algebraic K-stability theory to projective klt pairs with a big anticanonical class. While in general such a pair could behave pathologically, it is observed in this note that the K-semistability condition will force them to have a klt anticanonical model, whose stability property is the same as that of the original pair.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                     Full Text Available
                                                Full Text Available