3 citations · 4 across the 15 of their papers we have counts for
16 papers
Subgroup Inconsistency and the Dilution Effect in Levene's Test for Homoscedasticity
Vladimir Gurvich, Mariya Naumova
Levene's test for homoscedasticity is a standard procedure used to evaluate whether multiple groups of independent observations share a common variance. Because Levene's test relie…
Bridge distances for networks
Vladimir Gurvich, Mariya Naumova
Let be a finite directed graph with a non-negative real length assigned to every directed edge . We assume that for every non-edge $e \no…
On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares
Vladimir Gurvich, Mariya Naumova
In 1778 Leonhard Euler characterized triangular numbers that are perfect squares. Obviously, the product of any two such numbers is a perfect square too. Yet, there are many other…
Partitioning set into subsets of size at most such that all sums are powers of
Vladimir Gurvich, Mariya Naumova
Given integers and , we say that a partition of the set is {\em -good} if the number of elements in each part is at most and their sum…
Critical issues with the Pearson's chi-square test
Vladimir Gurvich, Mariya Naumova
Pearson's chi-square tests are among the most commonly applied statistical tools across a wide range of scientific disciplines, including medicine, engineering, biology, sociology,…
A counterexample to conjecture "Catch 22"
Bogdan Butyrin, Vladimir Gurvich, Anton Lutsenko +2
We construct a finite deterministic graphical (DG) game without Nash equilibria in pure stationary strategies. This game has 3 players and 5 outcomes: 2 terminal $a_1…
Screw discrete dynamical systems and their applications to exact slow NIM
Vladimir Gurvich, Mariya Naumova
Given integers such that and an integer vector ; denote by the number of entries of that are multiple of .…
On remoteness functions of k-NIM with k+1 piles in normal and in misère versions
Vladimir Gurvich, Vladislav Maximchuk, Georgy Miheenkov +1
Given integer and such that and piles of stones, two players alternate turns. By one move it is allowed to choose any piles and remove exactly one st…
GM-rule and its applications to impartial games
Vladimir Gurvich, Mariya Naumova
Given integer , and vector that has an entry which is a multiple of and such that , the GM-rule is…
More on discrete convexity
Vladimir Gurvich, Mariya Naumova
In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a…
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
Vladimir Gurvich, Mariya Naumova
Let and be a pair of dual multi-hypergraphs on the common ground set . Note that…
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms
Vladimir Gurvich, Mariya Naumova
We consider finite two-person normal form games. The following four properties of their game forms are equivalent: (i) Nash-solvability, (ii) zero-sum-solvability, (iii) win-lose-s…
Supercentenarian paradox
Vladimir Gurvich, Mariya Naumova
Consider the following statement: : a years old person NN will survive another years, where are nonnegative real numbers. We know only that…
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
Vladimir Gurvich, Mariya Naumova
In 1975 the first author proved that every finite tight two-person game form is Nash-solvable, that is, for every payoffs and of two players the obtained game …
Logical contradictions in the One-way ANOVA and Tukey-Kramer multiple comparisons tests with more than two groups of observations
Vladimir Gurvich, Mariya Naumova
We show that the One-way ANOVA and Tukey-Kramer (TK) tests agree on any sample with two groups. This result is based on a simple identity connecting the Fisher-Snedecor and student…
On Nash-solvability of n-person graphical games under Markov's and a priori realizations
Vladimir Gurvich, Mariya Naumova
We consider graphical -person games with perfect information that have no Nash equilibria in pure stationary strategies. Solving these games in mixed strategies, we introduce pr…