A note on the ranks of 2 × 2 × 2 and 2 × 2 × 2 × 2 tensors

Using rank-1 reduction formula and the vector space spanned by the real rank-1 matrices, we present a different way to show that the maximum possible rank of the 2?×?2?×?2 tensors over the real field is 3. Following, we obtain that the maximum rank of the 2?×?2?×?2?×?2 tensors over the real field is less than or equal to 5 and propose another way to show that the maximum rank of the 2?×?2?×?2?×?2 tensors over the complex field is 4, except one special case.     

On the classification of nonsingular 2×2×2×2 hypercubes

As a first step in the classification of nonsingular 2×2×2×2 hypercubes up to equivalence, we resolve the case where the base field is finite and the hypercubes can be written as a product of two 2×2×2 hypercubes. (Nonsingular hypercubes were introduced by D. Knuth in the context of semifields. Where semifields are related to hypercubes of dimension 3, this paper considers the next case, i.e., hypercubes of dimension 4.) We define the notion of ij-rank (with 1 ≤ i < j ≤ 4) and prove that a hypercube is the product of two 2×2×2 hypercubes if and only if its 12-rank is at most 2. We derive a ‘standard form’ for nonsingular 2×2×2×2 hypercubes of 12-rank less than 4 as a first step in the classification of such hypercubes up to equivalence. Our main result states that the equivalence class of a nonsingular 2×2×2×2 hypercube M of 12-rank 2 depends only on the value of an invariant δ ₀(M) which derives in a natural way from the Cayley hyperdeterminant det₀ M and another polynomial invariant det M of degree 4. As a corollary we prove that the number of equivalence classes is (q + 1)/2 or q/2 depending on whether the order q of the field is odd or even.     

k×n格图Pk×Pn的控制数

k×n格图Pk×Pn是长为k-1的路与长为n-1的路的积.我们证明了对充分大的k和n,Pk×Pn的控制数不超过[(k+2)(n+2)/5]-4.     

k×n格图P_k×P_n的控制数

k× n格图 Pk× Pn是长为 k- 1的路与长为 n- 1的路的积 .我们证明了对充分大的 k和 n,Pk × Pn 的控制数不超过 [(k 2 ) (n 2 ) / 5 ]- 4.     

On the hyperdeterminant for 2×2×3 arrays

We use the representation theory of Lie algebras and computational linear algebra to determine the simplest non-constant invariant polynomial in the entries of a general 2?×?2?×?3 array. This polynomial is homogeneous of degree 6 and has 66 terms with coefficients ±1, ±2 in the 12 indeterminates x _ijk where i, j?=?1,?2 and k?=?1,?2,?3. This invariant can be regarded as a natural generalization of Cayley's hyperdeterminant for 2?×?2?×?2 arrays.     

On the rank of 3×3×3-tensors

Let U, V and W be finite dimensional vector spaces over the same field. The rank of a tensor τ in U???V???W is the minimum dimension of a subspace of U???V???W containing τ and spanned by fundamental tensors, i.e. tensors of the form u???v???w for some u in U, v in V and w in W. We prove that if U, V and W have dimension three, then the rank of a tensor in U???V???W is at most six, and such a bound cannot be improved, in general. Moreover, we discuss how the techniques employed in the proof might be extended to prove upper bounds for the rank of a tensor in U???V???W when the dimensions of U, V and W are higher.     

The rank of a 2 × 2 × 2 tensor

As computing power increases, many more problems in engineering and data analysis involve computation with tensors, or multi-way data arrays. Most applications involve computing a decomposition of a tensor into a linear combination of rank-1 tensors. Ideally, the decomposition involves a minimal number of terms, i.e. computation of the rank of the tensor. Tensor rank is not a straight-forward extension of matrix rank. A constructive proof based on an eigenvalue criterion is provided that shows when a 2?×?2?×?2 tensor over ? is rank-3 and when it is rank-2. The results are extended to show that n?×?n?×?2 tensors over ? have maximum possible rank n?+?k where k is the number of complex conjugate eigenvalue pairs of the matrices forming the two faces of the tensor cube.     

矩阵方程Am×nXn×p=Bm×p的一种分块矩阵解法

利用分块矩阵的运算和矩阵的初等变换给出了矩阵方程Am×nXn×p=Bm×p解的存在性、解的结构,以及求解的一种方法.同时指出该方法对求解线性方程组Am×nx=b也完全适用.     

H~p(R×…×R)的原子分解

本文改进了 S.Y.A.Chang及R.Fefferman的H~p(R×R)原子分解定理,O相似文献   

Canonical forms of 2 × 2 × 2 and 2 × 2 × 2 × 2 arrays over 𝔽2 and 𝔽3

We consider arrays of size 2?×?2?×?2 and 2?×?2?×?2?×?2 over the fields with two and three elements. We use computer algebra to determine the canonical forms of these arrays with respect to the action of the semidirect product of general linear groups with the symmetric group. For each canonical form, we determine the size of its orbit and the rank of the arrays in its orbit.     

三群体2×2×2非对称演化博弈稳定性分析

针对目前三方演化博弈的稳定性研究不足这一问题,利用复制动态方程构建了一般化的三维动力系统,首先讨论了单群体策略演化趋势,接着根据李雅普诺夫稳定性理论分析了系统的渐进稳定性,并结合单群体策略的演化趋势对系统稳定性作了深入研究。研究表明:严格纯策略纳什均衡是ESS,不严格纯策略纳什均衡是线性策略收敛(自定义概念),所有类型的混合策略纳什均衡均为鞍点,共同划分了ESS的吸引域,并证明了零特征值非ESS定理,以及ESS不共边定理,在此基础上给出了N维双策略系统中ESS的最多个数。最后,设计了六组经典算例,首先结合研究结果分析了算例,接着对算例进行系统仿真,仿真结果与理论分析一致,为演化博弈的进一步研究提供借鉴与启发。     

L-Factor of Irreducible x1×x2(×)σ

The L-factor of irreducible x1×x2(×)σ defined by Piatetski-Shapiro is computed by using non-split Bessel functional.     

基于模糊综合的××型电子调速器系统可靠性评价与分配

本文利用模糊数学的理论与方法,讨论了××型电子调整器系统可靠性评价,给出了影响船舶主动力装置系统可靠性的诸多模糊要数的综合与量化方法,提出了基于模糊综合评判的船舶主动力装置系统可靠性分配的方法.     

“15×4”和“14×5”对决赛

正今天数学单元检测试卷发下来,我一看,唉,97分,真无语,老毛病又犯了,14×5我又写成了60。从三年级开始,不知什么原因,我一见此类题就犯怵,比如说:15×4和14×5,14×7和17×4,16×8和18×6,24×7和27×4,等等。爸爸已经给我纠正了多次,可因为它们长得实在太像,我总是搞错。算了,     

Border rank of m×n×(mn−q) tensors

The border rank of a nondegenerate m×n×(mn−q) tensor over the complex field is mn−q provided that q⩽max(m,n).