scientific article; zbMATH DE number 3360173
From MaRDI portal
Publication:5633999
zbMath0227.05001MaRDI QIDQ5633999
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item, On rankings generated by pairwise linear discriminant analysis of \(m\) populations, A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations, A threshold property for intersections in a finite set, Sorting using networks of deques, The concept of modeling packing and covering problems using modern computational geometry software, The cycle structure of a linear transformation over a finite field, Configuration space of geometric objects, Theory and methods of Euclidian combinatorial optimization: current status and prospects, Primitive ideals and orbital integrals in complex classical groups, A new derivation of the counting formula for Young tableaux, On the determination of Green's relations in finite transformation semigroups, Interaction transform of set functions over a finite set, Comparing bacterial genomes from linear orders of patterns, Properties of combinatorial optimization problems over polyhedral-spherical sets, Chords, trees and permutations, Paths in ordered structures of partitions, Complements and transitive closures, Calcul de longueurs de chaînes de réécriture dans le monoïde libre, Highly transitive imprimitivities., Enumeration of permutations with prescribed up-down and inversion sequences, Predecessors in Random Mappings, Le nombre maximal de colorations d'un graphe Hamiltonien, Formalizing spatial configuration optimization problems with the use of a special function class, A generalized \(\tau\)-invariant for the primitive spectrum of a semisimple Lie algebra, Enumeration des tableaux Standards, Combinatorial configurations in the definition of antimagic labelings of graphs, Note on Turán's graph, A stochastic theory for the emergence and the evolution of preference relations, Denombrement des arborescences dont le graphe de comparabilite est hamiltonien, Sorting by means of swappings
