0-1对策的完全混合Nash均衡的代数求解法

将求解一般0-1策略对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程组的问题.作为一种特殊而重要的情形,利用Pascal矩阵,Newton矩阵(对角元素为Newton二项式系数的对角矩阵)和Pascal-Newton矩阵(Pascal矩阵和Newton矩阵的逆阵的乘积)将求解对称0-1对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程的问题,并给出第二问题的反问题(由完全混合Nash均衡求解对称0-1对策族)的求解方法.同时,给出了一些算例来说明对应问题的算法.     

一道矩阵作业题引起的困惑

1问题与困惑 学生在学习苏教版4-2《矩阵与变换》后，遇到这样一道作业题： 线性变换T把点（1，0）变成坐标为（1，-1），并且把圆x^2＋y^2-2y=0变为圆x^2＋y^2-2x-2y=0.     

一类恰含一个3-圈的三色本原有向图指数上界

在传统(单个)非负本原矩阵的基础上,将非负本原矩阵对的研究推广到非负本原矩阵簇,是组合矩阵论中一个崭新的研究内容.事实上,非负矩阵簇可以与多色有向图建立一一对应关系,从而把矩阵的问题转化为图的问题进行研究.该文研究了一类三色本原有向图,它的未着色图中包含n个顶点,一个n-圈、一个(n-1)-圈和一个3-圈,给出本原条件和指数上界.     

(0,1)-矩阵的积和式的图表示及其相关性质

将(0，1)．矩阵的积和式的记数问题转化为它的伴随图或伴随有向图上相关元素的记数问题，能使复杂的计数问题变得相对直观化和简单化．本文给出了(0，1)-矩阵的积和式的图论表达式，并以该表达式为基础，主要解决了2．正则图类的邻接矩阵的最大积和式的记数问题以及它的反问题，即确定了零积和式临界图的极大边数及其图类．     

基于模块化外包的项目调度问题研究——以三峡工程TCP/C1-3-1A-1项目为例

全球化下的市场竞争促使企业在全球范围进行资源整合,外包决策由此成为影响项目调度的重要因素。以三峡三期工程TCP/C1-3-1A-1项目为例,运用设计结构矩阵构建了模块化项目网络,并分两个层次对外包模块进行初选,在此基础上建立了基于模块化外包的项目调度模型。求解结果表明,由于模块化外包消除了承包商的资源瓶颈,降低了资源闲置率,并由此产生了良好的协同效应,因此可以有效地提高项目收益,并大大压缩项目工期。     

语言判断矩阵满意一致性判定方法的研究

在语言判断矩阵及其满意一致性定义的基础上,给出了语言判断矩阵的偏好关系矩阵和0-1型排列偏好关系矩阵的定义,并得出用标准0-1型排列矩阵来判定语言判断矩阵满意一致性的方法,方法不仅解决了存在等价方案时的满意一致性问题,而且简单有效;最后进行了实例分析,验证了该方法的有效性.     

基于正弦型光滑打磨函数对0-1规划问题的连续化求解方法

传统的求解0-1规划问题方法大多属于直接离散的解法.现提出一个包含严格转换和近似逼近三个步骤的连续化解法:(1)借助阶跃函数把0-1离散变量转化为[0,1]区间上的连续变量;(2)对目标函数采用逼近折中阶跃函数近光滑打磨函数,约束条件采用线性打磨函数逼近折中阶跃函数,把0-1规划问题由离散问题转化为连续优化模型;(3)利用高阶光滑的解法求解优化模型.该方法打破了特定求解方法仅适用于特定类型0-1规划问题惯例,使求解0-1规划问题的方法更加一般化.在具体求解时,采用正弦型光滑打磨函数来逼近折中阶跃函数,计算效果很好.     

套汇问题研究

把套汇问题转化为网络规划中找负回路问题,用F loyd算法解决了套汇问题.讨论了避免套汇兑换率矩阵必须是正互反矩阵的结论,以及给出了兑换率矩阵调整为正互反矩阵的方法.     

求解子矩阵约束条件下四元数矩阵方程AXB=C的矩阵半张量积方法

1引言子矩阵约束下的矩阵方程问题是指限定矩阵方程的解X的一个子矩阵X_(0),然后在某个约束集合中求解矩阵方程.如求满足X([1:q])=X_(0)的对称解,这里X([1:q])表示矩阵X的q阶顺序主子阵.子矩阵约束下的矩阵方程问题来源于实际中的系统扩张问题[1],有一定的实际意义和重要性,受到了许多学者的关注,如[2-4]中,彭分别研究了子矩阵约束条件下实矩阵方程AX=B的实矩阵解,中心对称解和双对称解.     

渡河登岸点的最佳选择

1　问题的提出在体育比赛中 ,有一种“铁人”项目的比赛 ,运动员通过跑步、划船、骑自行车等项目的比赛 ,以累计成绩决定胜负 .在这类比赛中常遇到如下情况 :运动员从Ａ地出发跑步到河岸渡口Ｂ处 ,然后划船到河对岸Ｐ处 ,上岸后沿河岸骑自行车到达河岸边的终点Ｃ处 (如图 1所示 ) .如果某两名运动员的跑步、划船、骑自行车的速度均相同 ,那么他们如何选择登岸点Ｐ的位置就成为取胜的关键 ,下面我们对这一问题通过构建数学模型加以探讨 .2　问题的分析与建模图 1由于这两名运动员的各项运动速度均相同 ,所以从Ａ点到Ｂ点所用时间也应相同 ,故…     

On linear forbidden submatrices

In this paper we study the extremal problem of finding how many 1 entries an n by n 0-1 matrix can have if it does not contain certain forbidden patterns as submatrices. We call the number of 1 entries of a 0-1 matrix its weight. The extremal function of a pattern is the maximum weight of an n by n 0-1 matrix that does not contain this pattern as a submatrix. We call a pattern (a 0-1 matrix) linear if its extremal function is O(n). Our main results are modest steps towards the elusive goal of characterizing linear patterns. We find novel ways to generate new linear patterns from known ones and use this to prove the linearity of some patterns. We also find the first minimal non-linear pattern of weight above 4. We also propose an infinite sequence of patterns that we conjecture to be minimal non-linear but have Ω(nlogn) as their extremal function. We prove a weaker statement only, namely that there are infinitely many minimal not quasi-linear patterns among the submatrices of these matrices. For the definition of these terms see below.     

m次数量幂等矩阵线性组合的可逆性

如果有非零数λ与μ使Pm=λP,Qm=μQ,则称P,Q分别是由λ,μ确定的m次数量幂等矩阵．本文证明了,若有非零数a与b,当μam-1（-1）m-1μbm-1≠0时,使可交换的分别由λ,μ确定的m次数量幂等矩阵P,Q的线性组合aP＋bQ是可逆的,那么对任意非零数u,u,当λμm-1-（-1）m-1μvm-1≠0时,uP＋vQ也是可逆的．本文主要结果和方法的应用,可以推广已有文献的2次、3次幂等矩阵的线性组合可逆的结论．     

一般矩阵元素扰动秩的一个定理

在文 [1 ]列满矩阵元素扰动秩的稳定性基础上 ,运用矩阵的范数 ,分析、研究一般矩阵 A∈Cm× nr元素扰动秩的问题 ,得出“存在 ε>0 ,只要 δA∈Cm× n,满足‖ δA‖ <ε,则有 A+δA∈∪nk=r Cm× nk ”的结论 .     

The border rank of the multiplication of matrices is seven

We prove that the bilinear map corresponding to matrix multiplication of matrices is not the limit of a sequence of bilinear maps that can be executed by performing six multiplications. This solves a longstanding problem dating back to Strassen's discovery in 1968 that the map could be executed by performing seven multiplications.

     

具有位数3和4的双随机循环矩阵中的素元

本文研究了双随机循环矩阵中素元的分类问题．由于任一n阶双随机循环矩阵都可以唯一地表示为移位的n-1次一元多项式,从而可把双随机循环矩阵中素元的分类问题简化为解双随机循环矩阵上的一个方程．应用此原理,本文完全解决了判别具有位数3的n阶双随机循环矩阵是否为素元的问题,并给出了n阶双随机循环矩阵中一类具有位数4的素元．     

Least-Squares Solution of Inverse Problem for Hermitian Anti-reflexive Matrices and Its Appoximation

In this paper, we first consider the least-squares solution of the matrix inverse problem as follows： Find a hermitian anti-reflexive matrix corresponding to a given generalized reflection matrix J such that for given matrices X, B we have minA ｜｜AX - B｜｜. The existence theorems are obtained, and a general representation of such a matrix is presented. We denote the set of such matrices by SE. Then the matrix nearness problem for the matrix inverse problem is discussed. That is： Given an arbitrary A^＊, find a matrix A E SE which is nearest to A^＊ in Frobenius norm. We show that the nearest matrix is unique and provide an expression for this nearest matrix.     

Degrees of nonlinearity in forbidden 0–1 matrix problems

A 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A matches P, where a 0 in P matches either 0 or 1 in A. The theory of forbidden matrices subsumes many extremal problems in combinatorics and graph theory such as bounding the length of Davenport–Schinzel sequences and their generalizations, Stanley and Wilf’s permutation avoidance problem, and Turán-type subgraph avoidance problems. In addition, forbidden matrix theory has proved to be a powerful tool in discrete geometry and the analysis of both geometric and non-geometric algorithms.Clearly a 0–1 matrix can be interpreted as the incidence matrix of a bipartite graph in which vertices on each side of the partition are ordered. Füredi and Hajnal conjectured that if P corresponds to an acyclic graph then the maximum weight (number of 1s) in an n×n matrix avoiding P is O(nlogn). In the first part of the article we refute of this conjecture. We exhibit n×n matrices with weight Θ(nlognloglogn) that avoid a relatively small acyclic matrix. The matrices are constructed via two complementary composition operations for 0–1 matrices. In the second part of the article we simplify one aspect of Keszegh and Geneson’s proof that there are infinitely many minimal nonlinear forbidden 0–1 matrices. In the last part of the article we investigate the relationship between 0–1 matrices and generalized Davenport–Schinzel sequences. We prove that all forbidden subsequences formed by concatenating two permutations have a linear extremal function.     

Perturbation Analysis for the Eigenvalue Problem of a Formal Product of Matrices

We study the perturbation theory for the eigenvalue problem of a formal matrix product A ₁ ^{s 1} ··· A _p ^{s p}, where all A _k are square and s _k {–1, 1}. We generalize the classical perturbation results for matrices and matrix pencils to perturbation results for generalized deflating subspaces and eigenvalues of such formal matrix products. As an application we then extend the structured perturbation theory for the eigenvalue problem of Hamiltonian matrices to Hamiltonian/skew-Hamiltonian pencils.     

On a sub‐Stiefel Procrustes problem arising in computer vision

A sub‐Stiefel matrix is a matrix that results from deleting simultaneously the last row and the last column of an orthogonal matrix. In this paper, we consider a Procrustes problem on the set of sub‐Stiefel matrices of order n. For n = 2, this problem has arisen in computer vision to solve the surface unfolding problem considered by R. Fereirra, J. Xavier and J. Costeira. An iterative algorithm for computing the solution of the sub‐Stiefel Procrustes problem for an arbitrary n is proposed, and some numerical experiments are carried out to illustrate its performance. For these purposes, we investigate the properties of sub‐Stiefel matrices. In particular, we derive two necessary and sufficient conditions for a matrix to be sub‐Stiefel. We also relate the sub‐Stiefel Procrustes problem with the Stiefel Procrustes problem and compare it with the orthogonal Procrustes problem. Copyright © 2015 John Wiley & Sons, Ltd.