Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. "Trivializing'' gene ...
Article

"Trivializing'' generalizations of some Izergin-Korepin-type determinants

Tewodros Amdeberhan (1), Doron Zeilberger (2)
(1) Department of Mathematics [Tulane, New Orleans]
(2) Department of Mathematics - Rutgers School of Arts and Sciences
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:1
Combinatorics
DOI
10.46298/dmtcs.402
License
https://about.hal.science/hal-authorisation-v1
Indicators
730
Views
827
Downloads

"Trivializing'' generalizations of some Izergin-Korepin-type determinants

Tewodros Amdeberhan (1), Doron Zeilberger (2)
(1) Department of Mathematics [Tulane, New Orleans]
(2) Department of Mathematics - Rutgers School of Arts and Sciences
Abstract
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaffians due to Kuperberg, as well as a determinant of Tsuchiya. The level of generality of our statements render their proofs easy and routine, by using Dodgson Condensation and/or Krattenthaler's factor exhaustion method.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Preview
Loading PDF preview...