arXiv subjects

Krasimir Yordzhev

Publications and source records attributed to Krasimir Yordzhev.

40 records · Page 3Linked to original sources

arXiv2012

Mathematical Modeling of the Weaving Structure Design

An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine the possibility to get some special elements of this factor set. We propose an algorithm, which solves these problems. The results we have received are used to describe the topology of the different weaving structures.

math.RT↗

arXiv2012

A Representation of Binary Matrices

In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using two-dimensional array. It is shown that the presentation of binary matrices using ordered n-tuples of natural numbers makes the algorithms faster and saves a lot of memory. In this work we use object-oriented programming using the syntax and the semantic of C++ programming language.

cs.MS↗

arXiv2012

Method of the Multidimensional Sieve in the Practical Realization of some Combinatorial Algorithms

Some difficulties regarding the application of the well-known sieve method are considered in the case when a practical (program) realization of selecting elements, having a particular property among the elements of a set with a sufficiently great cardinal number(cardinality). In this paper the problem has been resolved by using a modified version of the method, utilizing multidimensional arrays. As a theoretical illustration of the method of the multidimensional sieve, the problem of obtaining a single representative of each equivalence class with respect to a given relation of equivalence and obtaining the cardinality of the respective factor set is considered with relevant mathematical proofs.

cs.DS↗

arXiv2012

An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation

A formal-linguistic approach for solving an entertaining task is made in this paper. The well-known task of the Hanoi towers is discussed in relation to some concepts of discrete mathematics. A context-free grammar which generate an algorithm for solving this task is described. A deterministic pushdown automation which in its work imitates the work of monks in solving the task of the Hanoi towers is built.

cs.FL↗