下临界维数Wiener sausage相交时间的中偏差

本文研究在下临界维数情形下Wiener sausage 的相交时间, 应用新近提出的高阶矩方法和经典的Feynman-Kac 半群方法, 得到该情况下Wiener sausage 相交时间的中偏差.     

Cycle Extensions in BIBD Block‐Intersection Graphs

A cycle C in a graph G is extendable if there is some other cycle in G that contains each vertex of C plus one additional vertex. A graph is cycle extendable if every non‐Hamilton cycle in the graph is extendable. A balanced incomplete block design, BIBD, consists of a set V of v elements and a block set of k‐subsets of V such that each 2‐subset of V occurs in exactly λ of the blocks of . The block‐intersection graph of a design is the graph having as its vertex set and such that two vertices of are adjacent if and only if their corresponding blocks have nonempty intersection. In this paper, we prove that the block‐intersection graph of any BIBD is cycle extendable. Furthermore, we present a polynomial time algorithm for constructing cycles of all possible lengths in a block‐intersection graph.     

The Bhattacharya Function of Complete Monomial Ideals in Two Variables

We give explicit formulas for the Bhattacharya function of 𝔪-primary complete monomial ideals in two variables in terms of the vertices of the Newton polyhedra or in terms of the decompositions of the ideals as products of simple ideals.