Zobrazeno 1 - 10
of 8 021
pro vyhledávání: '"Vorob'ëv AS"'
Autor:
Oaknin, David H., Hess, Karl
The well known inequalities of John S. Bell may be regarded, from a purely mathematical viewpoint, as a direct consequence of Vorob'ev-type topological-combinatorial cyclicities formed with functions on a common probability space. However, the interp
Externí odkaz:
http://arxiv.org/abs/2008.02633
Generalized Vorob'ev-Yablonski polynomials have been introduced by Clarkson and Mansfield in their study of rational solutions of the second Painlev\'e hierarchy. We present new Hankel determinant identities for the squares of these special polynomia
Externí odkaz:
http://arxiv.org/abs/1504.00440
Autor:
Bertola, Marco, Bothner, Thomas
In the present paper we derive a new Hankel determinant representation for the square of the Vorob'ev-Yablonski polynomial $\mathcal{Q}_n(x),x\in\mathbb{C}$. These polynomials are the major ingredients in the construction of rational solutions to the
Externí odkaz:
http://arxiv.org/abs/1401.1408
Publikováno v:
spatial statistics 2 (2012) 47-61
The issue of a "mean shape" of a random set $X$ often arises, in particular in image analysis and pattern detection. There is no canonical definition but one possible approach is the so-called Vorob'ev expectation $\E_V(X)$, which is closely linked t
Externí odkaz:
http://arxiv.org/abs/1006.5135
Special polynomials associated with rational solutions of the second Painlev'e equation and other equations of its hierarchy are studied. A new method, which allows one to construct each family of polynomials is presented. The structure of the polyno
Externí odkaz:
http://arxiv.org/abs/nlin/0605018
Special polynomials associated with rational solutions of the second Painlev\'{e} equation and other members of its hierarchy are discussed. New approach, which allows one to construct each polynomial is presented. The structure of the polynomials is
Externí odkaz:
http://arxiv.org/abs/nlin/0603044
Autor:
Vorob'ev, Konstantin
We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for $q=3$, $4
Externí odkaz:
http://arxiv.org/abs/2403.10992
We obtain a classification of the completely regular codes with covering radius 1 and the second eigenvalue in the Hamming graphs H(3,q) up to q and intersection array. Due to works of Meyerowitz, Mogilnykh and Valyuzenich, our result completes the c
Externí odkaz:
http://arxiv.org/abs/2403.02702
Autor:
Landjev, Ivan, Vorob'ev, Konstantin
We consider the problem of finding $A_2(n,\{d_1,d_2\})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_1$ and $d_2$. Binary codes with distances $d$ and $d+2$ of size $\sim\frac{n^2}{\frac{d}{2}(\frac{d}
Externí odkaz:
http://arxiv.org/abs/2402.13420
Publikováno v:
In Spatial Statistics December 2012 2:47-61
