# Scientific Journal of KubSAU

Polythematic online scientific journal
of Kuban State Agrarian University
ISSN 1990-4665

#### Name

Titov Georgy Nikolaevich

#### Scholastic degree

associated professor

â€”

#### Organization, job position

Kuban State University

â€”

â€”

## Articles count: 3

Sort by:
481 kb

#### ON THE NUMERATIONS OF THE FINITE PARTIALLY ORDERED SETS

abstract 1181604006 issue 118 pp. 113 – 127 29.04.2016 ru 591
There is a widely known problem regarding the ordering of the partially ordered sets (Linear Ordering Problem). It boils down to finding the numerations of such sets. The main result of this article is a generalization of one of the known S. S. Kislitsyn's results about finding the number of numerations of finite partially ordered sets
0 kb

#### TECHNOLOGIES OF ORGANIZATION OF MATHEMATICAL INTERNET OLYMPIC GAMES FOR SCHOOLCHILDREN

abstract 1331709112 issue 133 pp. 1280 – 1287 30.11.2017 ru
The article considers one of the approaches to organizing and conducting remote online Olympiads for schoolchildren with the use of information and communication technologies. A detailed description of the network resource of the municipal Internet Olympiad for schoolchildren conducted among the pupils of the secondary schools of the city of Krasnodar is given, the structure of the main content, the scheme of interaction with the user is shown, and also the created tools of the Internet designer of the Olympiads are described. The article describes the results of the implementation of this project in the educational system of Krasnodar and gives a quantitative analysis
204 kb

#### THE NUMBER OF LINEARLY ORDERABLE BINARY RELATIONS ON A FINITE SET

abstract 1291705014 issue 129 pp. 170 – 184 31.05.2017 ru 309
Partially ordered set is a basic concept of modern settheoretic mathematics. The problem of linear set ordering with given binary relations is well-known. Every partial order over a finite set can be linearly ordered, but not every binary relation over this set can be linearly ordered as well. Up to now, there is no known formula for calculating the number of partial orders over a given finite set. It appears that there is a formula for calculating linearly ordered binary relations over a finite set. This article is concerned with derivation of this formula. The fact from work of G.N. Titov  that a binary relation over a finite set is linearly ordered if and only if any diagonal block, derived from the binary relation matrix as a result of setting main diagonal elements to zero, contains at least one zero row (diagonal block of matrix means any matrix composed of elements at the crossings of rows and columns of a given matrix with the same numbers), plays a key role in process of corroboration. The main conclusion of the article is a theorem that allows to find the number of linearly ordered binary relations over a set of n elements using the formula. A recurrence formula for the number of linearly ordered (irreflexive) binary relations over a finite set of n elements, provided in the lemma, was derived as well 