BIJECTIONS

作品数：8被引量：3H指数：1
导出分析报告
相关领域：理学更多>>
相关期刊：《Cybersecurity》《Frontiers of Mathematics in China》《Open Journal of Discrete Mathematics》《Journal of Systems Science & Complexity》更多>>
相关基金：国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Indexing structures for the PLS blockchain
《Cybersecurity》2022年第1期28-46,共19页Alex Shafarenko 
supported in part by IMC corporation,Slovakia,under EU Project BRAINE(Grant 876967).
This paper studies known indexing structures from a new point of view:minimisation of data exchange between an IoT device acting as a blockchain client and the blockchain server running a protocol suite that includes ...
关键词：PLS blockchain Guy Fawkes protocol Content-addressable storage Data-structure statistics Tunstall coding Pseudorandom bijections 
Indexing structures for the PLS blockchain
《Cybersecurity》2021年第1期561-579,共19页Alex Shafarenko 
IMC corporation, Slovakia, under EUProject BRAINE (Grant 876967).
This paper studies known indexing structures from a new point of view:minimisation of data exchange between an IoT device acting as a blockchain client and the blockchain server running a protocol suite that includes ...
关键词：PLS blockchain Guy Fawkes protocol Content-addressable storage Data-structure statistics Tunstall coding Pseudorandom bijections 
Auslander’s defect formula and a commutative triangle in an exact category
《Frontiers of Mathematics in China》2020年第1期115-125,共11页Pengjie JIAO 
the National Natural Science Foundation of China(Grant No.11901545).
We prove Auslander’s defect formula in an exact category,and obtain a commutative triangle involving the Auslander bijections and the generalized Auslander Reiten duality.
关键词：Auslander’s DEFECT FORMULA Auslander BIJECTIONS MORPHISMS determined by objects 
Two Bijections on Weighted Motzkin Paths被引量：1
《Communications in Mathematical Research》2017年第2期149-159,共11页Chen Zhong-jin Zhao Shuo 
The NSF(11601020,11501014)of China;Organization Department of Beijing Municipal Committee(2013D005003000012);Science and Technology Innovation Platform-Business Project 2017(PXM2017_014213_000022)
In this paper, we provide a bijection between the set of underdiagonal lattice paths of length n and the set of(2, 2)-Motzkin paths of length n. Besides, we generalize the bijection of Shapiro and Wang(Shapiro L W, Wa...
关键词：underdiagonal lattice path (2 2)-Motzkin path k-Motzkin path (k-2)-Schrder path 
Bijections between Lattice Paths and Plane Partitions
《Open Journal of Discrete Mathematics》2011年第3期108-115,共8页Mateus Alegri Eduardo Henrique de Mattos Brietzke José Plínio de Oliveira Santos Robson da Silva 
By using lattice paths in the three-dimensional space we obtain bijectively an interpretation for the overpartitions of a positive integer n in terms of a set of plane partitions of n . We also exhibit two bijections ...
关键词：LATTICE PATHS PLANE PARTITIONS PARTITIONS q-Analog. 
Bijections Preserving Invertibility of Differences of Matrices on H_n被引量：1
《Acta Mathematica Sinica,English Series》2008年第10期1651-1654,共4页Damjan KOBAL 
the Ministry of Science of Slovenia
We characterise bijections on the space of hermitian matrices preserving the invertibility of differences of matrix pairs in both directions.
关键词：HERMITIAN INVERTIBILITY PRESERVER ADJACENCY full rank 
A GNERAL BIJECTIVE ALGORITHM FOR INCREASING TREES被引量：1
《Systems Science and Mathematical Sciences》1999年第3期193-203,共11页(Dedicated to Professor Wu Wentsun on the occasion of his 80-th birthday)William Y. C. CHEN(Center for Combinatorics, Nankai University, Tianjin 300071, Chinaand T-7, Mail Stop B 284, Los Alamos National Laboratory,Los Alamos, New Mexico 87545, USA) 
The main concern of this paper is with a bijective approach to various classes ofincreasing trees. We discover an increasing tree counterpart of the decomposition algorithmfor Schroder trees. This bijection has probab...
关键词：INCREASING trees Schroder trees BIJECTIONS 
Efficient Realization of Frequently Used Bijections on Cube-Connected Cycles
《Journal of Computer Science & Technology》1995年第4期298-309,共12页刘群 刘志勇 张祥 
CCC has lower hardware complexity than hypercube and is suited for current VLSI technology LC-permutations are a large set of important permutations frequently used in various parallel computations. Existing routing a...
关键词：HYPERCUBE cube-connected cycles linear complement permutation routing algorithm conflict complexity 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部