Hilbert空间中的K-框架

K-框架是框架理论的一种推广.K-框架可以用于重构Hilbert空间中有界线性算子值域内的元素.本文首先研究了K-框架与框架理论的关系,得到了紧K-框架成为框架当且仅当有界线性算子K是满的,给出了有界线性算子K具有闭值域的K-框架的一个充要条件.并利用有界线性算子K和合成算子构造K-框架,讨论在一定扰动条件下K-框架的稳定性.     

广义框架和算子的伪逆

运用Hilbert空间H上线性算子的伪逆，得到了关于广义框架的框架算子和综合算子的伪逆之间的关系，同时还给出了任意f∈H关于不满足广义框架上界条件的向量族（hm)m∈M的表达式。     

Hilbert空间中的紧K-框架

K-框架是框架的一种推广.本文在Hilbert空间将紧框架推广到K-框架上,引入紧K-框架的概念.通过紧K-框架的算子K和合成算子给出紧K-框架的算子刻画,并利用紧K-框架的算子K给出紧K-框架成为紧框架的一个充要条件.还讨论紧K-框架的构造以及两个紧K-框架集的包含与涉及的算子K的相互关系.     

无穷维Hilbert空间上框架的算子与范数

在框架理论研究中,哪类可逆算子能使得某些框架性质保持不变这个问题是基本和重要的,本文在无穷维Hilbert空间上对下述两个问题进行研究.问题1:哪类可逆算子能使得框架算子保持不变;问题2:哪类可逆算子能使得框架范数只相差一列常数.本文从抽象的算子理论和具体的构造方法两方面对问题1给出解答.利用框架的相容算子的概念,当把问题2中的可逆算子集换成一类较小的算子集时,得到了问题2的回答.     

广义框架和框架算子

本文研究了可分的Hilbert空间H中的广义框架,应用算子论方法给出了广义框架是H中紧广义框架,对偶广义框架,独立广义框架的充要条件:证明了有关广义框架算子的一些结果。     

Hilbert空间上的预框架算子

预框架算子是算子理论应用于框架理论研究中的一个重要算子.在本文中我们将讨论预框架算子在Hilbert空间的框架构造以及框架变换和对偶框架方面的一些应用.特别地,我们得到了Hilbert空间上两框架之和是和空间上的框架以及保持框架与对偶框架某些性质的变换的算子论刻画.     

Hilbert空间H中带符号广义框架的一个刻画

本文研究了可分的Hilbert空间H中带符号广义框架,利用算子理论方法,给出了H中一族向量{hm}m∈M是一个带符号广义框架当且仅当带符号广义框架的框架算子的正部S 和负部S-是有界线性算子,讨论了H中带符号广义框架的框架算子S的可逆性,并且得到了H中每个向量f关于带符号广义框架{hm}m∈M和其对偶带符号广义框架{~hm}m∈M的表示式.     

框架提升的两种方案

该文给出了框架提升的两种方案,这两种方案能够使作者对已有的二进小波框架或滤波器进行修正从而构造出新的小波框架.特别地,这两种方案能够使作者从分段线性的样条紧框架的张量积出发设计出不可分框架,新的框架能起到π/4的整数倍方向上的加权平均算子、Sobel算子和Laplacian算子的作用.     

广义框架在框架算子作用下的一些性质

运用自伴算子的谱理论,讨论了Hilbert空间上的广义框架在框架算子作用下的一些性质.     

有限算子值框架的对偶与相似

本文首先给出有限算子值框架{V_j}_(j=1)~m的对偶框架刻画,其次证明每个有限算子值框架{V_j}_(j=1)~m都相似于一个紧框架,而且这个紧框架的界等于原框架{V_j}_(j=1)~m的框架算子特征值的平均值.     

Optimal control of nonlinear evolution inclusions

In this paper, we study the optimal control of nonlinear evolution inclusions. First, we prove the existence of admissible trajectories and then we show that the set that they form is relatively sequentially compact and in certain cases sequentially compact in an appropriate function space. Then, with the help of a convexity hypothesis and using Cesari's approach, we solve a general Lagrange optimal control problem. After that, we drop the convexity hypothesis and pass to the relaxed system, for which we prove the existence of optimal controls, we show that it has a value equal to that of the original one, and also we prove that the original trajectories are dense in an appropriate topology to the relaxed ones. Finally, we present an example of a nonlinear parabolic optimal control that illustrates the applicability of our results.This research was supported by NSF Grant No. DMS-88-02688.     

Hereditary atomicity in integral domains

If every subring of an integral domain is atomic, we say that the latter is hereditarily atomic. In this paper, we study hereditarily atomic domains. First, we characterize when certain direct limits of Dedekind domains are Dedekind domains in terms of atomic overrings. Then we use this characterization to determine the fields that are hereditarily atomic. On the other hand, we investigate hereditary atomicity in the context of rings of polynomials and rings of Laurent polynomials, characterizing the fields and rings whose rings of polynomials and rings of Laurent polynomials, respectively, are hereditarily atomic. As a result, we obtain two classes of hereditarily atomic domains that cannot be embedded into any hereditarily atomic field. By contrast, we show that rings of power series are never hereditarily atomic. Finally, we make some progress on the still open question of whether every subring of a hereditarily atomic domain satisfies ACCP.     

Exploring an unknown graph

We wish to explore all edges of an unknown directed, strongly connected graph. At each point, we have a map of all nodes and edges we have visited, we can recognize these nodes and edges if we see them again, and we know how many unexplored edges emanate from each node we have visited, but we cannot tell where each leads until we traverse it. We wish to minimize the ratio of the total number of edges traversed divided by the optimum number of traversals, had we known the graph. For Eulerian graphs, this ratio cannot be better than two, and two is achievable by a simple algorithm. In contrast, the ratio is unbounded when the deficiency of the graph (the number of edges that have to be added to make it Eulerian) is unbounded. Our main result is an algorithm that achieves a bounded ratio when the deficiency is bounded. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 265–297, 1999     

Asymptotic behaviour of a closed‐loop thermosyphon with linear friction and viscoelastic binary fluid

Viscoelastic fluids represent a major challenge both from an engineering and from a mathematical point of view. Recently, we have shown that viscoelasticity induces chaos in closed‐loop thermosyphons even when we consider binary fluids, this is, when we consider a solute in the fluid, as water and antifreezes, for example. In this work, we consider a linear friction law, and we show that in this case with the addition of a solute to the fluid we can prove, under some conditions, chaotic asymptotic behavior for suitable geometry of the circuit and heat flux or ambient temperature functions.     

On intermediate inquisitive and dependence logics: An algebraic study

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all intermediate inquisitive and dependence logics. To this end, we define inquisitive and dependence algebras and we investigate their model-theoretic properties. We then focus on finite, core-generated, well-connected inquisitive and dependence algebras: we show they witness the validity of formulas true in inquisitive algebras, and of formulas true in well-connected dependence algebras. Finally, we obtain representation theorems for finite, core-generated, well-connected, inquisitive and dependence algebras and we prove some results connecting team and algebraic semantics.     

Forecasting the integration of immigrants

In this research, we develop and introduce a theoretical and mathematical forecasting framework of immigrant integration using immigrant density as a single driver. First, we introduce the integration concepts we aim at forecasting. Thereafter, we introduce a theoretical and mathematical model of the relationship between integration and immigrant density. Based on this model, we develop a methodological forecasting framework. We test the framework using immigrant integration data from Spain. We produce the forecasts, and conduct the proper evaluation of them. Finally, we conclude with a brief discussion of the wider implications of our results.     

Nonlinear elliptic differential equations with multivalued nonlinearities

In this paper we study nonlinear elliptic boundary value problems with monotone and nonmonotone multivalued nonlinearities. First we consider the case of monotone nonlinearities. In the first result we assume that the multivalued nonlinearity is defined on all ℝ. Assuming the existence of an upper and of a lower solution, we prove the existence of a solution between them. Also for a special version of the problem, we prove the existence of extremal solutions in the order interval formed by the upper and lower solutions. Then we drop the requirement that the monotone nonlinearity is defined on all of ℝ. This case is important because it covers variational inequalities. Using the theory of operators of monotone type we show that the problem has a solution. Finally in the last part we consider an eigenvalue problem with a nonmonotone multivalued nonlinearity. Using the critical point theory for nonsmooth locally Lipschitz functionals we prove the existence of at least two nontrivial solutions (multiplicity theorem).     

信用传染违约Aalen加性风险模型

本文考虑了基于加性风险模型的信用风险违约预报模型,不但考虑了宏观因素和公司个体因素,并且通过引入行业因素来刻画公司间可能存在的不同于宏观因素的信用传染效应,由此克服了以往模型对违约相关性的低估.本文在参数加性风险模型下给出极大似然估计及渐近性,提出两种估计方法并比较二者表现,得到最优权估计更加有效.同时本文还考虑了半参数的风险模型,并基于鞅的估计方程得到其估计及渐近性,均得到不错的结果.     

A conjecture on bipartite graphical regular representations

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR.First, we find a natural obstruction that prevents a finite group from admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite GRR.Next, we prove the existence of bipartite DRRs for most of the finite groups not admitting a bipartite GRR found in this paper. Actually, we prove a much stronger result: we give an asymptotic enumeration of the bipartite DRRs over these groups. Again, based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite DRR.     

The value of foresight

Suppose you have one unit of stock, currently worth 1, which you must sell before time $T$. The Optional Sampling Theorem tells us that whatever stopping time we choose to sell, the expected discounted value we get when we sell will be 1. Suppose however that we are able to see $a$ units of time into the future, and base our stopping rule on that; we should be able to do better than expected value 1. But how much better can we do? And how would we exploit the additional information? The optimal solution to this problem will never be found, but in this paper we establish remarkably close bounds on the value of the problem, and we derive a fairly simple exercise rule that manages to extract most of the value of foresight.