云南高校图书馆联盟文献共享服务平台- CONJECTURE

CONJECTURE: 作品数：486被引量：295H指数：8; 导出分析报告; 相关领域：理学更多>>; 相关作者：韩国平刘建熙邱青刘瑞元李逸更多>>; 相关机构：华南师范大学大连理工大学浙江大学山东大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划北京市自然科学基金国家教育部博士点基金更多>>

A Grobner Basis Algorithm for Ideals over Zero-Dimensional Valuation Rings: 《Journal of Systems Science & Complexity》2021年第6期2470-2483,共14页LI Dongmei LIU Jinwang; supported by the National Natural Science Foundation of China under Grant Nos.11871207and 11971161。; Zero-dimensional valuation rings are one kind of non-Noetherian rings.This paper investigates properties of zero-dimensional valuation rings and prove that a finitely generated ideal over such a ring has a Grobner bas...; 关键词：Non-Noetherian ring Grobner basis Gr?bner ring conjecture valuation ring

Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields被引量：1: 《Journal of Systems Science & Complexity》2019年第1期356-374,共19页LIU Zhuojun WU Baofeng; supported by the National Key Research and Development Program of China under Grant No.2016YFB0800401; Boolean functions with optimal algebraic immunity(OAI functions) are important cryptographic primitives in the design of stream ciphers. During the past decade, a lot of work has been done on constructing such functio...; 关键词：Additive DECOMPOSITION algebraic immunity BOOLEAN function MULTIPLICATIVE DECOMPOSITION Tu-Deng CONJECTURE

A Note on the Tu-Deng Conjecture: 《Journal of Systems Science & Complexity》2015年第3期702-724,共23页CHENG Kaimin HONG Shaofang ZHONG Yuanming; supported partially by the National Science Foundation of China under Grant No.11371260;the Youth Foundation of Sichuan University Jinjiang College under Grant No.QJ141308; Let k be a positive integer. For any positive integer x =∑i=0^∞xi2^i, where xi = 0, 1,we define the weight w（x） of x by w（x）：= ∑i=0^∞xi. For any integer t with 0 〈 t 〈 2^k- 1, let St ：= {（a,b）∈ Z^2｜...; 关键词：2-adic valuation Tu-Deng conjecture weight.

ON THE NONEXISTENCE OF NONTRIVIAL SMALL CYCLES OF THE μ FUNCTION IN 3x+ 1 CONJECTURE被引量：1: 《Journal of Systems Science & Complexity》2012年第6期1215-1222,共8页Dengguo FENG Xiubin FAN Liping DING Zhangyi WANG; supported by Natural Science Foundation of China under Grant Nos.60833008 and 60902024; This paper studies the property of the recursive sequences in the 3x ＋ 1 conjecture. The authors introduce the concept of μ function, with which the 3x ＋ 1 conjecture can be transformed into two other conjectures：...; 关键词：Diophantine equation eventual period periodic point 3x ＋ 1 conjecture.

ON A PROBLEM RELATED TO GOLOMB'S CONJECTURES被引量：3: 《Journal of Systems Science & Complexity》2003年第1期13-18,共6页ZHANG Wenpeng(Research Center for Basic Science, Xi’an Jiaotong University, Xi’an 710049, China); This research is supported by the National Natural Science Foundation and P.N.S.F.of China.; The main purpose of this paper is to study a problem related to Golomb's conjectures,and give an interesting asymptotic formula.; 关键词：Primitive roots golomb's conjecture asymptotic formula.

ON A PROBLEM RELATED TO GOLOMB'S CONJECTURES被引量：2: 《Journal of Systems Science & Complexity》2003年第1期13-18,共页; This research is supported by the National Natural Science Foundation and P.N.S.F.of China.; The main purpose of this paper is to study a problem related to Golomb’s conjectures, and give an interesting asymptotic formula.; 关键词：PRIMITIVE ROOTS golomb’s CONJECTURE ASYMPTOTIC formula.

HAJOS' CONJECTURE AND CONNECTIVITY OF EULERIAN GRAPHS被引量：1: 《Journal of Systems Science & Complexity》2002年第3期295-298,共4页XU Baogang (School of Mathematics and Computer Science, Nanjing Normal University, Nanjing 210097, China); This research is partially supported by the National Postdoctoral Fund of China and Natural Science Foundation of China(No. 10001035); This work was finished while the author was working for Academy of Mathematics and Systems Science, Chinese of Academy; Hajos' conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most n-1/2 circuits. In this paper, we propose a new conjecture which is equivalent to Hajos' conjecture, and show that to...; 关键词：Circuit decomposition CONNECTIVITY eulerian graph.

THE ASCENDING SUBGRAPH DECOMPOSITION OF K_n-H_(2n-1): 《Systems Science and Mathematical Sciences》1997年第4期356-360,共5页MA Kejie(Institute of Operations Research in Qufu Normal University, Qufu 273165, China)ZHANG Yuzhong(Institute of Applied Mathematics, Academia Sinica, Beijing 100080, China); A conjecture concerning a new kind of subgraph decomposition, the ascendingsubgraph decomposition, was proposed by Alavi Y. et al., as follows: Every graph ofpositive size has an ascending subgraph decomposition. In t...; 关键词：CONJECTURE ascending SUBGRAPH decomposition.

HECKE OPERATOR AND PELLIAN EQUATION CONJECTURE Ⅲ: 《Systems Science and Mathematical Sciences》1991年第2期97-103,共7页陆洪文; The project was supported by NNSF of China and SF of Minisitry of Education of China; In this note,we give a relationship between the Mordell conjecture on the Pellianequation and the action of the Hecke operator on the Hirzebruch sum.; 关键词：HECKE OPERATOR Pellian EQUATION continued FRACTIONS ZETA function

CORRECTED PROOF OF A THEOREM CONCERNING A CONJECTURE OF SINGH: 《Systems Science and Mathematical Sciences》1990年第4期337-340,共4页陈希孺陶波; A theorem concerning a conjecture of Singh is formulated in[2].But the argumentin [2] contains a serious gap which is in fact the essential point of the proof.A correct proofis presented here.; 关键词：Empirical BAYES estimation EXPONENTIAL families squared error loss convergence RETE CONJECTURE of Singh

CONJECTURE