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

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

On E(s2)‐optimal and minimax‐optimal supersaturated designs with 20 rows and 76 columns

We derive a previously unknown lower bound of 41 for the frequency of of an E(s²)‐optimal and minimax‐optimal supersaturated design (SSD) with 20 rows and 76 columns. This is accomplished by an exhaustive computer search that uses the combinatorial properties of resolvable 2 − (20, 10, 36) designs and the parallel class intersection pattern method. We also classify all nonisomorphic E(s²)‐optimal 4‐circulant SSDs with 20 rows and .     

Ring graphs and complete intersection toric ideals

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideals are minimally generated by Gröbner bases. We prove that any graph can be oriented such that its toric ideal is a complete intersection with a universal Gröbner basis determined by the cycles. It turns out that bipartite ring graphs are exactly the bipartite graphs that have complete intersection toric ideals for any orientation.     

More on block intersection polynomials and new applications to graphs and block designs

The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the non-negative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Cameron and the present author. The theory of block intersection polynomials is extended, and new applications of these polynomials to the studies of graphs and block designs are obtained. In particular, we obtain a new method of bounding the size of a clique in an edge-regular graph with given parameters, which can improve on the Hoffman bound when applicable, and a new method for studying the possibility of a graph with given vertex-degree sequence being an induced subgraph of a strongly regular graph with given parameters.     

Bounding the distance among longest paths in a connected graph

It is easy to see that in a connected graph any $2$ longest paths have a vertex in common. For $k\ge 7$, Skupień in 1966 obtained a connected graph in which some $k$ longest paths have no common vertex, but every $k?1$ longest paths have a common vertex. It is not known whether every $3$ longest paths in a connected graph have a common vertex and similarly for 4, 5, and $6$ longest path. Fujita et al. in 2015 give an upper bound on distance among $3$ longest paths in a connected graph. In this paper we give a similar upper bound on distance between $4$ longest paths and also for $k$ longest paths, in general.     

Canonical splittings of groups and 3-manifolds

We introduce the notion of a `canonical' splitting over or for a finitely generated group . We show that when happens to be the fundamental group of an orientable Haken manifold with incompressible boundary, then the decomposition of the group naturally obtained from canonical splittings is closely related to the one given by the standard JSJ-decomposition of . This leads to a new proof of Johannson's Deformation Theorem.

     

Hilbert Functions, Residual Intersections, and Residually S2 Ideals

Let R be a homogeneous ring over an infinite field, IR a homogeneous ideal, and I an ideal generated by s forms of degrees d ₁,...,d _s so that codim( :I)s. We give broad conditions for when the Hilbert function of R/ or of R/( :I) is determined by I and the degrees d ₁,...,d _s . These conditions are expressed in terms of residual intersections of I, culminating in the notion of residually S ₂ ideals. We prove that the residually S ₂ property is implied by the vanishing of certain Ext modules and deduce that generic projections tend to produce ideals with this property.     

Intersection Local Times of Independent Brownian Motions as Generalized White Noise Functionals

A 'chaos expansion' of the intersection local time functional of two independent Brownian motions in R ^d is given. The expansion is in terms of normal products of white noise (corresponding to multiple Wiener integrals). As a consequence of the local structure of the normal products, the kernel functions in the expansion are explicitly given and exhibit clearly the dimension dependent singularities of the local time functional. Their L ^p -properties are discussed. An important tool for deriving the chaos expansion is a computation of the 'S-transform' of the corresponding regularized intersection local times and a control about their singular limit.