default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 171
Volume 171, April 2020
- Chao Liu
:
On the lower bounds of Davenport constant. - Ka Hin Leung, Koji Momihara:
New constructions of Hadamard matrices. - Hao Huang, Oleksiy Klurman, Cosmin Pohoata:
On subsets of the hypercube with prescribed Hamming distances. - Pentti Haukkanen, Mika Mattila, Jori Mäntysalo:
Studying the inertias of LCM matrices and revisiting the Bourque-Ligh conjecture. - Michael H. Albert, Mathilde Bouvel, Valentin Féray:
Two first-order logics of permutations. - Ka Hin Leung, Yue Zhou:
No lattice tiling of Zn by Lee sphere of radius 2. - Giovanni Paolini:
Shellability of generalized Dowling posets. - Zai Ping Lu:
On edge-primitive 2-arc-transitive graphs. - Ilke Çanakçi, Philipp Lampe:
An expansion formula for type A and Kronecker quantum cluster algebras. - Daniel R. Hawtin, Cheryl E. Praeger:
Minimal binary 2-neighbour-transitive codes. - Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel:
Embedding graphs in Euclidean space. - Timothy C. Burness, Martino Garonzi, Andrea Lucchini:
On the minimal dimension of a finite simple group. - Jia-Li Du, Yan-Quan Feng, Pablo Spiga:
A classification of the graphical m-semiregular representation of finite groups. - Eimear Byrne, Alberto Ravagnani:
Partition-balanced families of codes and asymptotic enumeration in coding theory. - Yong-Gao Chen, Jin-Hui Fang:
On additive complements. IV. - Christian Gaetz, Yibo Gao:
A combinatorial duality between the weak and strong Bruhat orders.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-03 00:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
