Ranking and unranking of a generalized Dyck language and the application to the generation of random trees.
Ranks of Incidence Matrices of Steiner Triple Systems.
Ranks of permutative matrices
A new type of matrix, termed permutative, is defined and motivated herein. The focus is upon identifying circumstances under which square permutative matrices are rank deficient. Two distinct ways, along with variants upon them are given. These are a special kind of grouping of rows and a type of partition in which the blocks are again permutative. Other, results are given, along with some questions and conjectures.
Rank-three matroids are Rayleigh.
Rare events and conditional events on random strings.
Rate of convergence of the short cycle distribution in random regular graphs generated by pegging.
Ratio monotonicity of polynomials derived from nondecreasing sequences.
Rational congruence for uniform multiplicative designs.
Rational identities and inequalities.
Rational model of the subspace complement on atomic complexes.
Rationality, irrationality, and Wilf equivalence in generalized factor order.
rc-graphs and Schubert polynomials.
Reachability relations and the structure of transitive digraphs.
Real algebraic curves and real algebraic functions.
Real time asymptotic packing.
Realizable triples for stratified domination in graphs
A graph is -stratified if its vertex set is partitioned into two classes, where the vertices in one class are colored red and those in the other class are colored blue. Let be a -stratified graph rooted at some blue vertex . An -coloring of a graph is a red-blue coloring of the vertices of in which every blue vertex belongs to a copy of rooted at . The -domination number is the minimum number of red vertices in an -coloring of . In this paper, we study -domination where is...
Realization of Hölder complexes
Realization of posets.
Rearrangements of the Symmetric Group and Enumerative Properties of the Tangent and Secant Numbers.
Recent developments in the theory of partitions.