works on

From the 1 of 5 linked papers with an AI index.

activity
20242026
collaborators

5 papers

math.CO2026

Partitioning set into subsets of size at most such that all sums are powers of

Vladimir Gurvich, Mariya Naumova

The paper investigates partitions of the set {1,…,n} into subsets of size at most m whose element sums are powers of m, focusing on the case m=3; it conjectures that a 3‑good parti…

math.CO2026

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 \…

math.NT2026

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

A number is a triangular number if it can be written as for some nonnegative integer number . A triangular number is called square if it is a perfect sq…

stat.ME2025

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,…

math.CO2024

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…