关于图的减控制与符号控制

给定一个图G=(V,E),一个函数f:V→{-1,0,1}被称为G的减控制函数,如果对任意v∈V(G)均有∑_μ∈N[v]f(μ)≥1。G的减控制数定义为γ^-(G)=min{∑_v∈Vf(v)|f是G的减控制函数}。图G的符号控制函数的正如减控制函数,差别是广{-1,0,1}换成{-1,1}。符号控制数γ_s(G)是类似的。本文获得γ^-G)和γ_s(G)的一些下界。同时也证明并推广了 Jean Dunbar等提出的一个猜想,即对任意 n阶 2部图 G,均有γ^-(G)≥ 4(n+1^1/2-1)-n成立。     

Sign patterns that allow diagonalizability revisited

Characterization of sign patterns that allow diagonalizability has been a long-standing open problem. In this article, necessary and sufficient conditions for a sign pattern to allow diagonalizability are obtained, in terms of allowing related properties. Some properties of normal sign patterns are considered. In particular, it is shown that normal sign patterns of order up to 3 allow diagonalizability. Two combinatorial necessary conditions for a sign pattern to allow diagonalizability are also presented.     

S_fS_(f-1)约化系数的解析表式

利用线性方程方法和解析延拓得到了导出置换群Sf Sf- 1约化系数解析表达式的一种简单的代数计算方法 .着重讨论了无重复度时Sf Sf- 1约化系数解析表达式的推导方法 .作为例子 ,给出了关于置换群内积 [f- 1,1]·[f- 1,1]和 [f - 1,1]·[f - 2 ,1,1]有关的所有Sf Sf- 1约化系数的解析表达式 .     

Restricted signed permutations counted by the Schröder numbers

Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displaying isomorphisms with the classical Schröder generating tree, and one by giving an isomorphism with a new Schröder generating tree. When combined with a result of Egge and a computer search, this completes the classification of restricted signed permutations counted by the large Schröder numbers in which the set of restrictions consists of two patterns of length 2 and two of length 3.     

Asymptotic Bound on the Characteristic Function of Signed Linear Serial Rank Statistics

This work establishes an asymptotic bound on the characteristic function of signed linear serial rank statistics. The result is obtained under rather general conditions including the important case of van der Waerden scores. It generalizes the result of Seoh (1983, Ph.D. Thesis, Department of Mathematics, Indiana University) and constitutes an essential step to the elaboration of Berry-Esséen's bounds and the establishment of Edgeworth expansions. These statistics constitute a natural tool for testing the hypothesis of white noise with a symmetrical (unspecified) distribution in comparison to other alternative hypothesis of serial dependence.     

Spatial phase coding for incoherent optical processors

In this paper we introduce spatial phase coding of incoherent optical signals for representing signed numbers in optical processors and present an experimental demonstration of this coding technique. If a diffraction grating, such as an acousto-optic cell, modulates a stream of light, the image of the grating can be recovered from the diffracted beam. The position of the grating image, or more precisely its phase, can be used to denote the sign of the number represented by the diffracted light. The intensity of the light represents the magnitude of the number. This technique is more economical than current methods in terms of the number of information channels required to represent a number and the amount of post processing required.     

Asymptotic distribution of rank statistics under dependencies with multivariate application

By modifying the method of projection, the results of Hajek and Huskova are extended to show the asymptotic normality of signed and linear rank statistics under general alternatives for dependent random variables that can be expressed as independent vectors of fixed equal length. The score function is twice differentiable; the regression constants are arbitrary; and the distribution functions are continuous, but arbitrary. As an application, a rank transform statistic is proposed for the one-sample multivariate location model. The ranks of the absolute values of the observations are calculated without regard to component membership, and the scored ranks are substituted in place of the observed values. The limiting distribution of the proposed test statistic is shown to be χ² divided by the degrees of freedom under the null hypothesis, and noncentral χ² divided by the degrees of freedom under the sequence of Pitman alternatives.     

Quantum automorphism groups of vertex-transitive graphs of order ≤ 11

We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups , symmetric groups S _n and quantum symmetric groups , by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.     

符号圈拼接图的零度

令$\eta(\Gamma)$和$c(\Gamma)$是符号图$\Gamma$的零度和基本圈数. 一个符号圈拼接图是指每个块都是圈的连通符号图. 本文证明了对任意符号拼接图$\eta(\Gamma)\le c(\Gamma)+1$成立, 并且刻画了等号成立的极图, 推广了王登银等人(2022)在简单圈拼接图上的结果. 此外, 我们证明了任意的符号拼接图$\eta(\Gamma)\neq c(\Gamma)$, 给出了满足$\eta(\Gamma)=c(\Gamma)-1$的符号拼接图的一些性质并刻画处$\eta(\Gamma)=c(\Gamma)-1$的二部符号拼接图.