关于完全正矩阵的几点注记(英文)

本文给出了一个 n×n非负、对称、弱对角占优矩阵 A为完全正的一个充分条件 .我们还给出了较好的算法 ,用以获得关于矩阵 A(当 A为完全正时 )的分解指数的一个上界 .     

完全正矩阵的整数分解

n阶矩阵A称为完全正的,如果A有分解:A=BB^T,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数.     

关于圈的完全正矩阵实现

本文给出了一个关联图为圈的非负、半正定矩阵A为完全正的一个充要条件.我们还证明了这样的矩阵A（当A为完全正时）的分解指数即为A的阶数.     

基于熵权-灰色关联-TOPSIS法的油田加热炉能效评价

加热炉是油田地面工程中最重要的耗能设备之一,其能效水平直接影响着油田公司的经济效益.为了提高加热炉的能源利用率,建立一套油田加热炉能效评价体系模型并对其进行实例分析.首先采用熵权法确定油田加热炉各评价指标权重序列,并分析其原因,其中加热炉热效率不仅会受到其余各指标的影响,还会受到外部环境以及油品属性等影响,因此其变异程...     

Signed degree sets in signed graphs

The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.     

The length and other invariants of a real field

The length of a field is the smallest integer m such that any totally positive quadratic form of dimension m represents all sums of squares. We investigate this field invariant and compare it to others such as the u-invariant, the Pythagoras number, the Hasse number, and the Mordell function related to sums of squares of linear forms.     

The parametric degree of a rational surface

The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it depends on the choice of the ground field. In this paper, we introduce two geometric invariants of a rational surface, namely level and keel. These two numbers govern the parametric degree in the sense that there exist linear upper and lower bounds. Supported by the Austrian Science Fund (FWF) in the frame of the reseach projects SFB 1303 and P15551     

没有K4-图子式的图的无圈边色数

一个图G 的无圈k- 边染色是指G 的一个正常的不产生双色圈的k- 边染色. G 的无圈边色数a′(G) 定义为使得G 有一个无圈k- 边染色的最小的整数k. 本文完全刻画了最大度不为4 的没有K₄-图子式的图的无圈边色数.     

Extended degree functions and monomial modules

The arithmetic degree, the smallest extended degree, and the homological degree are invariants that have been proposed as alternatives of the degree of a module if this module is not Cohen-Macaulay. We compare these degree functions and study their behavior when passing to the generic initial or the lexicographic submodule. This leads to various bounds and to counterexamples to a conjecture of Gunston and Vasconcelos, respectively. Particular attention is given to the class of sequentially Cohen-Macaulay modules. The results in this case lead to an algorithm that computes the smallest extended degree.

     

Mixed degree number field computations

We present a method for computing complete lists of number fields in cases where the Galois group, as an abstract group, appears as a Galois group in smaller degree. We apply this method to find the 25 octic fields with Galois group \({{\mathrm{PSL}}}_2(7)\) and smallest absolute discriminant. We carry out a number of related computations, including determining the octic field with Galois group \(2^3{:}{{\mathrm{GL}}}_3(2)\) of smallest absolute discriminant.     

基于区间值直觉模糊不确定语言变量的灰色关联度分析方法

给出了区间值直觉模糊不确定语言环境下的灰色关联度分析方法。首先确定了区间值直觉模糊不确定语言正负理想解, 然后计算每个评价值与正负理想解的灰色关联度, 利用属性的权重向量, 计算方案与正负理想解的灰色关联度, 最后计算出方案的相对关联度, 并根据方案的相对关联度对方案进行排序。如果属性权重部分可知, 则需要根据与正理想解有最大的灰色关联度而与负理想解有最小的关联度的原则建立数学规划确定属性的权重。最后, 为了说明算法的可行性和有效性, 将其应用到房地产开发项目的风险评价上。 实例说明了算法的可行性和有效性。     

On representing some lattices as lattices of intermediate subfactors of finite index

We prove that the very simple lattices which consist of a largest, a smallest and 2n pairwise incomparable elements where n is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite depth. Using the same techniques, we give a necessary and sufficient condition for subfactors coming from Loop groups of type A at generic levels to be maximal.     

具有最小度距离的双圈图

记G（n）为所有n阶连通简单双圈图所构成的集合．本文主要讨论G（n）按其度距离从小到大进行排序的问题，并确定了该序的前两个图及其相应的度距离，其中具有最小度距离的图是由星图K1,n-1的一个悬挂点与另外两个悬挂点之间各连上一条边所得的图Sn．     

给定悬挂点数的双圈图中具有最小Hosoya指数的图

Let G be a graph. The Hosoya index Z（G） of a graph G is defined to be the total number of its matchings. In this paper, we characterize the graph with the smallest Hosoya index of bicyclic graphs with given pendent vertices. Finally, we present a new proof about the smallest Hosoya index of bicyclic graphs.     

Ultrametricity indices for the Euclidean and Boolean hypercubes

Motivated by Murtagh’s experimental observation that sparse random samples of the hypercube become more and more ultrametric as the dimension increases, we consider a strict version of his ultrametricity coefficient, an index derived from Rammal’s degree of ultrametricity, and a topological ultrametricity index. First, we prove that the three ultrametricity indices converge in probability to one as dimension increases, if the sample size remains fixed. This is done for uniformly and normally distributed samples in the Euclidean hypercube, and for uniformly distributed samples in F₂ ^N with Hamming distance, as well as for very general probability distributions. Further, this holds true for random categorial data in complete disjunctive form. A second result is that the ultrametricity indices vanish in the limit for the full hypercube F₂ ^N as dimensionN increases,whereby Murtagh’s ultrametricity index is largest, and the topological ultrametricity index smallest, if N is large.     

The smallest positive eigenvalue of graphs under perturbation

The effect on the smallest positive eigenvalue of a bipartite graph is studied when the graph is perturbed by attaching a pendant vertex at one of its vertices. Let $${\widehat{T}}(v)$$ be the graph obtained by attaching a pendant at vertex v of T. We characterize the vertices v such that the smallest positive eigenvalue of $${\widehat{T}}(v)$$ is equal or greater than that of T. As an application, we obtain the pairs of nonisomorphic noncospectral trees having the same smallest positive eigenvalue.     

Power sums with applications to multizeta and zeta zero distribution for Fq[t]

We study the sum of integral powers of monic polynomials of a given degree over a finite field. The combinatorics of cancellations are quite complicated. We prove several results on the degrees of these sums giving direct or recursive formulas, congruence conditions and degree bounds for them. We point out a ‘duality’ between values for positive and negative powers. We show that despite the combinatorial complexity of the actual values, there is an interesting kind of a recursive formula (at least when the finite field is the prime field) which quickly leads to many interesting structural facts, such as Riemann hypothesis for Carlitz–Goss zeta function, monotonicity in degree, non-vanishing and special identity classification for function field multizeta, as easy consequences.     

The scrambling index of symmetric primitive matrices

A nonnegative square matrix A is primitive if some power A^k>0 (that is, A^k is entrywise positive). The least such k is called the exponent of A. In [2], Akelbek and Kirkland defined the scrambling index of a primitive matrix A, which is the smallest positive integer k such that any two rows of A^k have at least one positive element in a coincident position. In this paper, we give a relation between the scrambling index and the exponent for symmetric primitive matrices, and determine the scrambling index set for the class of symmetric primitive matrices. We also characterize completely the symmetric primitive matrices in this class such that the scrambling index is equal to the maximum value.     

On the Hosoya index of graphs

Let G be a (molecular) graph. The Hosoya index Z(G) of G is defined as the number of subsets of the edge set E(G) in which no two edges are adjacent in G, i.e., Z(G) is the total number of matchings of G. In this paper, we determine all the connected graphs G with n + 1 ≤ Z(G) ≤ 5n ? 17 for n ≥ 19. As a byproduct, the graphs of n vertices with Hosoya index from the second smallest value to the twenty first smallest value are obtained for n ≥ 19.     

一个包含Z（n）和D（n）函数的方程及其它的正整数解

对于任意正整数n,著名的伪Smarandache函数Z（n）定义为最小的正整数m使得n｜m（m＋1）／2．而数论函数D（n）定义为最小的正整数m使得n｜d（1）d（2）d（3）…d（m）,其中d（n）为Dirichlet除数函数．本文的主要目的是利用初等方法研究一类包含伪Smarandache函数Z（n）和数论函数D（n）的方程2^z（n）=D（n）的可解性,并获得了该方程的所有正整数解．