Enumerations and counting of orthomorphic permutations

被引：3
|
作者：
Ren, Jinping [1 ]
Lu, Shuwang [1 ]
机构：
[1] State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China
来源：
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2006年 / 43卷 / 06期
关键词：
Cryptography;
D O I：
10.1360/crad20060616
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：1071 / 1075
相关论文
共 50 条
  • [31] Finding and Counting Permutations via CSPs
    Berendsohn, Benjamin Aram
    Kozma, Laszlo
    Marx, Daniel
    ALGORITHMICA, 2021, 83 (08) : 2552 - 2577
  • [32] Counting and Generating Permutations in Regular Classes
    Basset, Nicolas
    ALGORITHMICA, 2016, 76 (04) : 989 - 1034
  • [33] A counting formula for the number of permutations with constraints
    Li, L
    Tomoda, T
    Midorikawa, S
    Horibata, T
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1996, 76 : 495 - 496
  • [34] Counting formula for the number of permutations with constraints
    Z Angew Math Mech ZAMM, Suppl 3 (495):
  • [35] Counting permutations by cyclic peaks and valleys
    Chow, Chak-On
    Ma, Shi-Mei
    Mansour, Toufik
    Shattuck, Mark
    ANNALES MATHEMATICAE ET INFORMATICAE, 2014, 43 : 43 - 54
  • [36] COUNTING PAIRS OF PERMUTATIONS BY BINOMIAL COEFFICIENTS
    HOLZSAGER, R
    AMERICAN MATHEMATICAL MONTHLY, 1995, 102 (03): : 274 - 275
  • [37] Counting and signed counting permutations by descent-based statistics
    Dong, Yao
    Lin, Zhicong
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2024, 60 (01) : 145 - 189
  • [38] Finding and Counting Permutations via CSPs
    Benjamin Aram Berendsohn
    László Kozma
    Dániel Marx
    Algorithmica, 2021, 83 : 2552 - 2577
  • [39] Bijective Counting of Involutive Baxter Permutations
    Fusy, Eric
    FUNDAMENTA INFORMATICAE, 2012, 117 (1-4) : 179 - 188
  • [40] Counting Permutations With Two Displacement Values
    Steelman, John Henry
    AMERICAN MATHEMATICAL MONTHLY, 2009, 116 (05): : 465 - 465
12345