Vladimir Blinovsky

From MaRDI portal
Revision as of 13:45, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Vladimir Blinovsky to Vladimir Blinovsky: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:311511

Available identifiers

zbMath Open blinovsky.vladimirMaRDI QIDQ311511

List of research outcomes





PublicationDate of PublicationType
A Proof of Brouwer's Conjecture2019-08-22Paper
Proof of Aharoni Berger Conjecture2019-04-14Paper
Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees2016-09-13Paper
Solution of Hypergraph Turan problem2016-03-01Paper
Tight Logarithmic Asymptotic for the Probability of $n\times n$ Random Matrix with Uniform Distributed $\pm 1$ Entries to be Singular2015-11-17Paper
Minimal number of edges in hypergraph guaranteeing perfect fractional matching and MMS conjecture, complete version2015-10-05Paper
Asymptotic enumeration of sparse uniform hypergraphs with given degrees2015-09-30Paper
Fractional matchings in hypergraphs2015-07-24Paper
Comments to Symmetrical Smoothing Method and First Step to How to Avoid Irrelevant Extremums2015-07-17Paper
Proof of Union- Closed Sets Conjecture2015-07-05Paper
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture2015-07-03Paper
Proof of two conjectures on correlation inequalities for one class of monotone functions2015-03-17Paper
Correlation Inequality for Formal Series2014-06-11Paper
Erd\"os's Matching Conjecture and $s$-wise $t$-intersection Conjecture via Symmetrical Smoothing Method2014-02-06Paper
Fractional matching in hypergraphs2013-11-11Paper
Remark on one problem in extremal combinatorics2013-11-04Paper
Proof of one inequality in identification theory2013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573352013-11-01Paper
Complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions2013-08-01Paper
Classical-Quantum Arbitrarily Varying Wiretap Channel2013-04-09Paper
A remark on the problem of nonnegative \(k\)-subset sums2013-04-03Paper
One conjecture about size of Sidon sets2013-04-03Paper
The solution of the complete nontrivial cycle intersection problem for permutations2013-02-28Paper
BSC reliability function under list decoding2012-03-13Paper
Intersection theorem for finite permutations2012-03-13Paper
Remark on the reliability function of a symmetric channel under list decoding2012-03-13Paper
New asymptotic bounds on the size of multiple packings of the Euclidean sphere2011-11-25Paper
Weight distribution moments of random linear/coset codes2010-09-16Paper
https://portal.mardi4nfdi.de/entity/Q35767142010-07-30Paper
A proof of one correlation inequality2010-01-12Paper
Plotkin bound generalization to the case of multiple packings2009-10-20Paper
Correlation Inequalities in Function Spaces2009-01-22Paper
Two Problems from Coding Theory2009-01-22Paper
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels2008-12-21Paper
On the convexity of a function in coding theory2008-10-27Paper
Multiple packing in sum-type metric spaces2008-09-29Paper
Lectures on advances in combinatorics2008-06-17Paper
Correlation Inequalities in Function Spaces2007-05-29Paper
Multiple Packing in Sum-type Metric Spaces2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34339572007-04-23Paper
On the Number of Step Functions with Restrictions2007-04-02Paper
Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes2006-12-07Paper
Random sphere packing2006-10-26Paper
Code bounds for multiple packings over a nonbinary finite alphabet2005-12-19Paper
Large deviations in quantum information theory2005-09-14Paper
Error probability exponent of list decoding at low rates2004-01-08Paper
Random Young diagram, variational method, and related problems2003-09-24Paper
Uniform estimate for a spectrum of a linear code2003-09-08Paper
New approach to estimation of the decoding error probability2003-06-19Paper
Size of the largest antichain in a partition poset2003-06-19Paper
Large deviations of the shape of a random Young diagram with the Bell distribution2002-02-17Paper
Large deviation principle for Poisson random variables and Young diagrams2002-01-06Paper
Lower bound for the linear multiple packing of the binary Hamming space2001-03-12Paper
https://portal.mardi4nfdi.de/entity/Q49460352000-12-12Paper
Large deviation principle for the border of a random Young diagram2000-11-08Paper
https://portal.mardi4nfdi.de/entity/Q45009772000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q49544072000-06-07Paper
Asymptotical properties of linear codes2000-03-21Paper
Multiple packing of the Euclidean sphere1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q38386711999-03-04Paper
https://portal.mardi4nfdi.de/entity/Q38386721998-11-05Paper
An estimate for the probability of undetected error.1998-07-16Paper
https://portal.mardi4nfdi.de/entity/Q43602491997-10-22Paper
https://portal.mardi4nfdi.de/entity/Q48861381996-08-22Paper
https://portal.mardi4nfdi.de/entity/Q43266041995-03-22Paper
List decoding1993-01-16Paper
Lower bound on error probability in fixed-volume list decoding1992-09-26Paper
Asymptotically exact uniform bounds for spectra of cosets of linear codes1990-01-01Paper
Covering the Hamming space with sets translated by linear code vectors1990-01-01Paper
Lower asymptotic bound on the number of linear code words in a sphere of given radius in \(F_ q^ n\).1987-01-01Paper
Bounds for codes in the case of list decoding of finite volume1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37373751986-01-01Paper

Research outcomes over time

This page was built for person: Vladimir Blinovsky