Composition sum identities related to the distribution of coordinate values in a discrete simplex.
Compositional inversion of triangular sets of series.
Compositional models, Bayesian models and recursive factorization models
Compositional models are used to construct probability distributions from lower-order probability distributions. On the other hand, Bayesian models are used to represent probability distributions that factorize according to acyclic digraphs. We introduce a class of models, called recursive factorization models, to represent probability distributions that recursively factorize according to sequences of sets of variables, and prove that they have the same representation power as both compositional...
Compositions of graphs revisited.
Compositions of maps and hypermaps. (Compositions des cartes et hypercartes.)
Compositions of n as alternating sequences of weakly increasing and strictly decreasing partitions
Compositions and partitions of positive integers are often studied in separate frameworks where partitions are given by q-series generating functions and compositions exhibiting specific patterns are designated by generating functions for these patterns. Here, we view compositions as alternating sequences of weakly increasing and strictly decreasing partitions (i.e. alternating blocks). We obtain generating functions for the number of such partitions in terms of the size of the composition, the...
Compositions of random functions on a finite set.
Compositions with distinct parts.
Compression theorems for periodic tilings and consequences.
Computation of -partial fractions.
Computation of rigidity of order for one simple matrix
We shall compute the exact value of rigidity of the triangular matrix with entries 0 and 1.
Computation of the vertex Folkman numbers and .
Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
Computational proofs of congruences for 2-colored Frobenius partitions.
Computing and drawing isomorphic subgraphs.
Computing and proving with pivots
A simple idea used in many combinatorial algorithms is the idea of pivoting. Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset σ to a new one σ′ by deleting an element inside σ and adding an element outside σ: σ′ = σv} ∪ {u},...
Computing Kazhdan-Lusztig polynomials for arbitrary Coxeter groups.
Computing powers of two generalizations of the logarithm.
Computing Simple Circuits from a Set of Line Segments.
Computing the domination number of grid graphs.