Real Brauer characters

In this paper, we determine the structure of finite groups with a small number of real-valued irreducible Brauer characters.     

The Forcing Convexity Number of a Graph

For two vertices u and v of a connected graph G, the set I(u,v) consists of all those vertices lying on a u-v geodesic in G. For a set S of vertices of G, the union of all sets I(u,v) for u, v S is denoted by I(S). A set S is a convex set if I(S) = S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. A convex set S in G with |S| = con(G) is called a maximum convex set. A subset T of a maximum convex set S of a connected graph G is called a forcing subset for S if S is the unique maximum convex set containing T. The forcing convexity number f(S, con) of S is the minimum cardinality among the forcing subsets for S, and the forcing convexity number f(G, con) of G is the minimum forcing convexity number among all maximum convex sets of G. The forcing convexity numbers of several classes of graphs are presented, including complete bipartite graphs, trees, and cycles. For every graph G, f(G, con) con(G). It is shown that every pair a, b of integers with 0 a b and b is realizable as the forcing convexity number and convexity number, respectively, of some connected graph. The forcing convexity number of the Cartesian product of H × K ₂ for a nontrivial connected graph H is studied.     

“非平均区间数”计算及其在政府决策信息系统中的应用

本文在已有的“区间数”定义及排序算法的基础上 ,针对层次分析法提出了更加灵活 ,准确的描述主观评判的“非平均区间数”概念及其排序算法 .并结合政府决策信息系统阐述了“非平均区间数”的应用     

树的四类控制参数的束缚数

图的束缚数是图的控制数研究中的一个重要方面，它在某种程度上反映了图的控制数对边数的敏感度．本文通过对图的结构特征的分析．研究了树的四类控制参数的束缚数，即控制数，强控制数，弱控制数．分数控制数的束缚数．分别给出了其紧的上界．     

居民家庭耐用消费品的消费时机选择:实物期权的方法

针对当前居民家庭消费的特点，为了合理地选择耐用消费品的最佳购买时机，本分析耐用品的价格和性能具有实物期权的属性，建立了一个关于“性价比”变量的随机微分方程，并且求出了购买时机临界值的解析公式。最后对日常生活中发生的购买时间现象给予了解释。     

Counting arithmetical structures on paths and cycles

Let $G$ be a finite, connected graph. An arithmetical structure on $G$ is a pair of positive integer vectors $\mathbf{d},\mathbf{r}$ such that $(diag\left(\mathbf{d}\right)?A)\mathbf{r}=0$, where $A$ is the adjacency matrix of $G$. We investigate the combinatorics of arithmetical structures on path and cycle graphs, as well as the associated critical groups (the torsion part of the cokernels of the matrices $(diag\left(\mathbf{d}\right)?A)$). For paths, we prove that arithmetical structures are enumerated by the Catalan numbers, and we obtain refined enumeration results related to ballot sequences. For cycles, we prove that arithmetical structures are enumerated by the binomial coefficients $\left(\genfrac{}{}{0ex}{}{2n?1}{n?1}\right)$, and we obtain refined enumeration results related to multisets. In addition, we determine the critical groups for all arithmetical structures on paths and cycles.     

Null decomposition of trees

Let $T$ be a tree. We show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, which is a decomposition into two different types of trees: N-trees and S-trees. N-trees are the trees that have a unique maximum (perfect) matching. S-trees are the trees with a unique maximum independent set. We obtain formulas for the independence number and the matching number of a tree using this decomposition. We also show how the number of maximum matchings and the number of maximum independent sets in a tree are related to its null decomposition.     

A variant of Nim

We discuss a version of Nim in which players are allowed to use a move from the traditional form of Nim or to split a pile after adding some predetermined number $q$ of coins to the pile. When $q$ is odd or negative, the play proceeds as in regular Nim. For $q$ even and non-negative, we find three patterns: $q=0$, $q=2$ and $q?4$.     

Some remarks on pseudo-umbilical totally real submanifolds in a complex projective space

This paper studies the relationship between the pseudo-umbilical totally real submanifolds and the minimal totally real submanifolds in a complex projective space. Two theo- rems which claim that some types of pseudo-umbilical totally real submanifolds must be minimal submanifolds are proved.