Neighborhood Conditions for Fractional ID-<Emphasis Type="Italic">k</Emphasis>-factor-critical Graphs

Let G be a graph and k ≥ 2 a positive integer. Let h: E(G) → [0, 1] be a function. If \(\sum\limits_{e \mathrel\backepsilon x} {h(e) = k} \) holds for each x ∈ V (G), then we call G[F_h] a fractional k-factor of G with indicator function h where F_h = {e ∈ E(G): h(e) > 0}. A graph G is fractional independent-set-deletable k-factor-critical (in short, fractional ID-k-factor-critical), if G ? I has a fractional k-factor for every independent set I of G. In this paper, we prove that if n ≥ 9k ? 14 and for any subset X ? V (G) we have

$${N_G}(X) = V(G)if|X| \geqslant \left\lfloor {\frac{{kn}}{{3k - 1}}} \right\rfloor ;or|{N_G}(X)| \geqslant \frac{{3k - 1}}{k}|X|if|X| < \left\lfloor {\frac{{kn}}{{3k - 1}}} \right\rfloor ,$$

then G is fractional ID-k-factor-critical.

     

(<Emphasis Type="Italic">s</Emphasis>, <Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-bi-Koszul algebras

The paper focuses on the 1-generated positively graded algebras with non-pure resolutions and mainly discusses a new kind of algebras called(s,t,d)-bi-Koszul algebras as the generalization of bi-Koszul algebras. An(s,t,d)-bi-Koszul algebra can be obtained from two periodic algebras with pure resolutions. The generation of the Koszul dual of an(s,t,d)-bi-Koszul algebra is discussed. Based on it,the notion of strongly(s,t,d)-bi-Koszul algebras is raised and their homological properties are further discussed.     

Cyclotomic Hecke Algebras of <Emphasis Type="Italic">G</Emphasis>(<Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)

In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape.     

A Family of Binary (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">s</Emphasis>)-Nets of Strength 5

(t,m,s)-Nets were defined by Niederreiter [Monatshefte fur Mathematik, Vol. 104 (1987) pp. 273–337], based on earlier work by Sobol’ [Zh. Vychisl Mat. i mat. Fiz, Vol. 7 (1967) pp. 784–802], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in combinatorial/coding theoretic terms a binary linear (m−k,m,s)₂-net is a family of ks vectors in F₂^m satisfying certain linear independence conditions (s is the length, m the dimension and k the strength: certain subsets of k vectors must be linearly independent). Helleseth et al. [5] recently constructed (2r−3,2r+2,2^r−1)₂-nets for every r. In this paper, we give a direct and elementary construction for (2r−3,2r+2,2^r+1)₂-nets based on a family of binary linear codes of minimum distance 6.Communicated by: T. Helleseth     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

On the directions problem in <Emphasis Type="Italic">AG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We prove that if q = p ^h , p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q ^k and 1 < k < n, determining N directions where

Optimal (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">n</Emphasis>) visual cryptographic schemes for general <Emphasis Type="Italic">k</Emphasis>

In (k, n) visual cryptographic schemes (VCS), a secret image is encrypted into n pages of cipher text, each printed on a transparency sheet, which are distributed among n participants. The image can be visually decoded if any k(≥2) of these sheets are stacked on top of one another, while this is not possible by stacking any k − 1 or fewer sheets. We employ a Kronecker algebra to obtain necessary and sufficient conditions for the existence of a (k, n) VCS with a prior specification of relative contrasts that quantify the clarity of the recovered image. The connection of these conditions with an L ₁-norm formulation as well as a convenient linear programming formulation is explored. These are employed to settle certain conjectures on contrast optimal VCS for the cases k = 4 and 5. Furthermore, for k = 3, we show how block designs can be used to construct VCS which achieve optimality with respect to the average and minimum relative contrasts but require much smaller pixel expansions than the existing ones.     

<Emphasis Type="Italic">X</Emphasis>-decomposable finite groups for <Emphasis Type="Italic">X</Emphasis>={1, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">m</Emphasis> + 1, <Emphasis Type="Italic">m</Emphasis> + 2}

A normal subgroup N of a finite group G is called n-decomposable in G if N is the union of n distinct G-conjugacy classes. We study the structure of nonperfect groups in which every proper nontrivial normal subgroup is m-decomposable, m+1-decomposable, or m+2-decomposable for some positive integer m. Furthermore, we give classification for the soluble case.     

On (<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">m</Emphasis>)-semigroups

We generalize Green’s lemma and Green’s theorem for usual binary semigroups to (n,m)-semigroups, define and describe the regularity for an element of an (n,m)-semigroup, give some criteria for an element of an (n,m)-semigroup to be invertible, and further apply the invertibility for (n,m)-semigroups to (n,m)-groups and give some equivalent characterizations for (n,m)-groups. We establish Hosszú-Gluskin theorems for (n,m)-semigroups in two cases, as generalizations of the corresponding theorems for n-groups.     

Cubic and higher degree bounds for codes and (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">s</Emphasis>)-nets

The Plotkin bound and the quadratic bound for codes and (t, m, s)-nets can be obtained from the linear programming bound using certain linear and quadratic polynomials, respectively. We extend this approach by considering cubic and higher degree polynomials to find new explicit bounds as well as new non-existence results for codes and (t, m, s)-nets.     

Continuous <Emphasis Type="Italic">l</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">p</Emphasis></Subscript>-symmetric distributions

For p > 0, the l _n,p -generalized surface measure on the l _n,p -unit sphere is studied and used for deriving a geometric measure representation for l _n,p -symmetric distributions having a density.     

Rate of convergence to stationarity of the system <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">N</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">R</Emphasis>

We consider the M/M/N/N+R service system, characterized by N servers, R waiting positions, Poisson arrivals and exponential service times. We discuss representations and bounds for the rate of convergence to stationarity of the number of customers in the system, and study its behaviour as a function of R, N and the arrival rate λ, allowing λ to be a function of N.     

Facets of the <Emphasis Type="Italic">r</Emphasis>-Stable (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-Hypersimplex

Let k, n, and r be positive integers with k < n and \({r \leq \lfloor \frac{n}{k} \rfloor}\). We determine the facets of the r-stable n, k-hypersimplex. As a result, it turns out that the r-stable n, k-hypersimplex has exactly 2n facets for every \({r < \lfloor \frac{n}{k} \rfloor}\). We then utilize the equations of the facets to study when the r-stable hypersimplex is Gorenstein. For every k > 0 we identify an infinite collection of Gorenstein r-stable hypersimplices, consequently expanding the collection of r-stable hypersimplices known to have unimodal Ehrhart \({\delta}\)-vectors.     

On the Diophantine Queueing System, <Emphasis Type="Italic">D/D</Emphasis><Superscript><Emphasis Type="Italic">a,b</Emphasis></Superscript><Emphasis Type="Italic">/</Emphasis>1

This paper considers the solution of a deterministic queueing system. In this system, the single server provides service in bulk with a threshold for the acceptance of customers into service. Analytic results are given for the steady-state probabilities of the number of customers in the system and in the queue for random and pre-arrival epochs. The solution of this system is a prerequisite to a four-point approximation to the model GI/G ^a,b /1. The paper demonstrates that the solution of such a system is not a trivial problem and can produce interesting results. The graphical solution discussed in the literature requires that the traffic intensity be a rational number. The results so generated may be misleading in practice when a control policy is imposed, even when the probability distributions for the interarrival and service times are both deterministic.     

Further Results for the Queueing System <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis>

For the multi-channel bulk-arrival queue, M ^x /M/c, Abol'nikov and Kabak independently obtained steady state results. In this paper the results of these authors are extended, corrected and simplified. A number of measures of efficiency are calculated for three cases where the arrival group size has: (i) a constant value, (ii) a geometric distribution, or (iii) a positive Poisson distribution. The paper also shows how to calculate fractiles for both the queue length and the waiting time distribution. Examples of extensive numerical results for certain measures of efficiency are presented in tabular and chart form.     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

Eigenvalues of the Manifold Sp（n）/U（n）

In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ _s (f ₂, f ₂, …, f _n ) of the Lie group Sp(n), corresponding to the representation with label (f ₁, f ₂, ..., f _n ), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f ₁, f ₂, …, f _n are all even.     

Distance-Regular Shilla Graphs with <Emphasis Type="Italic">b</Emphasis><Subscript>2</Subscript> = <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript>

A Shilla graph is defined as a distance-regular graph of diameter 3 with second eigen-value θ₁ equal to a₃. For a Shilla graph, let us put a = a₃ and b = k/a. It is proved in this paper that a Shilla graph with b₂ = c₂ and noninteger eigenvalues has the following intersection array:

$$\left\{ {\frac{{{b^2}\left( {b - 1} \right)}}{2},\frac{{\left( {b - 1} \right)\left( {{b^2} - b + 2} \right)}}{2},\frac{{b\left( {b - 1} \right)}}{4};1,\frac{{b\left( {b - 1} \right)}}{4},\frac{{b{{\left( {b - 1} \right)}^2}}}{2}} \right\}$$

If Γ is a Q-polynomial Shilla graph with b₂ = c₂ and b = 2r, then the graph Γ has intersection array

$$\left\{ {2tr\left( {2r + 1} \right),\left( {2r + 1} \right)\left( {2rt + t + 1} \right),r\left( {r + t} \right);1,r\left( {r + t} \right),t\left( {4{r^2} - 1} \right)} \right\}$$

and, for any vertex u in Γ, the subgraph Γ₃(u) is an antipodal distance-regular graph with intersection array

$$\left\{ {t\left( {2r + 1} \right),\left( {2r - 1} \right)\left( {t + 1} \right),1;1,t + 1,t\left( {2r + 1} \right)} \right\}$$

The Shilla graphs with b₂ = c₂ and b = 4 are also classified in the paper.

     

On list incidentor (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">l</Emphasis>)-coloring

A proper incidentor coloring is called a (k, l)-coloring if the difference between the colors of the final and initial incidentors ranges between k and l. In the list variant, the extra restriction is added: the color of each incidentor must belong to the set of admissible colors of the arc. In order to make this restriction reasonable we assume that the set of admissible colors for each arc is an integer interval. The minimum length of the interval that guarantees the existence of a list incidentor (k, l)-coloring is called a list incidentor (k, l)-chromatic number. Some bounds for the list incidentor (k, l)-chromatic number are proved for multigraphs of degree 2 and 4.     

The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1+<Emphasis Type="Italic">G</Emphasis> queue revisited

We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balks or reneges when its virtual waiting time, i.e., the amount of work seen upon arrival, is larger than a certain random patience time. We consider the number of customers in the system, the maximum workload during a busy period, and the length of a busy period. We also briefly treat the analogous model in which any customer enters the system and leaves at the end of his patience time or at the end of his virtual sojourn time, whichever occurs first.