Principles of combinatorics

zbMath0227.05002MaRDI QIDQ2549322

No author found.

Publication date: 1971

Published in: Mathematics in Science and Engineering (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics (05-XX)

Related Items (only showing first 100 items - show all)

Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs ⋮ On the polynomiality and asymptotics of moments of sizes for random \((n,dn\pm 1)\)-core partitions with distinct parts ⋮ Locally finiteness and convolution products in groupoids ⋮ Geometric comparison of combinatorial polytopes ⋮ Sandpile models and lattices: a comprehensive survey ⋮ A formula for the sectional geometric genus of quasi-polarized manifolds by using intersection numbers ⋮ The Möbius transform on symmetric ordered structures and its application to capacities on finite sets ⋮ Initial-boundary value problems for multi-term time-fractional diffusion equations with positive constant coefficients ⋮ Partitioning, duality, and linkage disequilibria in the Moran model with recombination ⋮ On the consistency of the plurality rule consensus function for molecular sequences ⋮ The average size of \((\widehat{t}, \widehat{t + 1})\)-core partitions ⋮ On inversions and cycles in permutations ⋮ Posetic cluster expansion for substitution-reaction networks and application to methylated cyclobutanes ⋮ Total graph interpretation of the numbers of the Fibonacci type ⋮ On a determinant sequence in the lattice path counting ⋮ On the distribution of the number of optimal elements for various generalized weak orders ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ Generating a random cyclic permutation ⋮ Metrics on permutations useful for positive dependence ⋮ The asymptotic plurality rule for molecular sequences ⋮ On endomorphism algebras arising from multiparameter Hecke algebras ⋮ Maximizing the number of spanning trees on the (p,p+2) graphs ⋮ Dominance refinements of the Smirnov two-sample test ⋮ Constant rate distributions on partially ordered sets ⋮ Constant term identities and Poincaré polynomials ⋮ T-core shifted Young diagrams ⋮ A new method for the detection of protection faults in capability-based protection systems ⋮ Triangular expansions ⋮ Conditional independence among max-stable laws ⋮ Blockwise Lee error-correcting codes ⋮ Enumeration of \((0,1)\)-matrices with constant row and column sums ⋮ The linear index of a group representation ⋮ An algorithm for generating all maximal independent subsets of posets ⋮ On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs ⋮ The direct power of a 1-graph ⋮ On the \(p\)-blocks of symmetric and alternating groups and their covering groups ⋮ An expression for the number of equivalence classes of Latin squares under row and column permutations ⋮ The number of increasing subsequences of the random permutation ⋮ How often are two permutations comparable? ⋮ The symmetric Sugeno integral. ⋮ Partition of symmetric powers of \(G\)-sets into orbits: application to the enumeration of force constants ⋮ Rigid E-unification: NP-completeness and applications to equational matings ⋮ Principle of inclusion-exclusion on partially ordered sets ⋮ Enumerations of rooted trees with an application to group presentations ⋮ Permutation statistics and linear extensions of posets ⋮ Generalized adjoints and applications to composition operators ⋮ On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs ⋮ On the largest size of \((t, t + 1, \ldots, t + p)\)-core partitions ⋮ The spectrum for commutative complex \(K\)-theory ⋮ On the largest sizes of certain simultaneous core partitions with distinct parts ⋮ Core partitions with distinct parts ⋮ Enhancing set constraint solvers with lexicographic bounds ⋮ An improved collapsed Gibbs sampler for Dirichlet process mixing models ⋮ A special stochastic decision problem ⋮ Interpreting consensus sequences based on plurality rule ⋮ A brief review of the role of lattices in rank order statistics ⋮ Equivalence classes of matchings and lattice-square designs ⋮ Generating the alternating group by cyclic triples ⋮ An extension of Schensted's theorem ⋮ Characters of wreath products and some applications to representation theory and combinatorics ⋮ On enumerating paths of K arcs in unoriented complete graphs ⋮ Discrete piecewise linear functions ⋮ Axiomatic structure of \(k\)-additive capacities ⋮ Efficient algorithms for doubly and multiply restricted partitions ⋮ Remainder term estimate in a combinatorial limit theorem ⋮ Some partitions associated with a partially ordered set ⋮ Lower bounds for the size of expressions for certain functions in d-ary logic ⋮ Operations on permutations and representation in graph form ⋮ Lower bounds over codes correcting bursts with a given Lee weight or intensity ⋮ Extreme points of some families of non-additive measures ⋮ Hook and shifted hook numbers ⋮ A variant of inclusion-exclusion on semilattices ⋮ Differential operators and the theory of binomial enumeration ⋮ Representations of the hyperoctahedral groups ⋮ Some results on hook lengths ⋮ Topological solution of ordinary and partial finite difference equations ⋮ The roots of combinatorics ⋮ Enumeration of higher-dimensional paths under restrictions ⋮ A transformed \(L 1\) method for solving the multi-term time-fractional diffusion problem ⋮ A partial order for the set of meanders ⋮ A five-element transformation monoid on labelled trees ⋮ On the time moments of discrete systems ⋮ A Random Graph With a Subcritical Number of Edges ⋮ Coxeter matroid polytopes ⋮ Strengthenings of Young-type inequalities and the arithmetic geometric mean inequality ⋮ BLOBS AND FLIPS ON GEMS ⋮ Stirling numbers revisited ⋮ Umbral Calculus, Binomial Enumeration and Chromatic Polynomials ⋮ On a unimodal sequence of binomial coefficients ⋮ Poisson randomization in occupancy problems ⋮ Principle of inclusion-exclusion on semilattices ⋮ Normality of semigroups with some links to graph theory. ⋮ Regular and semi-regular polytopes. II ⋮ Distributional properties of jaccard’s index of similarity ⋮ On the arrangement graph. ⋮ The decay of linkage disequilibrium under random union of gametes: How to calculate Bennett's principal components ⋮ On permutations of wires and states ⋮ Tree-like properties of cycle factorizations ⋮ The evolution of a population under recombination: how to linearise the dynamics ⋮ On the number of reduced decompositions of elements of Coxeter groups

This page was built for publication: Principles of combinatorics