Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / / T.V. Narayana.
Lattice path combinatorics has developed greatly as a branch of probability studies recently, and the need for new books on the subject is obvious. The present monograph, by one who has made significant contributions to combinatorics and its applications to probability and statistics, will be useful...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter University of Toronto Press eBook-Package Archive 1933-1999 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Toronto : : University of Toronto Press, , [2019] ©1979 |
Year of Publication: | 2019 |
Language: | English |
Series: | Heritage
|
Online Access: | |
Physical Description: | 1 online resource (120 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9781487582586 |
---|---|
ctrlnum |
(DE-B1597)527728 (OCoLC)1121052383 |
collection |
bib_alma |
record_format |
marc |
spelling |
Narayana, T.V., author. aut http://id.loc.gov/vocabulary/relators/aut Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / T.V. Narayana. Toronto : University of Toronto Press, [2019] ©1979 1 online resource (120 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Heritage Frontmatter -- Contents -- Tables -- Preface -- LATTICE PATH COMBINATORICS WITH STATISTICAL APPLICATIONS -- I. Lattice path problems and vectors of integers -- II. The dominance theorem and Smirnov test-statistics -- III. Some applications of dominance to statistical problems -- IV. The combinatorics of knock-out tournaments -- V. A miscellany of further research problems -- APPENDIX -- REFERENCES -- Notes and solutions -- Supplementary bibliography -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star Lattice path combinatorics has developed greatly as a branch of probability studies recently, and the need for new books on the subject is obvious. The present monograph, by one who has made significant contributions to combinatorics and its applications to probability and statistics, will be useful to research workers, teachers, professional statisticians, and advanced students alike. It treats several recent results and it offers a powerful new tool for studying many problems in mathematical statistics. The emphasis in the five chapters is on 'dominance.' From a consideration of exceedances in the lattice path problem, the text goes on to provide solutions to tests of hypotheses and simple sampling plans, displaying the usefulness of Young chains in the enumeration of the latter. The fourth chapter, on knock-out tournaments, represents one approach to paired comparisons quite close in spirit to dominance and lattice path combinatorics, and the final chapter considers the advantages of using combinatorial methods in statistical problems (including the Frame-Robinson-Thrall theorem to derive properties of non-parametric tests) and mentions current trends of research. Numerous examples, exercises, and references round out the text. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) Combinatorial analysis. Lattice theory. Mathematical statistics. MATHEMATICS / Probability & Statistics / General. bisacsh Title is part of eBook package: De Gruyter University of Toronto Press eBook-Package Archive 1933-1999 9783110490947 https://doi.org/10.3138/9781487582586 https://www.degruyter.com/isbn/9781487582586 Cover https://www.degruyter.com/cover/covers/9781487582586.jpg |
language |
English |
format |
eBook |
author |
Narayana, T.V., Narayana, T.V., |
spellingShingle |
Narayana, T.V., Narayana, T.V., Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / Heritage Frontmatter -- Contents -- Tables -- Preface -- LATTICE PATH COMBINATORICS WITH STATISTICAL APPLICATIONS -- I. Lattice path problems and vectors of integers -- II. The dominance theorem and Smirnov test-statistics -- III. Some applications of dominance to statistical problems -- IV. The combinatorics of knock-out tournaments -- V. A miscellany of further research problems -- APPENDIX -- REFERENCES -- Notes and solutions -- Supplementary bibliography -- Index |
author_facet |
Narayana, T.V., Narayana, T.V., |
author_variant |
t n tn t n tn |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Narayana, T.V., |
title |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / |
title_full |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / T.V. Narayana. |
title_fullStr |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / T.V. Narayana. |
title_full_unstemmed |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / T.V. Narayana. |
title_auth |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / |
title_alt |
Frontmatter -- Contents -- Tables -- Preface -- LATTICE PATH COMBINATORICS WITH STATISTICAL APPLICATIONS -- I. Lattice path problems and vectors of integers -- II. The dominance theorem and Smirnov test-statistics -- III. Some applications of dominance to statistical problems -- IV. The combinatorics of knock-out tournaments -- V. A miscellany of further research problems -- APPENDIX -- REFERENCES -- Notes and solutions -- Supplementary bibliography -- Index |
title_new |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / |
title_sort |
lattice path combinatorics with statistical applications; mathematical expositions 23 / |
series |
Heritage |
series2 |
Heritage |
publisher |
University of Toronto Press, |
publishDate |
2019 |
physical |
1 online resource (120 p.) |
contents |
Frontmatter -- Contents -- Tables -- Preface -- LATTICE PATH COMBINATORICS WITH STATISTICAL APPLICATIONS -- I. Lattice path problems and vectors of integers -- II. The dominance theorem and Smirnov test-statistics -- III. Some applications of dominance to statistical problems -- IV. The combinatorics of knock-out tournaments -- V. A miscellany of further research problems -- APPENDIX -- REFERENCES -- Notes and solutions -- Supplementary bibliography -- Index |
isbn |
9781487582586 9783110490947 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA276 |
callnumber-sort |
QA 3276 |
url |
https://doi.org/10.3138/9781487582586 https://www.degruyter.com/isbn/9781487582586 https://www.degruyter.com/cover/covers/9781487582586.jpg |
illustrated |
Not Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
519 - Probabilities & applied mathematics |
dewey-full |
519.5 |
dewey-sort |
3519.5 |
dewey-raw |
519.5 |
dewey-search |
519.5 |
doi_str_mv |
10.3138/9781487582586 |
oclc_num |
1121052383 |
work_keys_str_mv |
AT narayanatv latticepathcombinatoricswithstatisticalapplicationsmathematicalexpositions23 |
status_str |
n |
ids_txt_mv |
(DE-B1597)527728 (OCoLC)1121052383 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter University of Toronto Press eBook-Package Archive 1933-1999 |
is_hierarchy_title |
Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 / |
container_title |
Title is part of eBook package: De Gruyter University of Toronto Press eBook-Package Archive 1933-1999 |
_version_ |
1806143883195711488 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04173nam a22006855i 4500</leader><controlfield tag="001">9781487582586</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20191979onc fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781487582586</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3138/9781487582586</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)527728</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1121052383</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">onc</subfield><subfield code="c">CA-ON</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA276</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT029000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Narayana, T.V., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Lattice Path Combinatorics with Statistical Applications; Mathematical Expositions 23 /</subfield><subfield code="c">T.V. Narayana.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Toronto : </subfield><subfield code="b">University of Toronto Press, </subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (120 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Heritage</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Tables -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">LATTICE PATH COMBINATORICS WITH STATISTICAL APPLICATIONS -- </subfield><subfield code="t">I. Lattice path problems and vectors of integers -- </subfield><subfield code="t">II. The dominance theorem and Smirnov test-statistics -- </subfield><subfield code="t">III. Some applications of dominance to statistical problems -- </subfield><subfield code="t">IV. The combinatorics of knock-out tournaments -- </subfield><subfield code="t">V. A miscellany of further research problems -- </subfield><subfield code="t">APPENDIX -- </subfield><subfield code="t">REFERENCES -- </subfield><subfield code="t">Notes and solutions -- </subfield><subfield code="t">Supplementary bibliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Lattice path combinatorics has developed greatly as a branch of probability studies recently, and the need for new books on the subject is obvious. The present monograph, by one who has made significant contributions to combinatorics and its applications to probability and statistics, will be useful to research workers, teachers, professional statisticians, and advanced students alike. It treats several recent results and it offers a powerful new tool for studying many problems in mathematical statistics. The emphasis in the five chapters is on 'dominance.' From a consideration of exceedances in the lattice path problem, the text goes on to provide solutions to tests of hypotheses and simple sampling plans, displaying the usefulness of Young chains in the enumeration of the latter. The fourth chapter, on knock-out tournaments, represents one approach to paired comparisons quite close in spirit to dominance and lattice path combinatorics, and the final chapter considers the advantages of using combinatorial methods in statistical problems (including the Frame-Robinson-Thrall theorem to derive properties of non-parametric tests) and mentions current trends of research. Numerous examples, exercises, and references round out the text.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Combinatorial analysis.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Lattice theory.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematical statistics.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Probability & Statistics / General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">University of Toronto Press eBook-Package Archive 1933-1999</subfield><subfield code="z">9783110490947</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3138/9781487582586</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781487582586</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781487582586.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-049094-7 University of Toronto Press eBook-Package Archive 1933-1999</subfield><subfield code="c">1933</subfield><subfield code="d">1999</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |