Results 71 to 80 of about 167 (109)
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
SIAM J Discret Math, 2020 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Piecewise-linear promotion and RSK in rectangles and moon polyominoes [PDF]
We study piecewise-linear and birational lifts of Schützenberger promotion, evacuation, and the RSK correspondence defined in terms of toggles. Using this perspective, we prove that certain chain statistics in rectangles shift predictably under the ...
Liu, Ricky Ini +3 more
core +1 more source
The Number of Homomorphisms from a Finite Abelian Group to a Symmetric Group (II) [PDF]
application/pdfFor any finite abelian group A, we give the lower bound of ordp(|Hom(A, Sn)|), and determine the region of convergence of the p-adic power series 1 + Sigma(infinity)(n=1) vertical bar Hom(A, S-n)vertical bar X-n/ n!.2000 Mathematics ...
竹ケ原, 裕元 +2 more
core
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
Permutation q-enumeration with the Schur row adder
, 2010 . We q-enumerate here, by the i-major index, the class of permutations of Sn with largest increasing subsequence of size n − k and increasing rst n − k entries. The result is obtained by a surprisingly straightforward use of the Schur row adder.
Adriano M. Garsia
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
Blocks in cycles and k-commuting permutations. [PDF]
Springerplus, 2016 Moreno R, Rivera LM.
europepmc +1 more source
Generalized Stirling permutations and forests: Higher-order Eulerian and Ward numbers [PDF]
, 2014 20 pags.; 4 figs.; Mathematics Subject Classifications: 05A05, 05A15, 05C30We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests.
Sánchez Villaseñor, Eduardo Jesús +5 more
core
Computational validations of the asymptotic matching conjectures
, 2005 We describe several computational validations of the asymptotic matching conjectures for r-regular bipartite graphs. These validations are based on algorithms for computation of d-dimensional monomerdimer entropies in statistical mechanics and asymptotic
S Friedland +3 more
core
On the sum relation of multiple Hurwitz zeta functions
, 2019 In this paper we shall define the special-valued multiple Hurwitz zeta functions, namely the multiple t-values t(α) and define similarly the multiple star t-values as t⋆(α). Then we consider the sum of all such multiple (star) t-values of fixed depth and
Chung, Chan-Liang
core