位置：成果数据库 > 期刊 > 期刊详情页
k-色斜Dyck路的计数
  • ISSN号：1000-5641
  • 期刊名称：《华东师范大学学报：自然科学版》
  • 时间：0
  • 分类：O157.1[理学—数学;理学—基础数学]
  • 作者机构：[1]江苏师范大学数学与统计学院,江苏徐州221116
  • 相关基金：国家自然科学基金资助项目（11171288,11171150）;江苏省大学生实践创新训练计划项目（20140320094X）
作者： 卢青林[1]
关键词： LUCAS数, 标准分解式, 素因数, 指数, lucas number, standard factorization, prime factor, index
中文摘要：

纠正了L2x3kxp≡0（mod3k＋1），k∈Z，k≥0，p为任意正整数的错误，然后证明了Lucas数Ln的标准分解式中素因数5指数为0，最后证明了Ln 的标准分解式中素因数7的指数由n的标准分解式中2和7的指数决定。

英文摘要：

In this paper, we first correct a mistake in reference [10];then we prove that the index of 5 in Ln is 0;at last, we prove that index of 7 in Ln can be determined by the indexes of 2 and 7 in the standard fac-torization of n.

同期刊论文项目
类群问题和数论运用
期刊论文 45
图的边染色与几类参数的研究
期刊论文 42
同项目期刊论文
Strong List Edge Coloring of Subcubic Graphs
Plane graphs with maximum degree △ ≥ 8 are entirely (△ + 3)-colorable
Adjacent Vertex Distinguishing edge coloring of 2-degenerate graphs
On the independence number of edge chromatic critical graphs
On strongly Z2s+1-connected graphs
On the size of critical graphs with small maximum degree
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs
The extremal primitive digraph with both Lewin index n？2 and girth 2 or 3
On strong list edge coloring of subcubic graphs
Adjacent vertex distinguishing indices of planar graphs without 3-cycles
Graphic sequences with an A-Connected realization
A note on an extremal problem for group connectivity
A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- An approach to Vizing
An extremal problem on A-connected graphs
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
Lumping algorithms for computing Google's PageRank and its derivative, with attention to unr
On the local base of a primitive and nonpowerful sign pattern
Hamilton Circuits and Essential Girth of Claw Free Graphs
A sufficient condition for a tree to be (Δ+1)-(2,1)-totally labelable,
Neighbor sum distinguishing edge colorings of sparse graphs
Finding Delta for a Surface of Characteristic ？4
VECTOR FLOWS AND INTEGER FLOWS
Unique Fulkerson coloring of Petersen minor-free cubic graphs
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable
Plane graphs with maximum degree △ ≥ 8 are entirely (△ + 3)-colorable
A sufficient condition for edge chromatic critical graphs to be Hamiltonian-- An approach to Vizing&
Circuit extension and circuit double cover of graphs
Nowhere-zero 3-flow of graphs with independence number two
Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ + 1)-colora
Strong Circuit Double Cover of Some Cubic Graphs,
Whiteman’s generalized cyclotomic numbers with respect to t primes
The linear complexity of Whiteman's generalized cyclotomic sequences of period $p^{m+1}q^{n+1}$
The expected value of $k$-error linear complexity of periodic sequences
The linear complexity of -perodic generalized cyclotomic sequence over GF(q)
决定周期为up~n序列的极小多项式的快速算法
A class of cyclic codes from two distinct finite fields
新的差族和几乎差族的构造
决定周期为up~n序列的极小多项式的快速算法(英文)
Unit time-phase signal sets with the explicit maximum cross ambiguity amplitudes
具有两个非零点循环码的权重分布
Weight distributions of cyclic codes of length $l^m$
具有最优自相关值四元序列的构造
Linear complexity of cyclotomic sequences of order six and BCH codes over GF(3)
Weight Distributions of Two Classes of Cyclic Codes With Respect to Two Distinct Order Elements
Weight distributions of cyclic codes with respect to pairwise coprime order elements
The minimum Hamming distances of irreducible cyclic codes
Cyclic Division Algebras with Non-norm Elements
Gauss periods and cyclic codes from cyclotomic sequences of small orders
Two families of nearly optimal codebooks
Two classes of two-weight linear codes
Hamming Weights of the Duals of Cyclic Codes With Two Zeros
The Walsh transform of a class of monomial functions and cyclic codes
Weight distributions of cyclic codes of length $tl^m$
On thecomplete weight enumerators of some reducible cyclic codes
Irreducible cyclic codes of length $4p^n$ and $8p^n$
Generalized Gray map and a class of $p$-ary nonlinear codes
Weight distributions of a class of cyclic codes from $\BbbF_l$-conjugates
A Class of Binary Linear Codes With at Most Three Weights
周期为p~（n＋1）的GF（q）上广义分圆序列的线性复杂度
有限交换环上的多项式置换群
周期序列的k错线性复杂度的期望值
关于非同余数的一些结论
素数p在数域Q（u~（1/2）,v~（1/2））上的素理想分解
GF（3）上一类几乎平衡的6阶分圆序列
Autocorrelation Value of Whiteman Generalized Cyclotomic Sequence
期刊信息
  • 《华东师范大学学报：自然科学版》
  • 中国科技核心期刊
  • 主管单位:中华人民共和国教育部
  • 主办单位:华东师范大学
  • 主编：郑伟安
  • 地址：上海中山北路3663号
  • 邮编：200062
  • 邮箱：xblk@xb.ecnu.edu.cn
  • 电话：021-62233703
  • 国际标准刊号：ISSN：1000-5641
  • 国内统一刊号：ISSN：31-1298/N
  • 邮发代号:4-359
  • 获奖情况:
  • 中国综合性科技类核心期刊
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国化学文摘（网络版）,美国数学评论（网络版）,德国数学文摘,美国剑桥科学文摘,中国中国科技核心期刊,中国北大核心期刊（2004版）,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）,中国北大核心期刊（2000版）
  • 被引量:6600