Results 11 to 20 of about 1,385 (101)
Throughput analysis for a high-performance FPGA-accelerated real-time search application [PDF]
, 2012 We propose an FPGA design for the relevancy computation part of a high-throughput real-time search application. The application matches terms in a stream of documents against a static profile, held in off-chip memory.
Chalamalasetti, S.R. +2 more
core +3 more sources
Wick's theorem for q-deformed boson operators [PDF]
, 2007 In this paper combinatorial aspects of normal ordering arbitrary words in the creation and annihilation operators of the q-deformed boson are discussed.
Anshelevich M +13 more
core +2 more sources
Partitions of Matrix Spaces With an Application to $q$-Rook Polynomials
, 2019 We study the row-space partition and the pivot partition on the matrix space $\mathbb{F}_q^{n \times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual.
Gluesing-Luerssen, Heide +1 more
core +1 more source
Type B (p, q)-Stirling Numbers via Signed Restricted Growth Functions and Rook Theory
MathematicsStirling 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
Elliptic rook and file numbers [PDF]
, 2016 Utilizing elliptic weights, we construct an elliptic analogue of rook numbers for Ferrers boards. Our elliptic rook numbers generalize Garsia and Remmel's q-rook numbers by two additional independent parameters a and b, and a nome p.
Schlosser, Michael J., Yoo, Meesue
core +1 more source
Rook placements and Jordan forms of upper-triangular nilpotent matrices [PDF]
, 2017 The set of n by n upper-triangular nilpotent matrices with entries in a finite field F_q has Jordan canonical forms indexed by partitions lambda of n.
Yip, Martha
core +2 more sources
Two Vignettes On Full Rook Placements [PDF]
, 2013 Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results.
Bloom, Jonathan, Vatter, Vince
core
Basic hypergeometric summations from rook theory
, 2016 We employ a one-variable extension of q-rook theory to give combinatorial proofs of some basic hypergeometric summations, including the q-Pfaff-Saalsch\"utz summation and a 4phi3 summation by Jain.Comment: 12 ...
Schlosser, Michael J., Yoo, Meesue
core +1 more source
Bruhat intervals as rooks on skew Ferrers boards
Journal of Combinatorial Theory, Series A, 2007 16 pages, 9 ...
openaire +2 more sources
Normal Order: Combinatorial Graphs
, 2003 A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators.
Blasiak, Pawel +4 more
core +2 more sources