Adams谱序列上的非平凡乘积b_0k_0δ_(s+4)

主要用May谱序列证明了非平凡的乘积b_0k_0δ_(s+4)∈Ext_A~(s+8,t)(Z_p,Z_p),其中p是大于等于7的素数,0≤sp-4,q=2(p-1),t=(s+4)p~3q+(s+3)p~2q+(s+5)pq+(s+2)q+s.     

古典Adams谱序列中的一个非平凡乘积元

证明了古典Adams谱序列中的乘积元b_0~2β_s∈Ext_A~(s+4,t(s))(Z_p,Z_p)的非平凡性,其中p≥11,2≤sp-2,t(s)=2(p-1)[(s+2)p+(s-1)]+(s-2).     

球面稳定同伦群的(~γ)t(~l)1g0新元素族

首先给出了May谱序列Es1,t,u项的几个结果,然后利用这些结果和关于ExtsP,t(Zp,Zp)的一个估计(P为由mod p Steenrod代数A的所有循环缩减幂Pi(i≥0)生成的子代数)得出了乘积~γt~l1g0∈Ext*A,*(Zp,Zp)(3≤t＜p-2)在Adams谱序列的收敛性,其中g0∈Ext2A,pq+2q(Zp,Zp),~l1∈Ext3A,p2q+2pq(Zp,Zp).     

模p-Steenrod代数高维上同调群中的一个非平凡乘积元

证明了模p-Steenrod代数高维上同调群中的乘积元b_0~2γs∈Ext_A~(s+4,t(s))(Z_p,Z_p)的非平凡性,其中p≥11,3≤sp-1,t(s)=2(p-1)[sp~2+(s+1)p+(s-2)]+(s-3).     

球面稳定同伦群的两个新元素h0(b1)3(γ)s和(b1)3g0(γ)s

本文证明了当p(＞-)11,3(<-)s＜p-3时,h0(b1)3∈Ext7,3p2q+qA(H*V(2),Zp),(b1)3g0∈Ext8,3p2q+pq+2q(H*V(2),Zp)在Adams谱序列中分别收敛到π*V(2)的非零元,h0(b1)3(γ)s∈Ext7+s,(s+3)p2q+(s-1)pq+(s-3)A(Zp,Zp)在Adams谱序列中分别收敛到π*S的非零p阶元.     

模p Steenrod代数上同调的一些注记

模p Steenrod代数A的上同调H~(s,t)(A)是决定球面稳定同伦群的最有力数据.首先给出了模p Steenrod代数A和May谱序列的一些重要结论,而后给出与乘积元γ_(s+3)l_ng_0∈H~(s+8,t(s,n))(A)密切相关的May谱E_1项的结果,这些结论对该乘积元的非平凡性研究有重要意义,其中t(s,n)=p~(n+1)q+2p~nq+(s+3)p~2q+(s+3)pq+(s+3)q+s, 0≤sp-6, n≥4, p≥11, q=2(p-1).     

球面稳定同伦群的两个新元素h0(b1)3(γ)s和(b1)3g0(γ)s

本文证明了当p(＞-)11,3(<-)s＜p-3时,h0(b1)3∈Ext7,3p2q+qA(H*V(2),Zp),(b1)3g0∈Ext8,3p2q+pq+2q(H*V(2),Zp)在Adams谱序列中分别收敛到π*V(2)的非零元,h0(b1)3(γ)s∈Ext7+s,(s+3)p2q+(s-1)pq+(s-3)A(Zp,Zp)在Adams谱序列中分别收敛到π*S的非零p阶元.     

球面稳定同伦群中的ξ_n-相关元素的非平凡性

利用Adams谱序列与May谱序列,发掘了球面稳定同伦群中一族ξ_n的相关元素.这里ξ_n∈π*M在Adams谱序列中由h_0h_n∈Ext_A~(2,p~nq+q)(H*M,Z_p)所表示,其中p≥7,n3,q=2(p-1).     

球面稳定同伦群中非平凡元素γ_sξ_n

当p≥5, n≥0时,(i_1i_0)_*(h_n)∈Ext_■~(1,p~nq)(H~*K,Z_p)在Adams谱序列中是永久循环,并且收敛到π_(p~nq-1)K中的非零元.本文在此基础上,考虑了涉及第三希腊字母类乘积元素的收敛性,并且扩大了球面稳定同伦群中非平凡元素滤子s+1的取值范围,即当p+1 s+1 2p时,■_sh_n∈Ext_■~(s+1,t)(Z_p,Z_p)在Adams谱序列中是永久循环,并且收敛到π_(t-s-1)S中的非零元γ_sξ_n,其中p≥7, n≥3, t=p~nq+sp~2q+(s-1)pq+(s-2)q+s-3,q=2(p-1).     

球面稳定同伦群的两个新元素h_0(b_1)~3_s)和(b_1)~3g_0_s)

本文证明了当p≥11,3≤s相似文献   

Toda-Smith谱同伦群的具有第六滤子的新非平凡元素族

当p≥7,n≥3时,本文找到一个永久循环 ,它在Adams谱序列中收敛到 的一个非零元素,由Adams分解得到 ,使得 ,进而得到 并且它具有第六滤子．     

Fibonacci数列的模数列的周期性

对于Fibonacci数列{Fn}以及给定的正整数m,由Fn关于模m的最小非负剩余an,构成一个新的数列{an},称为Fibonacci数列的模数列.本文利用初等数论的知识和数学归纳法,证明了Fibonacci数列的模数列是周期数列,并且是纯周期数列.     

A simple criterion on degree sequences of graphs

A finite sequence of nonnegative integers is called graphic if the terms in the sequence can be realized as the degrees of vertices of a finite simple graph. We present two new characterizations of graphic sequences. The first of these is similar to a result of Havel-Hakimi, and the second equivalent to a result of Erd?s & Gallai, thus providing a short proof of the latter result. We also show how some known results concerning degree sets and degree sequences follow from our results.     

Almost overcomplete and almost overtotal sequences in Banach spaces

We introduce the new concepts of almost overcomplete sequence in a Banach space and almost overtotal sequence in a dual space. We prove that any of such sequences is relatively norm-compact and we present several applications of this fact.     

有限域上二次型序列与几何序列的互相关性

§1Introduction Letpbeaprimenumber,q=pm,andFqdenotethefinitefieldwithqelements.Fo anyn≥1,Trmnm(·)isthetracefunctionfromFqntoFq.LetαbeaprimitiveelementofFq and{α1,α2,...,αn}beabasisofFqnoverFq.Definition1.ForanonlinearfunctionffromFqtoFp,thesequenceS={Si}qn-1i=1withit termdefinedby Si=f(Trmnm(αi))(1iscalledageometricsequence.SuchageometricsequenceShasperioddividingqn-1.Geometricsequences includingm-sequence[1],GMWsequence[2,3],cascadedGMWsequence[4,5]andman others[6],mayhavelar…     

p元扩展序列的线性复杂度

给出了由周期为p~m-1的p元序列导出的周期为p~(em)-1的p元扩展序列的线性复杂度.作为一个实例,计算了扩展Legendre序列的线性复杂度.     

Graphic sequences with a realization containing intersecting cliques

Let r≥ 1, k≥ 2 and Fm1 ,...,mki;r denote the most general definition of a friendship graph, that is, the graph of Kr+m1 , . . . , Kr+mk meeting in a common r set, where Kr+mi is the complete graph on r + mi vertices. Clearly, | Fm1 ,...,mki;r | = m1+ ··· + mk + r. Let σ(Fm1 ,...,mki;r , n) be the smallest even integer such that every n-term graphic sequence π = (d1, d2, . . . , dn) with term sum σ(π) = d1 + d2 + ··· + dn ≥σ(Fm1 ,...,mki;r,n) has a realization G containing Fm1 ,...,mki;r as a subgraph. In this paper, we determine σ(Fm1 ,...,mki;r,n) for n sufficiently large.     

A pattern sequence approach to Stern’s sequence

Suppose that w∈1{0,1}^∗ and let a_w(n) be the number of occurrences of the word w in the binary expansion of n. Let {s(n)}_n?0 denote the Stern sequence, defined by s(0)=0, s(1)=1, and for n?1, In this note, we show that where denotes the complement of w (obtained by sending 0?1 and 1?0) and [w]₂ denotes the integer specified by the word w∈{0,1}^∗ interpreted in base 2.     

Distinct length modular zero-sum subsequences: A proof of Graham's conjecture

Text

Let S be a sequence of n nonnegative integers not exceeding n−1 such that S takes at least three distinct values. We show that S has two nonempty zero-sum subsequences with distinct lengths. This proves a conjecture of R.L. Graham. The validity of this conjecture was verified by Erd?s and Szemerédi for all sufficiently large prime n.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=LftJj-E6aQA.     

Wythoff''s sequence and -Heap Wythoff''s conjectures

Define a Wythoff's sequence as a sequence of pairs of integers (A_n,B_n) _n>n0 such that there exists a finite set of integers T, A_n=mex( A_i,B_i:i<n T), B_n-A_n=n, and B_n ∩T=. Structural properties and behaviors of Wythoff's sequence are investigated. The main result is that for such a sequence, there always exists an integer α such that when n is large enough, |A_n-nφ-α|1, where , the golden section. The value of α can also be easily determined by a relatively small number of pairs in the sequence. As a corollary, the two conjectures on the N-heap Wythoff's game by Fraenkel [Complexity, appeal and challenges of combinatorial Games, Theoret. Comput. Sci. 313 (2004) 393–415] on the N-heaped Wythoff's game are proved to be equivalent.