The following pages link to Principles of combinatorics (Q2549322):
Displaying 50 items.
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs (Q265074) (← links)
- Initial-boundary value problems for multi-term time-fractional diffusion equations with positive constant coefficients (Q299965) (← links)
- Partitioning, duality, and linkage disequilibria in the Moran model with recombination (Q304213) (← links)
- Total graph interpretation of the numbers of the Fibonacci type (Q327721) (← links)
- On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs (Q423977) (← links)
- Partition of symmetric powers of \(G\)-sets into orbits: application to the enumeration of force constants (Q445434) (← links)
- On the largest size of \((t, t + 1, \ldots, t + p)\)-core partitions (Q501068) (← links)
- Axiomatic structure of \(k\)-additive capacities (Q557954) (← links)
- Lower bounds over codes correcting bursts with a given Lee weight or intensity (Q581362) (← links)
- Hook and shifted hook numbers (Q583211) (← links)
- Constant rate distributions on partially ordered sets (Q609710) (← links)
- Triangular expansions (Q619056) (← links)
- Enumeration of \((0,1)\)-matrices with constant row and column sums (Q621885) (← links)
- Enumeration of higher-dimensional paths under restrictions (Q754891) (← links)
- Regular and semi-regular polytopes. II (Q798960) (← links)
- On the polynomiality and asymptotics of moments of sizes for random \((n,dn\pm 1)\)-core partitions with distinct parts (Q829394) (← links)
- Conditional independence among max-stable laws (Q893441) (← links)
- On the \(p\)-blocks of symmetric and alternating groups and their covering groups (Q909788) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs (Q942091) (← links)
- An improved collapsed Gibbs sampler for Dirichlet process mixing models (Q959192) (← links)
- Discrete piecewise linear functions (Q976149) (← links)
- Poisson randomization in occupancy problems (Q1051976) (← links)
- On permutations of wires and states (Q1064313) (← links)
- On the number of reduced decompositions of elements of Coxeter groups (Q1072636) (← links)
- On inversions and cycles in permutations (Q1097883) (← links)
- On a determinant sequence in the lattice path counting (Q1104663) (← links)
- On the distribution of the number of optimal elements for various generalized weak orders (Q1105625) (← links)
- Generating a random cyclic permutation (Q1110343) (← links)
- A new method for the detection of protection faults in capability-based protection systems (Q1136495) (← links)
- Blockwise Lee error-correcting codes (Q1141119) (← links)
- The linear index of a group representation (Q1146251) (← links)
- An algorithm for generating all maximal independent subsets of posets (Q1147517) (← links)
- The direct power of a 1-graph (Q1156141) (← links)
- An expression for the number of equivalence classes of Latin squares under row and column permutations (Q1156805) (← links)
- The number of increasing subsequences of the random permutation (Q1157632) (← links)
- Principle of inclusion-exclusion on partially ordered sets (Q1170210) (← links)
- Enumerations of rooted trees with an application to group presentations (Q1170253) (← links)
- Permutation statistics and linear extensions of posets (Q1177948) (← links)
- Interpreting consensus sequences based on plurality rule (Q1205295) (← links)
- A brief review of the role of lattices in rank order statistics (Q1209645) (← links)
- Generating the alternating group by cyclic triples (Q1214931) (← links)
- An extension of Schensted's theorem (Q1216397) (← links)
- Characters of wreath products and some applications to representation theory and combinatorics (Q1218509) (← links)
- On enumerating paths of K arcs in unoriented complete graphs (Q1219305) (← links)
- Efficient algorithms for doubly and multiply restricted partitions (Q1222020) (← links)
- Some partitions associated with a partially ordered set (Q1224110) (← links)
- Lower bounds for the size of expressions for certain functions in d-ary logic (Q1230507) (← links)
- Operations on permutations and representation in graph form (Q1233876) (← links)
- A variant of inclusion-exclusion on semilattices (Q1243283) (← links)
