Zobrazeno 1 - 10
of 30
pro vyhledávání: '"V. E. Tarakanov"'
Autor:
V. N. Sachkov, V. E. Tarakanov
In this book, the authors focus on the relation of matrices with nonnegative elements to various mathematical structures studied in combinatorics. In addition to applications in graph theory, Markov chains, tournaments, and abstract automata, the aut
Autor:
V. E. Tarakanov, R. A. Zatorskii
Publikováno v:
Mathematical Notes. 85:267-273
A class of matrices is determined for which a Polya transformation of permanents into determinants can be defined.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e1c303a171bc3a912d57b5d1f7aec72
https://doi.org/10.1134/s0001434609010301
https://doi.org/10.1134/s0001434609010301
Autor:
V. E. Tarakanov
Publikováno v:
Mathematical Notes. 82:836-842
In connection with problems of information theory, we study arithmetical progressions constructed at the points of elliptic curves over a finite field. For certain types of such curves, we establish the distribution of the quadratic residues at the x
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2785a2bc25c1347da97b777eda2258ad
https://doi.org/10.1134/s0001434607110284
https://doi.org/10.1134/s0001434607110284
Autor:
V. E. Tarakanov
Publikováno v:
Mathematical Notes. 76:219-237
We consider the well-known discrete logarithm problem in a finite simple field GF(\(p\)), where \(p\) is a prime number, which has several application in problems of information protection. In Sec. 1, we introduce and study some number sequences aris
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dadae86e4305dd9491d2b39239166a46
https://doi.org/10.1023/b:matn.0000036760.37456.f9
https://doi.org/10.1023/b:matn.0000036760.37456.f9
Autor:
V. E. Tarakanov
Publikováno v:
Mathematical Notes. 73:562-570
In the context of the study of pseudorandom sequences that use quadratic residues modulo the prime p, the constructive description of the set of prime moduli for which given integers are quadratic residues is considered. Using the Gauss Lemma, we pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3295e2b2d8f5c90ec8cd8a790b2f4d9b
https://doi.org/10.1023/a:1023267406766
https://doi.org/10.1023/a:1023267406766
Autor:
F M Malyshev, V E Tarakanov
Publikováno v:
Sbornik: Mathematics. 192:1341-1364
New combinatorial objects, which we call (v,k)-configurations, are introduced and studied. They occur as a result of weakening the conditions defining well-known combinatorial objects, the (v,k,{lambda})-configurations. Existence results for (v,k)-co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::930cba549bcb2a7a49bd55f8173e474c
https://doi.org/10.1070/sm2001v192n09abeh000595
https://doi.org/10.1070/sm2001v192n09abeh000595
Autor:
V. E. Tarakanov
Publikováno v:
Mathematical Notes. 69:411-420
The problem of efficient computation of maximum matchings in the n-dimensional cube, which is applied in coding theory, is solved. For an odd n, such a matching can be found by the method given in our Theorem 2. This method is based on the explicit c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26b7b58e5afedf7b6b0e0f4548280be6
https://doi.org/10.1023/a:1010243727233
https://doi.org/10.1023/a:1010243727233
Autor:
V. E. Tarakanov
Publikováno v:
Mathematical Notes. 65:335-343
To a graph (or a digraph) Γ we assign two matricesN(A) andN(−1)(A) of inner products of the vector rows and of the vector columns, respectively, of the adjacency matrix of Γ; these matrices are said to be adjoint. We develop an approach to the st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eea9e3c8e22253af7f5c44964803f431
https://doi.org/10.1007/bf02675076
https://doi.org/10.1007/bf02675076
Autor:
V. E. Tarakanov, F. M. Malyshev
Publikováno v:
Mathematical Notes. 62:449-456
Oriented graphs in which every pair of vertices can be connected by a unique path of given length (not depending on the choice of the pair of vertices) are studied. These graphs are a natural extension of the well-known de Bruijn graphs and retain th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c261b08b919490269f90caf6a927e379
https://doi.org/10.1007/bf02358978
https://doi.org/10.1007/bf02358978
Autor:
V. E. Tarakanov
Publikováno v:
Mathematical Notes. 61:731-738
Consider a hypergraphH withn vertices andm edges. Suppose that its edges contain at mostr vertices,r≥2, and the degrees of its vertices do not exceed δ, δ≥2. Let τ(H) be the transversal number of the graphH and μ(H) be its independence number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25adcac07e08e5b2f2238b1f0b382cde
https://doi.org/10.1007/bf02361215
https://doi.org/10.1007/bf02361215