16 citations · 32 across the 19 of their papers we have counts for
19 papers
Proof of Aharoni Berger Conjecture
Vladimir Blinovsky
We prove the Aharoni Berger Conjecture
Proof of tightness of Varshamov - Gilbert bound for binary codes
Vladimir Blinovsky
We prove tightness of right logarithmic asymptotic of Varshamov- Gilbert bound for linear binary codes We find general asymptotic coding bound for linear codes
Solution of Hypergraph Turan problem
Vladimir Blinovsky
Using original {\it Symmetrical Smoothing Method} we solve - hypergraph Turan problem
Tight Asymptotic of Probability of singularity of n x n Random Matrix with Uniform Distributed \pm 1 Entries
Vladimir Blinovsky
We prove the conjecture about the probability that Pn of Bernulli +- 1 square matrix to be singular and asymptotic expansion of Pn.
Minimal number of edges in hypergraph guaranteeing perfect fractional matching and MMS conjecture, complete version
Vladimir Blinovsky
In this paper we prove Ahlswede- Khachatrian conjecture~\cite{1} up to finite number of cases, which can be checked using modern computers. From this conjecture follows conjecture…
Comments to Symmetrical Smoothing Method and First Step to How to Avoid Irrelevant Extremums
Vladimir Blinovsky
The main issues of the original Symmetrical smoothing method consists of approximation of the extremal volume of the set by the smooth symmetric function (sum of step functions) an…
Proof of Union-Closed Sets Conjecture
Vladimir Blinovsky, Llohann D Speranca
We prove Union-Closed sets conjecture.
Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
Vladimir Blinovsky, Catherine Greenhill
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For ,…
Erdös's Matching Conjecture and -wise -intersection Conjecture via Symmetrical Smoothing Method
Vladimir Blinovsky
We find the formula for the maximal cardinality of the family of -tuples from with does not have --matching. This formula after some analytical issues can…
Fractional matching in hypergraphs
Vladimir Blinovsky
We find the exact formula for the minimal number of edges of hypergraph which guaranteed fractional matching of cardinality in the case when is integer.
Minimal Number of Edges in Hypergraph Guaranteeing Perfect Fractional Matching and MMS Conjecture
Vladimir Blinovsky
We prove Ahlswede- Khachatrian conjecture. From this conjecture follows of several other conjectures including Manickam-Miklós-Singhi conjecture.
Complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Vladimir Blinovsky
We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Asymptotic enumeration of sparse uniform hypergraphs with given degrees
Vladimir Blinovsky, Catherine Greenhill
Let be a fixed integer. For infinitely many , let be a vector of nonnegative integers such that their sum is divisible by . W…
Proof of two conjectures on correlation inequalities for one class of monotone functions
Vladimir Blinovsky
We prove two conjectures on correlation inequalities for functions that are linear combinations of unimodal Boolean monotone nondecreasing functions
One conjecture about size of Sidon sets
Vladimir Blinovsky
We prove that maximal cardinality of the Sidon set from exceeds $\sqrt{n}
Correlation Inequality for Formal Series
Vladimir Blinovsky
We prove two correlation inequalities .
The solution of the complete nontrivial cycle intersection problem for permutations
Vladimir Blinovsky, Llohann D. Sperança
We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.
Classical-Quantum Arbitrarily Varying Wiretap Channel
Vladimir Blinovsky, Minglai Cai
We derive a lower bound on the capacity of classical-quantum arbitrarily varying wiretap channel and determine the capacity of the classicalquantum arbitrarily varying wiretap chan…
Random Coding Bound for the Reliability Function in Quantum Channel: General Case
Vladimir Blinovsky
We complete the proof of conjecture, which allows to complete the derivation of the random coding bound for the reliability function in quantum channel in the case of arbitrary sig…