Results 11 to 20 of about 401,547 (240)
An effective data placement strategy for XML documents [PDF]
As XML is increasingly being used in Web applications, new technologies need to be investigated for processing XML documents with high performance. Parallelism is a promising solution for structured document processing and data placement is a major ...
Lü, K, Zhu, Y
core +7 more sources
Placement Podcasts - the Employer's Perspectives [PDF]
Placement Podcasts – Project Update Including the Employer’s Perspective The University of Huddersfield is one of the UK’s top providers of sandwich education.
Gaffikin, Jane A., Ward, Lisa J.
core +3 more sources
Gradedness of the set of rook placements in $A_{n-1}$ [PDF]
summary:A rook placement is a subset of a root system consisting of positive roots with pairwise non-positive inner products. To each rook placement in a root system one can assign the coadjoint orbit of the Borel subgroup of a reductive algebraic group ...
Ignatev, Mikhail V.
core +1 more source
A random walk on the rook placements on a Ferrer's board [PDF]
Let $B$ be a Ferrers board, i.e., the board obtained by removing the Ferrers diagram of a partition from the top right corner of an $n\times n$ chessboard. We consider a Markov chain on the set $R$ of rook placements on $B$ in which you can move from one placement to any other legal placement obtained by switching the columns in which two rooks ...
openaire +3 more sources
Matrix Ansatz, lattice paths and rook placements [PDF]
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP. Besides other interpretations, this formula gives the generating function for permutations of a given size with ...
Corteel, S. +3 more
openaire +4 more sources
A generalization of Eulerian numbers via rook placements [PDF]
15 ...
Banaian, Esther +5 more
openaire +4 more sources
Bijections on
Suppose the rows of a board are partitioned into sets of m rows called levels. An m-level rook placement is a subset of the board where no two squares are in the same column or the same level. We construct explicit bijections to prove three theorems about such placements.
Kenneth Barrese +3 more
openaire +3 more sources
Rook Placements in An and Combinatorics of B-Orbit Closures
Let $G$ be a complex reductive group, $B$ be a Borel subgroup of G, $\nt$ be the Lie algebra of the unipotent radical of $B$, and $\nt^*$ be its dual space. Let $Φ$ be the root system of $G$, and $Φ^+$ be the set of positive roots with respect to $B$. A subset of $Φ^+$ is called a rook placement if it consists of roots with pairwise non-positive inner ...
Ignatyev, Mikhail V. +1 more
openaire +3 more sources
Type B (p, q)-Stirling Numbers via Signed Restricted Growth Functions and Rook Theory
Stirling numbers are among the most classical objects in enumerative combinatorics, counting set partitions and permutations. In this paper, we study their (p,q)-analogues in type B from a rook-theoretic point of view. We introduce a type B Ferrers board
Hasan Arslan +3 more
doaj +1 more source

