Results 81 to 90 of about 26,723 (134)
Combinatorics of the immaculate inverse Kostka matrix
Algebraic Combinatorics, 2022 The classical Kostka matrix counts semistandard tableaux and expands Schur symmetric functions in terms of monomial symmetric functions. The entries in the inverse Kostka matrix can be computed by various algebraic and combinatorial formulas involving ...
N. Loehr, Elizabeth M. Niese
semanticscholar +1 more source
Crossings and nestings in set partitions of classical types [PDF]
, 2009 In this article, we investigate bijections on various classes of set partitions of classical types that preserve openers and closers. On the one hand we present bijections that interchange crossings and nestings.
Rubey, Martin, Stump, Christian
core +5 more sources
Largest reduced neighborhood clique cover number revisited
, 2017 Let $G$ be a graph and $t\ge 0$. The largest reduced neighborhood clique cover number of $G$, denoted by ${\hat\beta}_t(G)$, is the largest, overall $t$-shallow minors $H$ of $G$, of the smallest number of cliques that can cover any closed neighborhood ...
Brown, André EX +11 more
core +3 more sources
Faces of Birkhoff Polytopes [PDF]
, 2013 The Birkhoff polytope B(n) is the convex hull of all (n x n) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places.
Paffenholz, Andreas
core
Coloured permutations containing and avoiding certain patterns
, 2000 Following Mansour, let $S_n^{(r)}$ be the set of all coloured permutations on the symbols $1,2,...,n$ with colours $1,2,...,r$, which is the analogous of the symmetric group when r=1, and the hyperoctahedral group when r=2.
Mansour, T.
core +4 more sources
Enumeration of Matchings: Problems and Progress
, 1999 This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of matchings.
Propp, James
core +5 more sources
Strong Jumps and Lagrangians of Non-Uniform Hypergraphs [PDF]
, 2014 The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems over non ...
Johnston, Travis, Lu, Linyuan
core
Universality of the Distribution Functions of Random Matrix Theory. II
, 1999 This paper is a brief review of recent developments in random matrix theory. Two aspects are emphasized: the underlying role of integrable systems and the occurrence of the distribution functions of random matrix theory in diverse areas of mathematics ...
Tracy, Craig A., Widom, Harold
core +2 more sources
The
Isaac Konan
semanticscholar +1 more source
Equidistribution and Sign-Balance on 321-Avoiding Permutations
, 2004 Let $T_n$ be the set of 321-avoiding permutations of order $n$. Two properties of $T_n$ are proved: (1) The {\em last descent} and {\em last index minus one} statistics are equidistributed over $T_n$, and also over subsets of permutations whose inverse ...
Adin, Ron M., Roichman, Yuval
core +1 more source