name

Titov Georgy Nikolaevich

Scholastic degree

•

Academic rank

associated professor

Honorary rank

—

Organization, job position

• Kuban State University
 
  доцент кафедры функционального анализа и алгебры

Research interests

научные интересы лежат в области структурной теории групп

Web site url

—

Email

—

Current rating (overall rating of articles)

0

TOP5 co-authors

• Titov N. G. ²
• Kolchanov A. V. ¹
• Novikov O. I. ¹
• Grushevsky S. P. ¹
• Tamarkova K. A. ¹

Articles count: 3

Сформировать список работ, опубликованных в Научном журнале КубГАУ

• pdf  492.810kb doc 492.810kb Views: 827 Date: 29.04.2016
  Novikov O. I. Titov N. G. Titov G. N.

  ON THE NUMERATIONS OF THE FINITE PARTIALLY ORDERED SETS

  01.00.00 Physical-mathematical sciences

  Description

  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

• pdf  208.521kb doc 208.521kb Views: 699 Date: 31.05.2017
  Titov G. N. Titov N. G. Lysenko A. V.

  THE NUMBER OF LINEARLY ORDERABLE BINARY RELATIONS ON A FINITE SET

  01.00.00 Physical-mathematical sciences

  Description

  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 [9] 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

• pdf  0kb doc 0kb Views: Date: 30.11.2017
  Grushevsky S. P. Kolchanov A. V. Tamarkova K. A. Titov G. N.

  TECHNOLOGIES OF ORGANIZATION OF MATHEMATICAL INTERNET OLYMPIC GAMES FOR SCHOOLCHILDREN

  13.00.00 Pedagogical sciences

  Description

  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