Sergei Nokhrin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sergei Nokhrin has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Vladimirovich Osipov
Krasovskii Institute of Mathematics and Mechanics, Ural Federal University, Yekaterinburg, Russia
2 shared publications Mikhail Al'Perin
Krasovskii Inst Math & Mech, Ekaterinburg, Russia
1 shared publication- Mikhail Patrakeev
Krasovskii Institute of Mathematics and Mechanics UB RAS 620108 Yekaterinburg Russia
1 shared publication - Valerii Trifonovich Shevaldin
N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, Ekaterinburg, Russia
1 shared publication
Latest Publications
- Open Access
Axiomatic and Erdős-Moon approaches to tournament rankings
Tournament ranking is a function that assigns each vertex of a tournament (i.e., a directed graph without loops, in which each pair of different vertexes is connected by exactly one arc) a number called the rank of the vertex. One of approaches to constructing tournament rankings suggests choosing a ranking that satisfies a fixed set of axioms. In another approach, proposed by Erdős and Moon, only injective rankings are considered, and among them, one that minimises the number of backward arcs is selected (an arc $x\to y$ is called backward iff the rank of $x$ is less than the rank of $y$). We combine these two approaches as follows: among the rankings that satisfy a fixed set of axioms, we choose one that minimises the number of backward arcs. The Erdős-Moon approach naturally leads to the question of how small the proportion of backward arcs can be guaranteed when using injective rankings. Erdős and Moon showed that the answer to this question is $1/2$. A similar question arises in our approach: how small the proportion of backward arcs can be guaranteed when using rankings that satisfy a set of axioms $\mathcal{A}$? We call this number the Erdős-Moon number of $\mathcal{A}$. We prove that the Erdős-Moon number of the Copeland axiom equals $3/4$.Open AccessAxiomatic and Erdős-Moon approaches to tournament rankings
Tournament ranking is a function that assigns each vertex of a tournament (i.e., a directed graph without loops, in which each pair of different vertexes is connected by exactly one arc) a number called the rank of the vertex. One of approaches to constructing tournament rankings suggests choosing a ranking that satisfies a fixed set of axioms. In another approach, proposed by Erdős and Moon, only injective rankings are considered, and among them, one that minimises the number of backward arcs is selected (an arc $x\to y$ is called backward iff the rank of $x$ is less than the rank of $y$). We combine these two approaches as follows: among the rankings that satisfy a fixed set of axioms, we choose one that minimises the number of backward arcs. The Erdős-Moon approach naturally leads to the question of how small the proportion of backward arcs can be guaranteed when using injective rankings. Erdős and Moon showed that the answer to this question is $1/2$. A similar question arises in our approach: how small the proportion of backward arcs can be guaranteed when using rankings that satisfy a set of axioms $\mathcal{A}$? We call this number the Erdős-Moon number of $\mathcal{A}$. We prove that the Erdős-Moon number of the Copeland axiom equals $3/4$. - Open Access
- 17 July 2024
- Published by Federal State Budgetary Educational Institution of Higher Education «Tula State Lev Tolstoy Pedagogical University» in Чебышевский сборник
- Vol. 25 (2) , 243-250
Sufficient conditions for the existence of the solution of an infinite-difference equation with variable coefficients
The paper discusses a difference equation of the formΣ︀𝑟𝑙=0 𝑎𝑘,𝑙𝑍𝑘+𝑙 = 𝑦𝑘 (𝑘 ∈ Z), where 𝑟 ∈ N, 𝑦 = {𝑦𝑘}𝑘∈Z is a given numerical sequence from the space 𝑙𝑝 (1 ⩽ 𝑝 < ∞), provided that the matrix 𝐴 = (𝑎𝑘,𝑙), 𝑎𝑘,𝑙 ∈ R, satisfies some condition close to the presence of a dominant diagonal. With the help of the fixed point theorem, sufficient conditions are written for thecoefficients 𝑎𝑘,𝑙, at which the equation has a unique solution 𝑍 = {𝑍𝑘}𝑘∈Z, belonging to the space 𝑙_𝑝. For the norm of this solution, a numerical estimate is given from above.
- 17 July 2024
- Published by Federal State Budgetary Educational Institution of Higher Education «Tula State Lev Tolstoy Pedagogical University» in Чебышевский сборник
- Vol. 25 (2) , 243-250
Open AccessSufficient conditions for the existence of the solution of an infinite-difference equation with variable coefficients
The paper discusses a difference equation of the formΣ︀𝑟𝑙=0 𝑎𝑘,𝑙𝑍𝑘+𝑙 = 𝑦𝑘 (𝑘 ∈ Z), where 𝑟 ∈ N, 𝑦 = {𝑦𝑘}𝑘∈Z is a given numerical sequence from the space 𝑙𝑝 (1 ⩽ 𝑝 < ∞), provided that the matrix 𝐴 = (𝑎𝑘,𝑙), 𝑎𝑘,𝑙 ∈ R, satisfies some condition close to the presence of a dominant diagonal. With the help of the fixed point theorem, sufficient conditions are written for thecoefficients 𝑎𝑘,𝑙, at which the equation has a unique solution 𝑍 = {𝑍𝑘}𝑘∈Z, belonging to the space 𝑙_𝑝. For the norm of this solution, a numerical estimate is given from above.
- 6 April 2023
- Published by Elsevier in Topology and its Applications
- Vol. 332
Embedding theorems for function spaces
- 6 April 2023
- Published by Elsevier in Topology and its Applications
- Vol. 332
Embedding theorems for function spaces
- 1 December 2009
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 267 (S1) , 184-191
On the coincidence of set-open and uniform topologies
The ℝ-compactness property is studied, and criteria are established for the coincidence of the set-open topology and the topology of uniform convergence on the spaces of continuous functions.
- 1 December 2009
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 267 (S1) , 184-191
On the coincidence of set-open and uniform topologies
The ℝ-compactness property is studied, and criteria are established for the coincidence of the set-open topology and the topology of uniform convergence on the spaces of continuous functions.