On a generalization of Kelly's combinatorial lemma

被引:3
|
作者
Ben Amira, Aymen [1 ]
Dammak, Jamel [1 ]
Si Kaddour, Hamza [2 ]
机构
[1] Fac Sci Sfax, Dept Math, Sfax, Tunisia
[2] Univ Lyon 1, Dept Math, ICJ, F-69622 Villeurbanne, France
关键词
Set; matrix; graph; tournament; isomorphism; INCIDENCE MATRICES; BINARY RELATIONS; ISOMORPHIC TYPES; RESTRICTIONS; TOURNAMENTS; GRAPHS; HEREDITARY; RECONSTRUCTION; HYPOMORPHY; N-1;
D O I
10.3906/mat-1302-13
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t-elements subsets of a v-element set was given by Pouzet. We consider a version of this generalization modulo a prime p. We give illustrations to graphs and tournaments.
引用
收藏
页码:949 / 964
页数:16
相关论文
共 38 条
  • [21] Decomposable clutters and a generalization of Simon's conjecture
    Bigdeli, Mina
    Pour, Ali Akbar Yazdan
    Zaare-Nahandi, Rashid
    JOURNAL OF ALGEBRA, 2019, 531 : 102 - 124
  • [22] A Learning-Based Assembly Sequence Planning Method Using Neural Combinatorial Optimization With Satisfactory Generalization Ability
    Hou, Ruiming
    Xu, Sheng
    Yang, Chenguang
    Duan, Jianghua
    Wu, Xinyu
    Xu, Tiantian
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2024,
  • [23] Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters
    Fageot, Julien
    Unser, Michael
    Ward, John Paul
    JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2019, 25 (04) : 2037 - 2063
  • [24] Parametrization of extremals for some generalization of Chebotarev's problem
    Tamrazov, Promarz
    GEORGIAN MATHEMATICAL JOURNAL, 2010, 17 (03) : 597 - 619
  • [25] Vulnerability of scheduled networks and a generalization of Menger's theorem
    Berman, KA
    NETWORKS, 1996, 28 (03) : 125 - 134
  • [26] On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game
    Alon, Noga
    Mehrabian, Abbas
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [27] A combinatorial characterization of S2 binomial edge ideals
    Bolognini, Davide
    Macchia, Antonio
    Rinaldo, Giancarlo
    Strazzanti, Francesco
    EUROPEAN JOURNAL OF COMBINATORICS, 2025, 126
  • [28] Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
    De Loera, Jesus A.
    Lee, Jon
    Malkin, Peter N.
    Margulies, Susan
    JOURNAL OF SYMBOLIC COMPUTATION, 2011, 46 (11) : 1260 - 1283
  • [29] A generalization of Witsenhausen's zero-error rate for directed graphs
    Simonyi, Gabor
    Toth, Agnes
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2864 - 2868
  • [30] A Generalization of Yamamoto's Theorem Relating Eigenvalue Moduli and Singular Values of a Matrix
    Babiarz, Artur
    Czornik, Adam
    Klamka, Jerzy
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2015 (ICNAAM-2015), 2016, 1738