In this paper, we construct the bilinear identities for the wave functions of an extended Kadomtsev-Petviashvili (KP) hierarchy, which is the KP hierarchy with particular extended flows. By introducing an auxiliary parameter, whose flow corresponds to the so-called squared eigenfunction symmetry of KP hierarchy, we find the tau-function for this extended KP hierarchy. It is shown that the bilinear identities will generate all the Hirota's bilinear equations for the zero-curvature forms of the extended KP hierarchy, which includes two types of KP equation with self-consistent sources (KPSCS). It seems that the Hirota's bilinear equations obtained in this paper for KPSCS are in a simpler form by comparing with the results by X.B. Hu and H.Y. Wang.

A finite EI category is a small category with finitely many morphisms such that every endomorphism is an isomorphism. They include finite groups, finite posets and free categories of finite quivers as special cases. In this paper we consider the representation types of finite EI categories, describe some criteria for finite representation type, and use them to classify the representation types of several classes of finite EI categories with extra properties.

We propose an efficient threshold dynamics method for topology optimization for fluids modeled with the Stokes equation. The proposed algorithm is based on minimization of an objective energy function that consists of the dissipation power in the fluid and the perimeter approximated by nonlocal energy, subject to a fluid volume constraint and the incompressibility condition. We show that the minimization problem can be solved with an iterative scheme in which the Stokes equation is approximated by a Brinkman equation. The indicator functions of the fluid-solid regions are then updated according to simple convolutions followed by a thresholding step. We demonstrate mathematically that the iterative algorithm has the total energy decaying property. The proposed algorithm is simple and easy to implement. A simple adaptive time strategy is also used to accelerate the convergence of the iteration. Extensive numerical experiments in both two and three dimensions show that the proposed iteration algorithm is quite robust and converges in much fewer iterations and is more efficient than many existing methods.

No abstract uploaded!

No abstract uploaded!