The Bernstein-Sato polynomial is an important invariant of an element or an ideal in a polynomial ring or power series ring of characteristic zero, with interesting connections to various algebraic and topological aspects of the singularities of the vanishing locus. Work of Mustaţă, later extended by Bitoun and the third author, provides an analogous Bernstein-Sato theory for regular rings of positive characteristic. In this paper, we extend this theory to singular ambient rings in positive characteristic. We establish finiteness and rationality results for Bernstein-Sato roots for large classes of singular rings, and relate these roots to other classes of numerical invariants defined via the Frobenius map. We also obtain a number of new results and simplified arguments in the regular case. 
                        more » 
                        « less   
                    
                            
                            Bernstein–Sato functional equations, V-filtrations, and multiplier ideals of direct summands
                        
                    
    
            This paper investigates the existence and properties of a Bernstein–Sato functional equation in nonregular settings. In particular, we construct [Formula: see text]-modules in which such formal equations can be studied. The existence of the Bernstein–Sato polynomial for a direct summand of a polynomial over a field is proved in this context. It is observed that this polynomial can have zero as a root, or even positive roots. Moreover, a theory of [Formula: see text]-filtrations is introduced for nonregular rings, and the existence of these objects is established for what we call differentially extensible summands. This family of rings includes toric, determinantal, and other invariant rings. This new theory is applied to the study of multiplier ideals and Hodge ideals of singular varieties. Finally, we extend known relations among the objects of interest in the smooth case to the setting of singular direct summands of polynomial rings. 
        more » 
        « less   
        
    
                            - Award ID(s):
- 1945611
- PAR ID:
- 10409083
- Date Published:
- Journal Name:
- Communications in Contemporary Mathematics
- Volume:
- 24
- Issue:
- 10
- ISSN:
- 0219-1997
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            
- 
            Chong, Chita; Feng, Qi; Slaman, Theodore_A; Woodin, W_Hugh (Ed.)This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call Welch games. Player II having a winning strategy in the Welch game of length [Formula: see text] on [Formula: see text] is equivalent to weak compactness. Winning the game of length [Formula: see text] is equivalent to [Formula: see text] being measurable. We show that for games of intermediate length [Formula: see text], II winning implies the existence of precipitous ideals with [Formula: see text]-closed, [Formula: see text]-dense trees. The second part shows the first is not vacuous. For each [Formula: see text] between [Formula: see text] and [Formula: see text], it gives a model where II wins the games of length [Formula: see text], but not [Formula: see text]. The technique also gives models where for all [Formula: see text] there are [Formula: see text]-complete, normal, [Formula: see text]-distributive ideals having dense sets that are [Formula: see text]-closed, but not [Formula: see text]-closed.more » « less
- 
            null (Ed.)In Lipschitz two- and three-dimensional domains, we study the existence for the so-called Boussinesq model of thermally driven convection under singular forcing. By singular we mean that the heat source is allowed to belong to [Formula: see text], where [Formula: see text] is a weight in the Muckenhoupt class [Formula: see text] that is regular near the boundary. We propose a finite element scheme and, under the assumption that the domain is convex and [Formula: see text], show its convergence. In the case that the thermal diffusion and viscosity are constants, we propose an a posteriori error estimator and show its reliability. We also explore efficiency estimates.more » « less
- 
            Mustaţă defined Bernstein-Sato polynomials in prime characteristic for principal ideals and proved that the roots of these polynomials are related to the F F -jumping numbers of the ideal. This approach was later refined by Bitoun. Here we generalize these techniques to develop analogous notions for the case of arbitrary ideals and prove that these have similar connections to F F -jumping numbers.more » « less
- 
            We study the problem of fairly allocating a set of indivisible goods among n agents with additive valuations. Envy freeness up to any good (EFX) is arguably the most compelling fairness notion in this context. However, the existence of an EFX allocation has not been settled and is one of the most important problems in fair division. Toward resolving this question, many impressive results show the existence of its relaxations. In particular, it is known that 0.618-EFX allocations exist and that EFX allocation exists if we do not allocate at most (n-1) goods. Reducing the number of unallocated goods has emerged as a systematic way to tackle the main question. For example, follow-up works on three- and four-agents cases, respectively, allocated two more unallocated goods through an involved procedure. In this paper, we study the general case and achieve sublinear numbers of unallocated goods. Through a new approach, we show that for every [Formula: see text], there always exists a [Formula: see text]-EFX allocation with sublinear number of unallocated goods and high Nash welfare. For this, we reduce the EFX problem to a novel problem in extremal graph theory. We define the notion of rainbow cycle number [Formula: see text] in directed graphs. For all [Formula: see text] is the largest k such that there exists a k-partite graph [Formula: see text], in which each part has at most d vertices (i.e., [Formula: see text] for all [Formula: see text]); for any two parts Viand Vj, each vertex in Vihas an incoming edge from some vertex in Vjand vice versa; and there exists no cycle in G that contains at most one vertex from each part. We show that any upper bound on [Formula: see text] directly translates to a sublinear bound on the number of unallocated goods. We establish a polynomial upper bound on [Formula: see text], yielding our main result. Furthermore, our approach is constructive, which also gives a polynomial-time algorithm for finding such an allocation. Funding: J. Garg was supported by the Directorate for Computer and Information Science and Engineering [Grant CCF-1942321]. R. Mehta was supported by the Directorate for Computer and Information Science and Engineering [Grant CCF-1750436].more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    