Results 41 to 50 of about 89 (79)
Mathematics Subject Classification interrater agreement dataset
The Mathematics Subject Classification organizes Publications, Software, and Research Data into a hierarchical classification scheme maintained by MathSciNet (mr) and zbMATH Open (zbmath). According to the classification scheme, both organizations mr and
Olaf Teschke +2 more
core +1 more source
. A centrosymmetric permutation is one which is invariant under the reversecomplement operation, or equivalently one whose associated standard Young tableaux under the Robinson-Schensted algorithm are both invariant under the Schützenberger involution ...
Matteo Silimbani, Mark F. Flanagan
core
Some collapsibility results for n-dimensional contingency tables
Collapsibility, Conditional independence, Contingency table, Log-linear model, Möbius inversion, Simpson’s paradox, Strict collapsibility, Primary 62H17, Secondary 62E99, Secondary 05A05,
P. Vellaisamy, V. Vijay
core +1 more source
Some formulas for the restricted r-Lah numbers [PDF]
The r-Lah numbers, which we denote here by `(r)(n, k), enumerate partitions of an (n+r)-element set into k+r contents-ordered blocks in which the smallest r elements belong to distinct blocks. In this paper, we consider a restricted version `(r) m (n,
Shattuck, Mark
core +1 more source
The graham–knuth–patashnik recurrence: symmetries and continued fractions
72 pags. -- Mathematics Subject Classifications: 05A10 (Primary); 05A15, 05A19, 30B70 (Secondary)We study the triangular array defined by the Graham–Knuth–Patashnik recurrence T (n, k) = (αn + βk + γ) T (n − 1, k) + (αn + βk + γ ) T (n − 1, k − 1) with ...
Sokal, Alan D., Salas, Jesús
core +1 more source
The derivation of cycle index of Sn[3]
WE evaluate the cycle index polynomial of the reduced triple group Sn[3]. We also use similar techniques to derive the cycle index polynomial of the triple group Sn(3) which had earlier been found by Oberschelp (see Palmer [8] who has also given an ...
Kamuti, IN, Obon’go, JO
core
Boolean elements in the Bruhat order [PDF]
We show that a Weyl group element is boolean if and only if it avoids a set of Billey-Postnikov patterns, which we describe explicitly. Our proof is based on analysis of inversion sets, and it is in large part type-uniform.
Gao, Yibo, Hänni, Kaarel
core +1 more source
Repeatable patterns and the maximum multiplicity of a generator in a reduced word [PDF]
We study the maximum multiplicity \(\mathcal{M}(k,n)\) of a simple transposition \(s_k=(k \: k+1)\) in a reduced word for the longest permutation \(w_0=n \: n-1 \: \cdots \: 2 \: 1\), a problem closely related to much previous work on sorting networks ...
Gao, Yibo +4 more
core +1 more source
Slit-slide-sew bijections for oriented planar maps
We construct growth bijections for bipolar oriented planar maps and for Schnyder woods. These give direct combinatorial proofs of several counting identities for these objects. Our method mainly uses two ingredients.
Éric Fusy +2 more
core +1 more source
Melham's conjecture on odd power sums of fibonacci numbers
Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at a certain Fibonacci number of odd order. We prove that this polynomial and its derivative both vanish
Xie, Matthew H.Y. +2 more
core

