A generalization of Mehta-Wang determinant and Askey-Wilson polynomials
Motivated by the Gaussian symplectic ensemble, Mehta and Wang evaluated the $n×n$ determinant $\det ((a+j-i)Γ (b+j+i))$ in 2000. When $a=0$, Ciucu and Krattenthaler computed the associated Pfaffian $\mathrm{Pf}((j-i)Γ (b+j+i))$ with an application to the two dimensional dimer system in 2011. Recentl...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | Victor J. W. Guo, Masao Ishikawa, Hiroyuki Tagawa, Jiang Zeng |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2013-01-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2337/pdf |
Similar Items
Moments of Askey-Wilson polynomials
by: Jang Soo Kim, et al.
Published: (2013-01-01)
by: Jang Soo Kim, et al.
Published: (2013-01-01)
Polynomial-time normalizers
by: Eugene M. Luks, et al.
Published: (2011-12-01)
by: Eugene M. Luks, et al.
Published: (2011-12-01)
On the degree-chromatic polynomial of a tree
by: Diego Cifuentes
Published: (2012-01-01)
by: Diego Cifuentes
Published: (2012-01-01)
Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01)
by: Anne Lacroix, et al.
Published: (2013-01-01)
On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)
by: Peter Pal Pach, et al.
Published: (2011-11-01)
Recursions and divisibility properties for combinatorial Macdonald polynomials
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)
by: Nicholas A. Loehr, et al.
Published: (2011-02-01)
Counting words with Laguerre polynomials
by: Jair Taylor
Published: (2013-01-01)
by: Jair Taylor
Published: (2013-01-01)
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01)
by: Yury Person, et al.
Published: (2011-05-01)
Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)
by: Helmut Prodinger
Published: (2011-08-01)
Cumulants of the q-semicircular law, Tutte polynomials, and heaps
by: Matthieu Josuat-Vergès
Published: (2012-01-01)
by: Matthieu Josuat-Vergès
Published: (2012-01-01)
Kazhdan-Lusztig polynomials of boolean elements
by: Pietro Mongelli
Published: (2013-01-01)
by: Pietro Mongelli
Published: (2013-01-01)
Polynomials and Parking Functions
by: Angela Hicks
Published: (2012-01-01)
by: Angela Hicks
Published: (2012-01-01)
Moment graphs and KL-polynomials
by: Martina Lanini
Published: (2012-01-01)
by: Martina Lanini
Published: (2012-01-01)
Lifted generalized permutahedra and composition polynomials
by: Federico Ardila, et al.
Published: (2012-01-01)
by: Federico Ardila, et al.
Published: (2012-01-01)
Smooth Fano polytopes whose Ehrhart polynomial has a root with large real part
by: Hidefumi Ohsugi, et al.
Published: (2012-01-01)
by: Hidefumi Ohsugi, et al.
Published: (2012-01-01)
Arithmetic matroids and Tutte polynomials
by: Michele D'Adderio, et al.
Published: (2012-01-01)
by: Michele D'Adderio, et al.
Published: (2012-01-01)
The multivariate arithmetic Tutte polynomial
by: Petter Brändèn, et al.
Published: (2012-01-01)
by: Petter Brändèn, et al.
Published: (2012-01-01)
The Eulerian distribution on centrosymmetric involutions
by: Marilena Barnabei, et al.
Published: (2009-01-01)
by: Marilena Barnabei, et al.
Published: (2009-01-01)
Number of connected spanning subgraphs on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)
by: Shu-Chiuan Chang, et al.
Published: (2009-01-01)
Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)
by: Fabio Burderi, et al.
Published: (2007-01-01)
Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)
by: Vesa Halava, et al.
Published: (2008-01-01)
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)
by: Gregory Nuel
Published: (2008-01-01)
On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)
by: Jing Kong, et al.
Published: (2009-01-01)
Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)
by: Dorota Bród, et al.
Published: (2008-01-01)
Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)
by: David R. Wood
Published: (2008-01-01)
Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)
by: Petra Kocábová, et al.
Published: (2007-01-01)
Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)
Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)
by: Vincent Vajnovszki
Published: (2007-01-01)
The distribution of ascents of size d or more in compositions
by: Charlotte Brennan, et al.
Published: (2009-01-01)
by: Charlotte Brennan, et al.
Published: (2009-01-01)
On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)
by: Marina Groshaus, et al.
Published: (2008-01-01)
On-line extensible bin packing with unequal bin sizes
by: Deshi Ye, et al.
Published: (2009-01-01)
by: Deshi Ye, et al.
Published: (2009-01-01)
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System
by: Valerie Berthe, et al.
Published: (2009-03-01)
by: Valerie Berthe, et al.
Published: (2009-03-01)
Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)
by: Sergey Kitaev, et al.
Published: (2008-01-01)
A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)
by: David Callan
Published: (2008-01-01)
The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)
by: José Cáceres, et al.
Published: (2013-01-01)
List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01)
by: Aijun Dong, et al.
Published: (2013-03-01)
Immersion containment and connectivity in color-critical graphs
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)
by: Faisal N. Abu-Khzam, et al.
Published: (2012-10-01)
Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)
by: Manu Basavaraju
Published: (2012-10-01)
The competition number of a generalized line graph is at most two
by: Boram Park, et al.
Published: (2012-08-01)
by: Boram Park, et al.
Published: (2012-08-01)
Krausz dimension and its generalizations in special graph classes
by: Olga Glebova, et al.
Published: (2013-03-01)
by: Olga Glebova, et al.
Published: (2013-03-01)
Similar Items
-
Moments of Askey-Wilson polynomials
by: Jang Soo Kim, et al.
Published: (2013-01-01) -
Polynomial-time normalizers
by: Eugene M. Luks, et al.
Published: (2011-12-01) -
On the degree-chromatic polynomial of a tree
by: Diego Cifuentes
Published: (2012-01-01) -
Automaticity of primitive words and irreducible polynomials
by: Anne Lacroix, et al.
Published: (2013-01-01) -
On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)
