当$4q^{5}-5q^{4}-2q+1\leq d \leq 4q^{5}-5q^{4}-q$时$[g_{q}(6,d),6,d]_{q}$码的不存在性

证明了对于q≥17,当4q~5-5q~4-2q+1≤d≤4q~5-5q~4-q时,不存在达到Griesmer界的[n,k,d]_q码.此结果推广了Cheon等人在2005年和2008年的非存在性定理.     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007     

The spectrum of cyclic BSA(ν, 3, λ; α) with α = 2, 3

Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao, and Stufken in 1988. In this paper, we generalize the concept of a cyclic BSEC to a cyclic balanced sampling plan to avoid the selection of adjacent units (or CBSA for short) and use Langford and extended Langford sequences to construct a cyclic BSA(ν, 3, λ; α) with α = 2, 3. We finally establish the necessary and sufficient conditions for the existence of a cyclic BSA(ν, 3, λ; α) where α = 2, 3. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

Directed B(K, 1; v) with K = {4, 5} and {4, 6} related to deletion/insertion‐correcting codes

Motivated by the construction of t‐deletion/insertion‐correcting codes, we consider the existence of directed PBDs with block sizes from K = {4, 5} and {4, 6}. The spectra of such designs are determined completely in this paper. For any integer {υ ≥ 4, a DB({4,5} ,1; υ) exists if and only if υ∉{6, 8, 9, 12, 14}, and a DB({4, 6}, 1; υ) exists if and only if υ ≡ 0,1 mod 3 and υ∉{9,15}. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 147–156, 2001     

On a question of Thas on partial 3‐(qn + 1, q + 1, 1) designs

In this note, we answer a question of JA Thas about partial $3$‐ $\left(q^n+1,q+1,1\right)$ designs. We then extend this answer to a result about the embedding of certain partial $3$‐ $\left(q^2+1,q+1,1\right)$ designs into Möbius planes.     

A Regularization Procedure for Σn−i=1fi(zj)xi = g(zj), ( j = 1, 2, …, n)

A regularization procedure for linear systems of the type fi(z_j)x_i = g(zj), (j = 1, 2, …, n) is presented, which is particularly useful in the case when z₁, z₂, …, z_n are close to each other. The associated numerical algorithm was tested on several examples for which analytic solutions do exist and was found to yield highly accurate results.     

Simple 3‐designs of PSL(2, 2n) with block size 7

In this paper, we determine the number of the orbits of 7‐subsets of with a fixed orbit length under the action of PSL(2, 2ⁿ). As a consequence, we determine the distribution of λ for which there exists a simple 3‐(2ⁿ + 1, 7, λ) design with PSL(2, 2ⁿ) as an automorphism group. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 1–17, 2008     

A study on the (2 + 1)‐dimensional KdV4 equation derived by using the KdV recursion operator

We derive a new ( 2 + 1)‐dimensional Korteweg–de Vries 4 (KdV4) equation by using the recursion operator of the KdV equation. This study shows that the new KdV4 equation possess multiple soliton solutions the same as the multiple soliton solutions of the KdV hierarchy, but differ only in the dispersion relations. We also derive other traveling wave solutions. Copyright © 2013 John Wiley & Sons, Ltd.     

3‐Spontaneous Emission Error Designs from PSL(2, q) or PGL(2, q)

Quantum jump codes are quantum codes that correct errors caused by quantum jumps. A spontaneous emission error design (SEED) was introduced by Beth et al. in 2003 to construct quantum jump codes. In this paper, we study the existence of 3‐SEEDs from PSL(2, q) or PGL(2, q). By doing this, a large number of 3‐ SEEDs are derived for prime powers q and all .     

More results on perfect (3,3,6k + 4; 6k − 2)‐threshold schemes

A (2,3)‐packing on X is a pair (X, ), where is a set of 3‐subsets (called blocks) of X, such that any pair of distinct points from X occurs together in at most one block. Its leave is a graph (X,E) such that E consists of all the pairs which do not appear in any block of . In this article, we shall construct a set of 6k ? 2 disjoint (2,3)‐packings of order 6k + 4 with K_1,3 ∪ 3kK₂ or G₁ ∪ (3k ? 1)K₂ as their common leave for any integer k ≥ 1 with a few possible exceptions (G₁ is a special graph of order 6). Such a system can be used to construct perfect threshold schemes as noted by Schellenberg and Stinson ( 22 ). © 2006 Wiley Periodicals, Inc. J Combin Designs     

Group‐divisible designs with block size k having k + 1 groups,for k = 4, 5

We investigate the spectrum for k‐GDDs having k + 1 groups, where k = 4 or 5. We take advantage of new constructions introduced by R. S. Rees (Two new direct product‐type constructions for resolvable group‐divisible designs, J Combin Designs, 1 (1993), 15–26) to construct many new designs. For example, we show that a resolvable 4‐GDD of type g⁵ exists if and only if g ≡ 0 mod 12 and that a resolvable 5‐GDD of type g⁶ exists if and only if g ≡ 0 mod 20. We also show that a 4‐GDD of type g⁴m¹ exists (with m > 0) if and only if g ≡ m ≡ 0 mod 3 and 0 < m ≤ 3g/2, except possibly when (g,m) = (9,3) or (18,6), and that a 5‐GDD of type g⁵m¹ exists (with m > 0) if and only if g ≡ m ≡ 0 mod 4 and 0 < m ≤ 4g/3, with 32 possible exceptions. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 363–386, 2000     

A variety of distinct kinds of multiple soliton solutions for a ( 3 + 1)‐dimensional nonlinear evolution equation

In this work, a variety of distinct kinds of multiple soliton solutions is derived for a ( 3 + 1)‐dimensional nonlinear evolution equation. The simplified form of the Hirota's method is used to derive this set of distinct kinds of multiple soliton solutions. The coefficients of the spatial variables play a major role in the existence of this variety of multiple soliton solutions for the same equation. The resonance phenomenon is investigated as well. Copyright © 2012 John Wiley & Sons, Ltd.     

{2, 3}‐perfect m‐cycle systems are equationally defined for m = 5, 7, 8, 9, and 11 only

An m‐cycle system (S,C) of order n is said to be {2,3}‐perfect provided each pair of vertices is connected by a path of length 2 in an m‐cycle of C and a path of length 3 in an m‐cycle of C. The class of {2,3}‐perfect m‐cycle systems is said to be equationally defined provided, there exists a variety of quasigroups V with the property that a finite quasigroup (Q, , \, /) belongs to V if and only if its multiplicative (Q, ) part can be constructed from a {2,3}‐perfect m‐cycle system using the 2‐construction (a a = a for all a ∈ Q and if a ≠ b, a b = c and b a = d if and only if the m‐cycle (…, d, x, a, b, y, c, …) ∈ C). The object of this paper is to show that the class of {2,3}‐perfect m‐cycle systems cannot be equationally defined for all m ≥ 10, m ≠ 11. This combined with previous results shows that {2, 3}‐perfect m‐cycle systems are equationally defined for m = 5, 7, 8, 9, and 11 only. © 2004 Wiley Periodicals, Inc.     

On (ε,k)‐min‐wise independent permutations

A family of permutations of [n] = {1,2,…,n} is (ε,k)‐min‐wise independent if for every nonempty subset X of at most k elements of [n], and for any x ∈ X, the probability that in a random element π of , π(x) is the minimum element of π(X), deviates from 1/∣X∣ by at most ε/∣X∣. This notion can be defined for the uniform case, when the elements of are picked according to a uniform distribution, or for the more general, biased case, in which the elements of are chosen according to a given distribution D. It is known that this notion is a useful tool for indexing replicated documents on the web. We show that even in the more general, biased case, for all admissible k and ε and all large n, the size of must satisfy as well as This improves the best known previous estimates even for the uniform case. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Some infinite families of 2‐designs from PG (n,q)

In this paper, we establish the existence of some infinite families of 2‐designs from ‐dimensional projective geometry , which admit ‐dimensional projective special linear group as their flag‐transitive automorphism group.     

Lower bound for matrix operators on the Euler weighted sequence space e_{w,p}^{\theta} (0<p<1)

Let A=(a _n,k ) _n,k≥0 be a non-negative matrix. Denote by \(L_{l_{p} (w),~e_{w,q}^{\theta}}(A)\) the supremum of those L, satisfying the following inequality:

     

19.

Family of Pearson discrete distributions generated by the univariate hypergeometric function 3F2(α1, α2, α3; γ1, γ2; λ)     

Ramn Gutirrez Jimez  Jos Rodríguez Avi 《商业与工业应用随机模型》1997,13(2):115-125

In this work we present a study of the Pearson discrete distributions generated by the hypergeometric function ₃F₂(α₁, α₂, α₃;γ₁, γ₂; λ), a univariate extension of the Gaussian hypergeometric function, through a constructive methodology. We start from the polynomial coefficients of the difference equation that lead to such a function as a solution. Immediately after, we obtain the generating probability function and the differential equation that it satisfies, valid for any admissible values of the parameters. We also obtain the differential equations that satisfy the cumulants generating function, moments generating function and characteristic function, From this point on, we obtain a relation in recurrences between the moments about the origin, allowing us to create an equation system for estimating the parameters by the moment method. We also establish a classification of all possible distributions of such type and conclude with a summation theorem that allows us study some distributions belonging to this family. © 1997 by John Wiley & Sons, Ltd.     

20.

A complete classification of 3‐(11, 4, 4) designs with nontrivial automorphism group     

Z. Eslami  G. B. Khosrovshahi 《组合设计杂志》2000,8(6):419-425

In this paper, we classify all simple 3‐(11, 4, 4) designs with nontrivial automorphism group. A computational method based on the standard basis of trades is developed and a total of 51,267,240 nonisomorphic designs is produced. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 419–425, 2000     

Family of Pearson discrete distributions generated by the univariate hypergeometric function 3F2(α1, α2, α3; γ1, γ2; λ)

In this work we present a study of the Pearson discrete distributions generated by the hypergeometric function ₃F₂(α₁, α₂, α₃;γ₁, γ₂; λ), a univariate extension of the Gaussian hypergeometric function, through a constructive methodology. We start from the polynomial coefficients of the difference equation that lead to such a function as a solution. Immediately after, we obtain the generating probability function and the differential equation that it satisfies, valid for any admissible values of the parameters. We also obtain the differential equations that satisfy the cumulants generating function, moments generating function and characteristic function, From this point on, we obtain a relation in recurrences between the moments about the origin, allowing us to create an equation system for estimating the parameters by the moment method. We also establish a classification of all possible distributions of such type and conclude with a summation theorem that allows us study some distributions belonging to this family. © 1997 by John Wiley & Sons, Ltd.     

A complete classification of 3‐(11, 4, 4) designs with nontrivial automorphism group

In this paper, we classify all simple 3‐(11, 4, 4) designs with nontrivial automorphism group. A computational method based on the standard basis of trades is developed and a total of 51,267,240 nonisomorphic designs is produced. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 419–425, 2000