On a Generalization of Weak Pullback Flatness

In 1998, Laan introduced weakly pullback flat acts and showed that weak pullback flatness is equivalent to the conjunction of Conditions (P) and (E′). In 2013, Golchin introduced Condition (P′), which is a generalization of Condition (P). In this article, we first define Condition (PF″), which lies strictly between weak pullback flatness and Condition (P′), and prove that Condition (PF″) coincides with the conjunction of Conditions (P′) and (E′). Furthermore, we give a classfication of monoids by Condition (PF″) of (cyclic, Rees factor) acts, and find a necessary and sufficient condition under which Condition (PF″) coincides with Condition (P′) (resp., weak pullback flatness, strong flatness) for Rees factor acts. Finally, we investigate Conditions (P′), (E′) and (PF″) using some new types of epimorphisms.     

Rewriting Systems and Geometric Three-Manifolds

The fundamental groups of most (conjecturally, all) closed three-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting systems. The general case remains open.     

Pullback Attractors for a Damped Semilinear Wave Equation with Delays

In this paper, we consider the weakly damped wave equations with hereditary effects, and the nonlinearity f satisfies critical growth. The delay term g(t, ut) may be driven by a function with very weak assumptions, namely, just measurability. We analyze the well-posedness of solutions and verify the existence of the pullback D-attractor in C_H_0~1(Ω)×C_L~2(Ω)by constructing the energy functional and combining with the idea of the contractive function.     

Pullback attractors for the non-autonomous Benjamin-Bona-Mahony equations in H

In this paper, we prove the existence of the pullback attractor for the non-autonomous Benjamin-Bona-Mahony equations in H² by establishing the pullback uniformly asymptotical compactness.     

Pullback attractors for the non-autonomous Benjamin-Bona-Mahony equation in unbounded domains

The existence of a pullback attractor is proven for the non-autonomous Benjamin-Bona-Mahony equation in unbounded domains.The asymptotic compactness of the solution operator is obtained by the uniform estimates on the tails of solutions.     

Pullback attractors for a nonautonomous damped wave equation with infinite delays in weighted space

In this paper, we investigate the existence of solutions for a damped wave equation with infinite delays in the weighted space and , respectively. In addition, we study the existence of pullback attractor for the process associated to the problem by a direct and simple compactness method.     

关于非自治Benjiamin-Bona-Mohony方程拉回吸引子的一个注记(英文）

In this paper,we show the existence of pullback attractors for the nonautonomous Benjamin-Bona-Mahony equations by establishing the pullback uniform asymptotically compactness.     

Pullback attractors and invariant measures for the discrete Zakharov equations

This article studies the probability distributions of solutions in the phase space for the discrete Zakharov equations. The authors first prove that the generated process of the solutions operators possesses a pullback-${\mathcal D}$ attractor, and then they establish that there exists a unique family of invariant Borel probability measures supported by the pullback attractor.     

图的倍图与补倍图

计算机科学数据库的关系中遇到了可归为倍图或补倍图的参数和哈密顿圈的问题．对简单图C,如果V（D（G））：V（G）∪V（G′）E（D（G））=E（C）∪E（C″）U{vivj′｜vi∈V（G）,Vj′∈V（G′）且vivj∈E（G））那么,称D（C）是C的倍图,如果V（D（G））=V（C）∪V（G′）,E（D（C））：E（C）∪E（G′）∪{vivj′}vi∈V（G）,vj′∈V（G’）and vivj∈（G））,称D（C）是G的补倍图,这里G′是G的拷贝．本文研究了D（G）和D的色数,边色数,欧拉性,哈密顿性和提出了D（G） 的边色数是D（G）的最大度等公开问题．     

Ladyzhenskaya流体力学方程组的拉回吸引子与不变测度

本文讨论带周期边界条件的二维Ladyzhenskaya流体力学方程组解的渐近行为.作者先证明该流体力学方程组存在拉回吸引子,然后证明该拉回吸引子上存在唯一不变Borel概率测度.     

Pullback exponential attractors for the non-autonomous micropolar fluid flows

This paper investigates the pullback asymptotic behaviors for the non-autonomous micropolar fluid flows in 2D bounded domains. We use the energy method, combining with some important properties of the generated processes, to prove the existence of pullback exponential attractors and global pullback attractors and show that they both with finite fractal dimension. Further, we give the relationship between global pullback attractors and pullback exponential attractors.     

一类非自治Brinkman-Forchheimer系统的拉回$\mathcal{D}$-吸引子

The asymptotic behavior of solutions of the three-dimensional nonautonomous Brinkman-Forchheimer equation is investigated. And the existence of pullback global attractors in L2 (Ω) and H01(Ω) is proved, respectively.     

非自治Plate方程时间依赖强拉回吸引子的存在性

结合Plinio等人([Plinio D,Duane G S,Temarn R,Time-dependent attractor for the oscillon equation,Discrete Contin Dyn Syst,2011,29(1):141-167.])提出的时间依赖全局吸引子概念,运用压缩函数的方法,证明了带有时间依赖系数的非自治Plate方程时间依赖拉回吸引子在空间H~4(Ω)∩H~2_0(Ω)×H~2_0(Ω)中的存在性.     

含Grushin算子的抛物方程拉回吸引子的高阶吸引性

本文考虑了含Grushin算子的非自治抛物方程拉回吸引子的高阶吸引性.我们首先建立了极大值原理,其次研究了弱解差的高阶可积性,最后证明了高阶吸引性.     

Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems

The classical algebraic approach to graph transformation is a mathematical theory based on categorical techniques with several interesting applications in computer science. In this paper, a new semantics of graph transformation systems (in the algebraic, double-pushout (DPO) approach) is proposed in order to make them suitable for the specification of concurrent and reactive systems. Classically, a graph transformation system comes with a fixed behavioral interpretation. Firstly, all transformation steps are intended to be completely specified by the rules of the system, that is, there is an implicit frame condition: it is assumed that there is a complete control about the evolution of the system. Hence, the interaction between the system and its (possibly unknown) environment, which is essential in a reactive system, cannot be modeled explicitly. Secondly, each sequence of transformation steps represents a legal computation of the system, and this makes it difficult to model systems with control. The first issue is addressed by providing graph transformation rules with a loose semantics, allowing for unspecified effects which are interpreted as activities of the environment. This is formalized by the notion of double-pullback transitions, which replace (and generalize) the well-known double-pushout diagrams by allowing for spontaneous changes in the context of a rule application. Two characterizations of double-pullback transitions are provided: the first one describes them in terms of extended direct DPO derivations, and the second one as incomplete views of parallel or amalgamated derivations. The issue of constraining the behavior of a system to transformation sequences satisfying certain properties is addressed instead by introducing a general notion of logic of behavioral constraints, which includes instances like start graphs, application and consistency conditions, and temporal logic constraints. The loose semantics of a system with restricted behavior is defined as a category of coalgebras over a suitable functor. Such category has a final object which includes all finite and infinite transition sequences satisfying the constraints.