Results 51 to 60 of about 3,173 (190)
Combinatorics of diagrams of permutations [PDF]
There are numerous combinatorial objects associated to a Grassmannian permutation $w_λ$ that index cells of the totally nonnegative Grassmannian. We study some of these objects (rook placements, acyclic orientations, various restricted fillings) and ...
Joel Brewster Lewis, Alejandro Morales
doaj +1 more source
Combinatorics of Positroids [PDF]
Recently Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroids.
Suho Oh
doaj +1 more source
Combinatorial descriptions of the crystal structure on certain PBW bases [PDF]
Lusztig's theory of PBW bases gives a way to realize the crystal B(∞) for any simple complex Lie algebra where the underlying set consists of Kostant partitions. In fact, there are many different such realizations, one for each reduced expression for the
Ben Salisbury +2 more
doaj +1 more source
A Divided Difference Operator [PDF]
We construct a divided difference operator using GKM theory. This generalizes the classical divided difference operator for the cohomology of the complete flag variety.
Nicholas Teff
doaj +1 more source
Partial Steiner Triple Systems With an Almost Parallel Class Missing Any Given Point
ABSTRACT We say that a hypergraph is factor critical if it has no 1‐factor but deletion of any vertex results in a hypergraph that has a 1‐factor. We show that any factor‐critical hypergraph of order n $n$ has at least n $n$ edges, and that for all integers k > 1 $k\gt 1$ and n > 1 $n\gt 1$ with n ≡ 1 ( mod k ) $n\equiv 1({\rm{mod}}\,k)$ there exists a
Darryn Bryant +2 more
wiley +1 more source
Quasisymmetric (k,l)-hook Schur functions [PDF]
We introduce a quasisymmetric generalization of Berele and Regev's hook Schur functions and prove that these new quasisymmetric hook Schur functions decompose the hook Schur functions in a natural way.
Sarah Mason, Elizabeth Niese
doaj +1 more source
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
Triangulations of cyclic polytopes [PDF]
We give a new description of the combinatorics of triangulations of even-dimensional cyclic polytopes, and of their bistellar flips. We show that the tropical exchange relation governing the number of intersections between diagonals of a polygon and a ...
Steffen Oppermann, Hugh Thomas
doaj +1 more source
Classifying Equidistant Permutation Codes
ABSTRACT A permutation code of length n $n$ is a set of codewords, each of which contains every symbol of a set of size n $n$ exactly once. A permutation code in which any two distinct codewords differ in the same number of coordinates is called equidistant and that number is called the distance.
Patric R. J. Östergård +1 more
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.3A [PDF]
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source

