29 citations · 29 across the 3 of their papers we have counts for
4 papers
A polynomial method over formal power series
Artur Akhiiarov, Mikhail Koshelev, Andrey Kupavskii +1
We give new upper bounds on families of integer vectors with prescribed coordinate multiplicities and a forbidden scalar product. Our method uses coefficient functions over formal…
Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes
Artur Akhiiarov, Peter Boyvalenkov, Danila Cherkashin +1
Deriving upper bounds on code size from existing bounds is a classical approach in coding theory, dating back to the seminal results of Elias, Bassalygo, and Levenshtein. We study…
Topological measures in weighted hypergraphs
Ekaterina Vasilyeva, Liubov Tupikina, Daniil Musatov +3
Higher-order interactions introduce an additional structural dimension to complex networks, requiring consistent generalizations of classical topological measures. In hypergraphs,…
Why are there six degrees of separation in a social network?
Ivan Samoylenko, David Aleja, Eva Primo +11
A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically…