Zators'kyj R. Application of paradeterminants and parapermanents to solving of problems of combinatorial analysis

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0403U001466

Thesis Registration Form

0403U001466.pdf

Applicant for

Specialization

  • 01.01.08 - Математична логіка, теорія алгоритмів і дискретна математика

21-04-2003

Specialized Academic Board

Д26.001.18

Essay

Thesis is devoted to solving of certain combinatorial problems of finite multisets theory and certain problems on paths on Ferrers diagrams and inclined diagrams. Specifically, the problem of number of combinations and number permutations on multisets is solved in full generality, and effective algorithms of computing of these numbers are proposed. Solving some of the above-mentioned problems requires defining of new functions of triangular matrices (paradeterminants and parapermanents). In the thesis their properties are investigated and applications to solving of linear recurrent equations.

Read more

Files

LIT.DOC

ROZD1.DOC

ROZD2A.DOC

ROZD2B.DOC

ROZD3A.DOC

ROZD3B.DOC

ROZD4.DOC

WSTUP.DOC

WYSNOW.DOC

aref.doc

Similar theses

0421U102374

Skochko Volodymyr Mykhailovych

The growth of initial invertible automata

0521U101177

Varbanets Serhii Pavlovych

Method on exponential sums in theory of congruential generators of the pseudorandom numbers and asymptotic problems in number theory

0419U004313

Dudenko Marharyta

Metric bases of graphs

0416U004040

Bashova Nadezhda Petrovna

The classification and the calculation of the number of the topologies on the finite sets

0416U000249

Tran Thе Vinh

Applications of the Kloosterman sums in cryptography and coding