Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Iliya Bluskov"'
Publikováno v:
International Journal of Number Theory. 18:905-911
In this paper, we obtain several parametric solutions of the diophantine equation [Formula: see text]. We also show how infinitely many parametric solutions of this equation may be obtained by using elliptic curves.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::719b44961dba3d0f44dcfa3b520c605a
https://doi.org/10.1142/s1793042122500476
https://doi.org/10.1142/s1793042122500476
Autor:
Iliya Bluskov
Publikováno v:
Electronic Notes in Discrete Mathematics. 65:31-36
The constant A ( n , d , w ) is the maximum number of words in an ( n , d , w ) binary code, that is, a code of minimal distance d, with words of length n and weight w. We improve the best known lower bounds on A ( n , d , w ) for three sets of param
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e602436d5d0eadfacd058c01953d569
https://doi.org/10.1016/j.endm.2018.02.017
https://doi.org/10.1016/j.endm.2018.02.017
Autor:
Iliya Bluskov
Publikováno v:
Journal of Combinatorial Optimization. 31:1335-1344
A metaheuristic is generally a procedure designed to find a good solution to a difficult optimization problem. Known optimization search metaheuristics heavily rely on parameters, which are usually introduced so that the metaheuristic follows some su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa77f787cf34bf73ec708ef877ea93d3
https://doi.org/10.1007/s10878-014-9826-x
https://doi.org/10.1007/s10878-014-9826-x
Autor:
Iliya Bluskov
Publikováno v:
The Mathematical Gazette. 95:342-347
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f71b3318bdbf1eaa60ba207c5db522d7
https://doi.org/10.1017/s0025557200003235
https://doi.org/10.1017/s0025557200003235
Publikováno v:
Journal of Combinatorial Designs. 15:511-533
A t-(v, k, λ) covering design is a set of b blocks of size k such that each t-set of points occurs in at least λ blocks, and the covering number Cλ(v, k, t) is the minimum value of b in any t-(v, k, λ) covering design. In this article, we determi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23fd8e2b30ed70f2d74071c73840700d
https://doi.org/10.1002/jcd.20157
https://doi.org/10.1002/jcd.20157
Publikováno v:
Discrete Mathematics. 279(1-3):5-32
The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that λ(v−1)≡0 mod (k−1), λv(v−1)≡0 mod k(k−1) . In this paper we study k=9 with λ=3, 6 and 12. We show th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47051c07142102328c21c9a3e6399fee
Publikováno v:
Journal of Combinatorial Designs. 12:362-380
A collection of k-subsets (called blocks) of a v-set X (v) = {1, 2,…, v} (with elements called points) is called a t-(v, k, m, λ) covering if for every m-subset M of X (v) there is a subcollection of with such that every block K ∈ has at least t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45364a1f32c360c1eca31a0978ffb5e8
https://doi.org/10.1002/jcd.20019
https://doi.org/10.1002/jcd.20019
Publikováno v:
Designs, Codes and Cryptography. 26:33-59
The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that: \begin{array}{rcl} \lambda (v - 1) &\equiv& 0\ \mod (k - 1) \\[2pt] \lambda v(v - 1 ) &\equiv& 0\ \mod k(k - 1) \e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ccc5342487643617c12ddc8c1b4122b
https://doi.org/10.1023/a:1016592806366
https://doi.org/10.1023/a:1016592806366
Autor:
Iliya Bluskov, Katherine Heinrich
Publikováno v:
Journal of Statistical Planning and Inference. 95:121-131
A t-(v,k,λ) design D=(X, B ) is a collection B ={B 1 ,B 2 ,…,B b } of k-subsets (called blocks) of a v-set X (with elements called points) such that every t-subset of X is contained in precisely λ blocks. Let p D = max 1⩽i |B i ∩B j | . Let p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5193a6eb2144c8ee0384653596b8d7b1
https://doi.org/10.1016/s0378-3758(00)00282-2
https://doi.org/10.1016/s0378-3758(00)00282-2
Publikováno v:
Journal of Combinatorial Designs. 9:233-268
The necessary conditions for the existence of a balanced incomplete block design on υ ≥ k points, with index λ and block size k, are that: For k = 8, these conditions are known to be sufficient when λ = 1, with 38 possible exceptions, the larges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca7d6eabe12a91d41ff4313f236113f1
https://doi.org/10.1002/jcd.1010
https://doi.org/10.1002/jcd.1010