The Permutations 123p 4…p m and 321p 4…p m are Wilf-Equivalent

Write p ₁, p ₂…p _m for the permutation matrix δ _{pi, j} . Let S _n (M) be the set of n×n permutation matrices which do not contain the m×m permutation matrix M as a submatrix. In [7] Simion and Schmidt show bijectively that |S _n (123) |=|S _n (213) |. In [9] this was generalised to a bijection between S _n (12 p ₃…p _m ) and S _n (21 p ₃…p _m ). In the present paper we obtain a bijection between S _n (123 p ₄…p _m ) and S _n (321 p ₄…p _m ). Revised: March 24, 1999     

一些特殊的p核p群

给出了一些特殊的p核p群的分类,并给出了一些非正则p核p群的例子.     

On (p a,p, p a,p a−1 )-relative difference sets

Abelian relative difference sets of parameters (m, n, k, )=(p ^a , p, p ^a , p ^a–1 )are studied in this paper. In particular, we show that for an abelian groupG of orderp ^2c+1 and a subgroupN ofG of orderp, a (p ^2c , p, p ^2c , p ^2c–1 )-relative difference set exists inG relative toN if and only if exp (G)p ^c+1 .Furthermore, we have some structural results on (p ^2c p, p ^2c , p ^2c–1 )-relative difference sets in abelian groups of exponentp ^c+1 . We also show that for an abelian groupG of order 2^2c+2 and a subgroupN ofG of order 2, a (2^2c+1, 2, 2^2c+1, 2^2c )-relative difference set exists inG relative toN if and only if exp(G)2 ^c+2 andN is contained in a cyclic subgroup ofG of order 4. New constructions of (p ^2c+1 , p, p ^2c+1 , p ^2c )-relative difference sets, wherep is an odd prime, are given. However, we cannot find the necessary and sufficient condition for this case.     

右连续p函数和半p函数

本文推广 Davidson 关于右连续 p 函数构造的一个结果,得到每个右连续半 p 函数必可表成一个取值于[0,1]中的常函数与一个标准半 p 函数的点乘积这个基本结果.     

右连续p函数和半p函数

本文推广Davidson关于右连续p函数构造的一个结果,得到每个右连续半p函数必可表成一个取值于[0,1]中的常函数与一个标准半p函数的点乘积这个基本结果。     

Базисы из экспонент в пространствахL p

Let the rootsλ _n of an entire functionL(z) be separated and lie in some horizontal strip ¦Im z¦ ≦h, and suppose that $$0< c \leqq |L(z)|(1 + |z|)^{ - b} \exp ( - a|\operatorname{Im} z|) \leqq C< \infty$$ for ¦Imz¦≧H>h. If 1<p<2 and - 1/pq (1/q+1/p=1), then the system {exp (iλ _n x)} _n=0 ^∞ constitutes a basis нn the spaceL ^p (-a,a). In the caseb=1/q orb=?1/p the theorem fails, Equivalence of the following two statements is also proved:

1. {exp (iλ _n x)} _n=0 ^∞ is an extendable convergence system inL ^p from the interval (-a, a).
2. {exp (iλ _n x)} _n=0 ^∞ is a continuable basis inL ^p (-a,a).

     

p—Frattini子解与p—中心

本文对p-Frattini子群进行了进一步的．研究,给出了p-Frattini子群与p-中心的关系,我们的结果推广了Gaschutz在文献[1]中关于Frattini子群与群的中心间的关系。     

Об отделимости множе ств гиперплоскостью вL p

LetA and be two arbitrary sets in the real spaceL _p, 1p<. Sufficient conditions are obtained for their strict separability by a hyperplane, in terms of the distance between the setsd(A,B) _p=inf{x-y_p,xA,yB} and their diametersd(A) _p, d(B)_p, whered(A) _p=sup{x-y_p; x,yA}. In particular, it is proved that if in an infinite-demensional spaceL _p we haved ^r(A,B)_p>2^–r+1(d^r(A)_p+d^r(B)_p), r=min{p, p(p–1)^–1}, then there is a hyperplane which separatesA andB. On the other hand, the conditiond ^r(A,B)_p=2^–r+1(d^r(A)_p+d^r(B)_p) does not guarantee strict separability. Earlier these results where obtained by V. L. Dol'nikov for the case of Euclidean spaces.     

Перестановки систем ы Хаара в пространств ахℒ p

Linear operators of the form are studied, where { _n ^k } denotes the Haar system and _n a permutation of the integers 1, 2, ..., 2 ⁿ . Conditions ensuring boundedness of these operators in the Lorentz spacesL _p,q , and in particular inL _p , are found.     

包装{(p,p-1),(p,p)}图对和 Slater 问题

设 G 是一个简单无向图.V(G),E(G)分别表示 G 的顶点集和边集.(?)表示 G 的补图.我们以 S_(?) 表示 n 1阶星图 k_(1,n-1).称 G 是(p,p—k)图,如果|E(G)|=|V(G)|—k.称|V(G)|为图 G 的阶.设 G_1,G_2是同阶图,(?)_1是 V(G_1)到 V(G_2)的一个双射,(?)_2是 V(G_2)上的一个置换,我们用(?)_2(?)_1表示 V(G_1)到 V(G_2)的双射,其作用为     

p.n.p.矩阵的等价表征

本文通过对闽南三角地区资源、社会经济、农业发展等情况分析,论述并提出了建立以外向型为主,内外兼容的新的农业发展模式,该模式兼有外向型农业和内向型农业的特点与功能。文章还论述了如何应用新模式规划闽南三角地区农业发展战略。     

逆p·n·p·矩阵的表征

一个n阶实方阵A,若其各阶主子式皆非正,则称A为p.n.p.矩阵,记作A∈PNP;特别地,若A∈NP且各阶主子式皆负,则称A为p.n.矩阵,记作A∈PN进一步,若n阶实方阵A非奇异,且A^-1∈PNP,则称A为逆p.n.p.矩阵,记作A∈IPNP;特别地,若A^-1∈PN,则称A为逆p.n.矩阵,记作A∈IPN。     

p.n.p.矩阵的一些性质

一个n阶实方阵若其各阶主子式皆非正,则称为部分非正阵,简写作p.n.p.矩阵.特别地,各阶主子式皆负的p.n.p.矩阵称为部分负矩阵,简写为p.n.矩阵。文[1]、[5]讨论了p.n.p.矩阵的谱性质。本文在[5]的基础上讨论了p.n.p.矩阵的若干性质,并给出p.n.p.矩阵特征值的某些估计式。 引理1 设A=(A_(ij)_n×n为一p.n.p.矩阵,则A的特征值之实部不全为负(n≥2)。 证 设λ_1,λ_2,…,λ_n为A的全部特征值。假定A的每一特征值之实部皆为负。分两种情     

On the central limit theorem in R p when p→∞

Summary Let X ₁ , X ₂ , ..., X _n be i.i.d. random vectors in R ^p where p tends to infinity. A theorem is presented showing that the Central Limit Theorem should hold if p ²/n tends to zero. Furthermore, an example is presented with X _i having a mixed multivariate normal distribution (with finite moment generating function) for which a uniform normal approximation to the distribution of the sample mean can not hold if p ²/n does not tend to zero. Research supported in part by National Science Foundation Grants MCS 80-02340, MCS 83-01834, and DMS 85-03785     

以任意奇素数p为模的2p×2p差表的简易求法

一、引言 设有一个r阶有限加群G,又有一个n行k列矩阵 M=(m_(ij)),m_(ij)∈G。若对任意给定的一对列指标j_1≠j_2,当i取值1至n时的n个差α_(ij_1)-α_(ij_2)中,群G的每个元素都出现相同次数,就说矩阵M是群G上的n×k差表(difference scheme)。特     

关于p.n.p.矩阵的谱性质

§1 引言 定义1 设∈R~n×n),若A的每一k阶主子式是非正的,1≤k≤n,则称A是一偏非正矩阵,简称p.n.p.矩阵。 特别地,若一p.n.p.矩阵的每一k阶主子式是负的,1≤k≤n,则称此矩阵为偏负矩阵,简称为p.n.矩阵。 1974年J.J.Johnson给出了p.n.p.矩阵具有一负特征值的充分条件以及p.n.矩阵的两个谱性质。     

关于p闭群的阶

文中p为指定的某素数。群皆指有限群。术语与符号一般按[1].若群 G 的 Sylow p-子群在 G 正规,则称 G 为 p-闭群(p-closed group)。p-闭群的子群,商群,以及两 p-闭群的直积显然都是 p-闭群。设 G 为 p-闭群,P∈syl_p(G)。若 G/P 为交换群且其指数(exponent)除得尽 p-1,则称 G 为强 p-闭(strictly p-closed)。强 p-闭群是超可解群,且一般超可解群与强     

p阶Feigenbaum映射

A continuous map f from the unit closed interval into itself is called a p-order Feigenbaum's map if fp(λx) = λf(x),f(O)=1 and f|[λ,1] is univallecular. In this paper, some characterizations of p order Feigenbaum's maps are discussed and the existence for both types of such maps is proven.     

亚循环p群的p次中心扩张(Ⅰ)

设N,H是任意的群.若存在群G,它具有正规子群■,使得■且■,则称群G为N被H的中心扩张.完全给出了当|N|=p,H为奇阶亚循环p群时,N被H的中心扩张得到的所有不同构的群.     

Embedding (p,p−1) graphs in their complements

A graphG is embeddable in its complement ifG is isomorphic with a subgraph of . A complete characterization is given of those (p,p−1) graphs which are embeddable in their complements. In particular, letG be a (p,p−1) graph wherep≧6 ifp is even andp≧9 ifp is odd; thenG is embeddable in if and only ifG is neither the starK _1,p−1 norK _1,n ∪C ₃ withn≧4.