余倾斜余模和Hom-余倾斜余模的注记

本文证明了f-余倾斜余模的Bongartz引理,即一个偏f-余倾斜余模可以做成f-余倾斜余模.首先得到了f-余倾斜余模的性质以及C-余模和AT-模之间的函子同构.此外还研究了Hom-挠对和Hom-余倾斜余模.     

余代数上余倾斜余模的结构

研究了余代数上余倾斜余模的结构特征,证明了每个余倾斜余模都可以写成不可分解的两两非同构的余模的直和形式,每个余倾斜余模包含所有的内射不可分解模作为直和项.最后构造了余倾斜余模的两个例子.     

有限内射维数的余倾斜余模(英文)

本文中,受C.Nastasescu etc.和Y.Miyashita思想的影响,定义了余代数的余倾斜余模,研究得出有限内射维数的余倾斜余模的一些结论.     

关于伪紧余代数、余挠对和弦余代数

本文利用箭图和拓扑伪紧空间研究了K-余代数及其表示.定义了域K上的伪紧K-余代数,研究了伪紧K-余代数和K-代数范畴之间的关系,研究了余挠对和余模逼近,描述了余倾斜余挠对.通过有限维的支撑子余代数和基本的路余代数研究了弦余代数.     

关于余挠三元组的余星子范畴和余倾斜子范畴

设$\mathcal{A}$ 是一个Abel范畴,且 $(\mathcal{X}, \mathcal{Z},\mathcal{Y})$ 是一个完全遗传余挠三元组.介绍 $\mathcal{A}$ 的 $n$-$\mathcal{Y}$-余倾斜子范畴的定义,并给出 $n$-$\mathcal{Y}$-余倾斜子范畴的一个刻画,类似于 $n$-余倾斜模的 Bazzoni 刻画.作为应用,证明了在一个几乎 Gorenstein 环 $R$ 上, 如果 $\mathcal{GP}$ 是 $n$-$\mathcal{GI}$-余倾斜的, 那么 $R$ 是一个 $n$-Gorenstein 环, 其中 $\mathcal{GP}$ 表示 Gorenstein 投射 $R$-模组成的子范畴且 $\mathcal{GI}$ 表示 Gorenstein 内射 $R$-模组成的子范畴. 进而, 研究 任意环$R$上的$n$-余星子范畴, 以及关于余挠三元组 $(\mathcal{P}, R$-Mod, $\mathcal{I})$ 的 $n$-$\mathcal{I}$-子范畴与 $n$-余星子范畴之间的关系, 其中 $\mathcal{P}$ 表示投射左 $R$-模组成的子范畴且 $\mathcal{I}$ 表示内射左 $R$-模组成的子范畴.     

关于MH中的Lie双代数和余Poisson-Hopf代数

本文研究余三角Ｈｏｐｆ代数余模范畴中的Ｌｉｅ双代数和余ＰｏｉｓｓｏｎＨｏｐｆ代数,我们主要讨论余三角Ｈｏｐｆ代数余模范畴中的Ｌｉｅ双代数和余Ｐｏｉｓｓｏｎ－Ｈｏｐｆ代数之间的关系。     

关于μ~H中的Lie双代数和余Poisson-Hopf代数(英文)

本文研究余三角 Ｈｏｐｆ代数余模范畴中的 Ｌｉｅ双代数和余 Ｐｏｉｓｓｏｎ－Ｈｏｐｆ代数．我们主要讨论余三角Ｈｏｐｆ代数余模范畴中的Ｌｉｅ双代数和余Ｐｏｉｓｓｏｎ－Ｈｏｐｆ代数之间的关系．     

co-*-模和1-余倾斜模

给出了co-*-模的定义和研究了1-余倾斜模与co-*-模之间的关系,并且设APR是有限型余倾斜双模,如果有fin.dimR<∞或fin.dimA<∞,则|fin.dim R-fin.dim A|≤1.     

相对AR-对应, 余$t$-结构和半倾斜对

作为倾斜对的推广,本文提出了半倾斜对的概念.作者们将Bazzoni关于倾斜模的刻画推广至半倾斜对,证明了半倾斜对的等价类和满足一定条件的某个子范畴之间存在一个1-1对应.进一步给出了半倾斜对的等价类和上有界的余$t$-结构两者之间存在一个双射.     

Morita context环上的倾斜模和余倾斜模（英文）

令■为一个Morita context环,其中双模同态Φ和Ψ是0.本文研究了A₍(0,0))上扩张函子Ext的消失性,描述了具有有限投射维数(内射维数)的A(0,0)-模的结构.利用这些结果,我们分别刻画了Λ₍(0,0))上的倾斜模和余倾斜模.     

Cotilting modules are pure-injective

We prove that a cotilting module over an arbitrary ring is pure-injective.

     

Forward and Backward Mean-Field Stochastic Partial Differential Equation and Optimal Control

This paper is mainly concerned with the solutions to both forward and backward mean-field stochastic partial differential equation and the corresponding optimal control problem for mean-field stochastic partial differential equation. The authors first prove the continuous dependence theorems of forward and backward mean-field stochastic partial differential equations and show the existence and uniqueness of solutions to them. Then they establish necessary and sufficient optimality conditions of the control problem in the form of Pontryagin''s maximum principles. To illustrate the theoretical results, the authors apply stochastic maximum principles to study the infinite-dimensional linear-quadratic control problem of mean-field type. Further, an application to a Cauchy problem for a controlled stochastic linear PDE of mean-field type is studied.     

凝聚环上的Cotilting 模(英)

本文首先介绍了co－*－模的概念和刻划了凝聚环的一些性质，然后刻划了凝聚环上的Cotilting模．     

Hitting time results for Maker‐Breaker games

We study Maker‐Breaker games played on the edge set of a random graph. Specifically, we analyze the moment a typical random graph process first becomes a Maker's win in a game in which Maker's goal is to build a graph which admits some monotone increasing property \begin{align*}\mathcal{P}\end{align*}. We focus on three natural target properties for Maker's graph, namely being k ‐vertex‐connected, admitting a perfect matching, and being Hamiltonian. We prove the following optimal hitting time results: with high probability Maker wins the k ‐vertex connectivity game exactly at the time the random graph process first reaches minimum degree 2k; with high probability Maker wins the perfect matching game exactly at the time the random graph process first reaches minimum degree 2; with high probability Maker wins the Hamiltonicity game exactly at the time the random graph process first reaches minimum degree 4. The latter two statements settle conjectures of Stojakovi? and Szabó. We also prove generalizations of the latter two results; these generalizations partially strengthen some known results in the theory of random graphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

On-line version of Rabinovitch theorem for proper intervals

We analyze the on-line dimension of semi-orders as a two-person game between Algorithm and Spoiler, in a customary way. The game is played in rounds. Spoiler presents a collection of intervals representing a semi-order, one interval at a time. Algorithm maintains its realizer, i.e., the set of linear extensions intersecting the semi-order presented so far. Each time a new interval is presented, Algorithm inserts it into all maintained linear extensions and is not allowed to change the ordering of the previously introduced elements. Reading carefully the theorem of Rabinovitch on dimension of semi-orders one can prove that Algorithm needs only 3 linear extensions when Spoiler presents intervals of unit length. With the introduction of proper intervals, however, Algorithm can be forced to use one more extension. We prove that the value of the game on proper intervals is exactly 4.     

On the full and block-decoupling of nonlinear functions

We review a method that decouples multivariate functions into linear combinations of a set of univariate (or simpler multivariate) functions of transformed variables. In this way the given nonlinear multiple-input-multiple-output function is decoupled into a structure having simpler parallel internal branches that are linked by linear transformations to the original inputs and outputs. The procedure collects first-order information by evaluating the Jacobian matrix of the given function in a set of points. These matrices are stacked into a three-way tensor, whose decomposition reveals the decoupled representation. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Optimal strategies for a game on amenable semigroups

The semigroup game is a two-person zero-sum game defined on a semigroup ${(S,\cdot)}$ as follows: Players 1 and 2 choose elements ${x \in S}$ and ${y \in S}$ , respectively, and player 1 receives a payoff f (x y) defined by a function f : S → [?1, 1]. If the semigroup is amenable in the sense of Day and von Neumann, one can extend the set of classical strategies, namely countably additive probability measures on S, to include some finitely additive measures in a natural way. This extended game has a value and the players have optimal strategies. This theorem extends previous results for the multiplication game on a compact group or on the positive integers with a specific payoff. We also prove that the procedure of extending the set of allowed strategies preserves classical solutions: if a semigroup game has a classical solution, this solution solves also the extended game.     

Constrainedn-person games

The usual properties of a characteristic function game were derived byvon Neumann andMorgenstern from the properties of a game in normal form. In this paper we give a linear programming principle for the calculation of the characteristic function. The principle is a direct application ofCharnes' linear programming method for the calculation of the optimal strategies and the value of a two-person zero-sum game. The linear programming principle gives another method for proving the standard properties of a characteristic function when it is derived from a game in normal form. Using an idea originated byCharnes for two person games, we develop the concept of a constrainedn-person game as a simple, practical extension of ann-person game. However the characteristic function for a constrainedn-person game may not satisfy properties, such as superadditivity, usually associated with a characteristic function.     

带有Neumann边界条件的$k$维Minkowski平均曲率系统解的存在性

我们运用扰动方法证明了带有Minkowski平均算子非局部Neumann系统$$\begin{aligned}\begin{cases}\Big(r^{N-1}\frac{u''}{\sqrt{1-u''^{2}}}\Big)''=r^{N-1}f(r, u),\\\ r\in(0, 1),\ \ \ u''(0)=0,\ \ \ u''(1)=\int_{0}^{1}u''(s)dg(s)\\\end{cases}\end{aligned}$$解的存在性, 其中$k, N\geq1$是整数, $f=(f_{1},f_{2},\ldots,f_{k}):[0, 1]\times\mathbb{R}^{k}\rightarrow\mathbb{R}^{k}$连续且$g:[0, 1]\rightarrow\mathbb{R}^{k}$是有界变差函数.