两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

基于规模的企业竞争力蜘蛛图法评价研究

科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点.     

Strongly Regular Rings and SF-rings

in this paper, new characteristic properties of strongly regular rings are' given.Relations between certain generalizations of duo rings are also considered. The followingconditions are shown to be equivalent: (1) R is a strongly regular ring; (2) R is a left SFring such that every product of two independent closed left ideals of R is zero; (3) R is aright SF-ring such that every product of two independent closed left ideals of R is zero; (4)R is a left SF-ring whose every special left annihilator is a quasi-ideal; (5) R is a right SFring whose every special left annihilator is a quasi-ideal; (6) R is a left SF-ring whose everymaximal left ideal is a quasi-ideal; (7) R is a right SF-ring whose every maximal left ideal isa quasi-ideal; (8) R is a left SF-ring such that the set N(R) of all nilpotent elements of R isa quasi-ideal; (9) R is a right SF-ring such that N(R) is a quasi-ideal.     

On the unimodality of independence polynomials of very well-covered graphs

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n∕2$. Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing). In this article we show that every graph is embeddable as an induced subgraph of a very well-covered graph whose independence polynomial is unimodal, by considering the location of the roots of such polynomials.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

Denseness of volatile and nonvolatile sequences of functions

In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, $f_n:{\{?1,1\}}^n\to \{?1,1\}$ were introduced. We continue their study of how these definitions relate to noise stability and noise sensitivity. Our main results are that the set of volatile sequences of Boolean functions is a natural way “dense” in the set of all sequences of Boolean functions, and that the set of non-volatile Boolean sequences is not “dense” in the set of noise stable sequences of Boolean functions.     

POINTED REPRESENTATIONS OFINFINITE DIMENSIONAL LIE ALGEBRAS

ＰＯＩＮＴＥＤＲＥＰＲＥＳＥＮＴＡＴＩＯＮＳＯＦＩＮＦＩＮＩＴＥＤＩＭＥＮＳＩＯＮＡＬＬＩＥＡＬＧＥＢＲＡＳ￥ＸＵＸＩＡＮＧＡｂｓｔｒａｃｔ：ＡｃｏｎｔｒａｖａｒｉｅｄｂｉｌｉｎｅａｒｐａｉｒｉｎｇＸｏｎｅｖｅｒｙＭ（ρ）×Ｍ（ρθ）ｉｓｄｅｔｅｒｍ...     

On trees with real-rooted independence polynomial

The independence polynomial of a graph $G$ is

$I(G,x)=\sum _{k\ge 0}{i}_k\left(G\right)x^k,$

where $i_k\left(G\right)$ denotes the number of independent sets of $G$ of size $k$ (note that $i_0\left(G\right)=1$). In this paper we show a new method to prove real-rootedness of the independence polynomials of certain families of trees.In particular we will give a new proof of the real-rootedness of the independence polynomials of centipedes (Zhu’s theorem), caterpillars (Wang and Zhu’s theorem), and we will prove a conjecture of Galvin and Hilyard about the real-rootedness of the independence polynomial of the so-called Fibonacci trees.     

极大子因子

若N是一个Ⅱ1型因子,G是一个有限群且在N上有一个真外作用α,则当G的阶是素数对,N是Ⅱ1型因子M=N(?)αG的极大子因子．另一方面,假设 N(?) M是Ⅱ1型因子的一个包含,M(?)M1是N(?)M的基本构造,[M:N]= p∈N是素数,N’∩ M=CI,N’∩M1是交换的,N,(?)M深度为2,则N是M的极大子因子．     

On the remainder of the semialgebraic Stone–Cěch compactification of a semialgebraic set

In this work we analyze some topological properties of the remainder $?M:={\beta }_{\mathrm{s}}^{?}M?M$ of the semialgebraic Stone–Cěch compactification ${\beta }_{\mathrm{s}}^{?}M$ of a semialgebraic set $M?{\mathbb{R}}^m$ in order to ‘distinguish’ its points from those of M. To that end we prove that the set of points of ${\beta }_{\mathrm{s}}^{?}M$ that admit a metrizable neighborhood in ${\beta }_{\mathrm{s}}^{?}M$ equals $M_{\mathrm{lc}}\cup ({\mathrm{Cl}}_{{\beta }_{\mathrm{s}}^{?}M}({\stackrel{￣}{M}}_{\le 1})?{\stackrel{￣}{M}}_{\le 1})$ where $M_{\mathrm{lc}}$ is the largest locally compact dense subset of M and ${\stackrel{￣}{M}}_{\le 1}$ is the closure in M of the set of 1-dimensional points of M. In addition, we analyze the properties of the sets $\stackrel{?}{?}M$ and $\stackrel{?}{?}M$ of free maximal ideals associated with formal and semialgebraic paths. We prove that both are dense subsets of the remainder ?M and that the differences $?M?\stackrel{?}{?}M$ and $\stackrel{?}{?}M?\stackrel{?}{?}M$ are also dense subsets of ?M. It holds moreover that all the points of $\stackrel{?}{?}M$ have countable systems of neighborhoods in ${\beta }_{\mathrm{s}}^{?}M$.     

A scaling analysis of a star network with logarithmic weights

The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has $L$ requests to transmit and is idle, it tries to access the channel at a rate proportional to $log(1+L)$. A stochastic model of such an algorithm is investigated in the case of the star network, in which $J$ nodes can transmit simultaneously, but interfere with a central node 0 in such a way that node 0 cannot transmit while one of the other nodes does. One studies the impact of the log policy on these $J+1$ interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter $N$ being the norm of the initial state. It is shown that the asymptotic fluid behavior of the system is a consequence of the evolution of the state of the network on a specific time scale $(N^t,t\in (0,1))$. The main result is that, on this time scale and under appropriate conditions, the state of a node with index $j\ge 1$ is of the order of $N^{a_j\left(t\right)}$, with $0\le a_j\left(t\right)<1$, where $t?a_j\left(t\right)$ is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study.     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

Low minor faces in 3-polytopes

It is trivial that every 3-polytope has a face of degree at most 5, called minor. The height $h\left(f\right)$ of a face $f$ is the maximum degree of the vertices incident with $f$. It follows from the partial double $n$-pyramids that $h\left(f\right)$ can be arbitrarily large for each $f$ if a 3-polytope is allowed to have faces of types $(4,4,\infty )$ or $(3,3,3,\infty )$.In 1996, M. Horňák and S. Jendrol’ proved that every 3-polytope without faces of types $(4,4,\infty )$ and$(3,3,3,\infty )$ has a minor face of height at most 39 and constructed such a 3-polytope satisfying $h\left(f\right)\ge 30$ for all minor faces $f$.The purpose of this paper is to prove that every 3-polytope without faces of types $(4,4,\infty )$ and$(3,3,3,\infty )$ has a minor face of height at most 30, which bound is tight due to the Horňák–Jendrol’ construction.     

Problems on matchings and independent sets of a graph

Let $G$ be a finite simple graph. For $X?V\left(G\right)$, the difference of $X$, $d\left(X\right)?\left|X\right|?\left|N\left(X\right)\right|$ where $N\left(X\right)$ is the neighborhood of $X$ and $max\{d\left(X\right):X?V\left(G\right)\}$ is called the critical difference of $G$. $X$ is called a critical set if $d\left(X\right)$ equals the critical difference and $\ker \left(G\right)$ is the intersection of all critical sets. $\mathrm{diadem}\left(G\right)$ is the union of all critical independent sets. An independent set $S$ is an inclusion minimal set with$d\left(S\right)>0$ if no proper subset of $S$ has positive difference.A graph $G$ is called a König–Egerváry graph if the sum of its independence number $\alpha \left(G\right)$ and matching number $\mu \left(G\right)$ equals $\left|V\left(G\right)\right|$.In this paper, we prove a conjecture which states that for any graph the number of inclusion minimal independent set $S$ with $d\left(S\right)>0$ is at least the critical difference of the graph.We also give a new short proof of the inequality $\left|\ker \left(G\right)\right|+\left|\mathrm{diadem}\left(G\right)\right|\le 2\alpha \left(G\right)$.A characterization of unicyclic non-König–Egerváry graphs is also presented and a conjecture which states that for such a graph $G$, the critical difference equals $\alpha \left(G\right)?\mu \left(G\right)$, is proved.We also make an observation about $\ker \left(G\right)$ using Edmonds–Gallai Structure Theorem as a concluding remark.     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

A sufficient condition for DP-4-colorability

DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-choosable. Furthermore, Jin et al. (2016) showed that for each $k\in \{3,4,5,6\}$, every signed planar graph without $C_k$ is signed 4-choosable. In this paper, we show that for each $k\in \{3,4,5,6\}$, every planar graph without $C_k$ is 4-DP-colorable, which is an extension of the above results.     

Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps

This paper deals with the Cayley graph $\mathrm{Cay}({\mathrm{Sym}}_n,T_n)$, where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. As the main result, we prove that $\text{Aut}\left(\mathrm{Cay}({\mathrm{Sym}}_n,T_n)\right)$ is the product of the left translation group and a dihedral group ${\mathsf{D}}_{n+1}$ of order $2(n+1)$. The proof uses several properties of the subgraph $\Gamma$ of $\mathrm{Cay}({\mathrm{Sym}}_n,T_n)$ induced by the set $T_n$. In particular, $\Gamma$ is a $2(n?2)$-regular graph whose automorphism group is ${\mathsf{D}}_{n+1},$ $\Gamma$ has as many as $n+1$ maximal cliques of size $2$, and its subgraph $\Gamma \left(V\right)$ whose vertices are those in these cliques is a 3-regular, Hamiltonian, and vertex-transitive graph. A relation of the unique cyclic subgroup of ${\mathsf{D}}_{n+1}$ of order $n+1$ with regular Cayley maps on ${\text{Sym}}_n$ is also discussed. It is shown that the product of the left translation group and the latter group can be obtained as the automorphism group of a non-$t$-balanced regular Cayley map on ${\text{Sym}}_n$.     

On purely discontinuous additive functionals of subordinate Brownian motions

Let $A_t={\sum }_{s\le t}F(X_{s?},X_s)$ be a purely discontinuous additive functional of a subordinate Brownian motion $X=(X_t,{\mathbb{P}}_x)$. We give a sufficient condition on the non-negative function $F$ that guarantees that finiteness of $A_{\infty }$ implies finiteness of its expectation. This result is then applied to study the relative entropy of ${\mathbb{P}}_x$ and the probability measure induced by a purely discontinuous Girsanov transform of the process $X$. We prove these results under the weak global scaling condition on the Laplace exponent of the underlying subordinator.