다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Discrete mathematics, v.313 no.3, 2013년, pp.258 - 268
Birdsong, S. , Hetyei, G.
AI-Helper
We consider two shellings of the boundary of the hypercube equivalent if one can be transformed into the other by an isometry of the cube. We observe that a class of indecomposable permutations, bijectively equivalent to standard double occurrence words, may be used to encode one representative from...
The On-Line Encyclopedia of Integer Sequences, 2010. Published electronically at http://oeis.org.
Math. Scand. Bruggeser 29 197 1971 10.7146/math.scand.a-11045 Shellable decompositions of cells and spheres
SIAM J. Discrete Math. Chan 4 568 1991 10.1137/0404049 Plane trees and H-vectors of shellable cubical complexes
Comtet 1974 Advanced Combinatorics
European J. Combin. Cori 30 540 2009 10.1016/j.ejc.2008.04.002 Hypermaps and indecomposable permutations
J. Combin. Theory Ser. A Cori 116 1326 2009 10.1016/j.jcta.2009.02.008 Indecomposable permutations, hypermaps and labeled Dyck paths
Math. Z. Dixon 110 199 1969 10.1007/BF01110210 The probability of generating the symmetric group
European J. Combin. Drake 30 1005 2009 10.1016/j.ejc.2008.05.009 The combinatorics of associated Hermite polynomials
Ann. Comb. Ehrenborg 4 199 2000 10.1007/s000260050007 Flags and shellings of Eulerian cubical posets
Adv. in Appl. Math. Hetyei 42 445 2009 10.1016/j.aam.2008.11.001 Enumeration by kernel positions
Humphreys vol. 29 1990 Reflection Groups & Coxeter Groups
Math. Comp. Johnson 17 282 1963 10.1090/S0025-5718-1963-0159764-2 Generation of permutations by adjacent transposition
Discrete Math. King 306 508 2006 10.1016/j.disc.2006.01.005 Generating indecomposable permutations
Knuth vol. 4 2005 The Art of Computer Programming
SIAM J. Appl. Math. Metropolis 35 689 1978 10.1137/0135057 Combinatorial structure of the faces of the n-cube
Combinatorica Ossona De Mendez 24 487 2004 10.1007/s00493-004-0029-4 Transitivity and connectivity of permutations
Ossona de Mendez Ser. 752 487 2005 Encoding pointed maps by double occurrence words
SIAM Rev. Savage 39 605 1997 10.1137/S0036144595295272 A survey of combinatorial Gray codes
Stanley 1997 Enumerative Combinatorics, Vol. I
Comm. ACM Trotter 5 434 1962 10.1145/368637.368660 Algorithm 115: perm
Ziegler vol. 152 1995 Lectures on Polytopes
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.