Relations between threshold and <Emphasis Type="Italic">k</Emphasis>-interval Boolean functions

Every k-interval Boolean function f can be represented by at most k intervals of integers such that vector x is a truepoint of f if and only if the integer represented by x belongs to one of these k (disjoint) intervals. Since the correspondence of Boolean vectors and integers depends on the order of bits an interval representation is also specified with respect to an order of variables of the represented function. Interval representation can be useful as an efficient representation for special classes of Boolean functions which can be represented by a small number of intervals. In this paper we study inclusion relations between the classes of threshold and k-interval Boolean functions. We show that positive 2-interval functions constitute a (proper) subclass of positive threshold functions and that such inclusion does not hold for any k>2. We also prove that threshold functions do not constitute a subclass of k-interval functions, for any k.     

<Emphasis Type="Italic">l</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis>,<Emphasis Type="Italic">s</Emphasis></Superscript>-Singular values and spectral radius of partially symmetric rectangular tensors

The real rectangular tensors arise from the strong ellipticity condition problem in solid mechanics and the entanglement problem in quantum physics. In this paper, we first study properties of l ^k,s -singular values of real rectangular tensors. Then, a necessary and sufficient condition for the positive definiteness of partially symmetric rectangular tensors is given. Furthermore, we show that the weak Perron-Frobenius theorem for nonnegative partially symmetric rectangular tensor keeps valid under some new conditions and we prove a maximum property for the largest l ^k,s -singular values of nonnegative partially symmetric rectangular tensor. Finally, we prove that the largest l ^k,s -singular value of nonnegative weakly irreducible partially symmetric rectangular tensor is still geometrically simple.     

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.     

On <Emphasis Type="Italic">k</Emphasis>- critical 2<Emphasis Type="Italic">k</Emphasis>- connected graphs

A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ? V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K_2k+2?(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3,4. We prove the conjecture for the general case k ≥ 5.     

<Emphasis Type="Italic">W</Emphasis><Superscript>1,<Emphasis Type="Italic">p</Emphasis></Superscript>(R<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)-boundedness for maximal functions

In this paper, we get W ^1,p (R ⁿ )-boundedness for tangential maximal function and nontangential maximal function, which improves J.Kinnunen, P.Lindqvist and Tananka’s results. Supported by the key Academic Discipline of Zhejiang Province of China under Grant No.2005 and the Zhejiang Provincial Natural Science Foundation of China.     

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.     

<Emphasis Type="Italic">K</Emphasis>-homology of <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">*</Emphasis></Superscript>-categories and symmetric spectra representing <Emphasis Type="Italic">K</Emphasis>-homology

We define K-homology groups K _* () for small C ^* -categories in terms of Hilbert modules over the C ^* -category . We also define a functor A ^f from the category of small C ^* -categories into the category of C ^* -algebras and show that there is a natural isomorphism . In addition, we give an easy construction of a functor from the category of C ^* -algebras into the category of symmetric spectra which represents K-homology, i.e. we show that the functor comes with a natural isomorphism for C ^* -algebras A. It then follows that the composition A ^f provides a functor that can be used in the Davis-Lück approach for constructing the Baum-Connes map.     

Remarks on the <Emphasis Type="Italic">k</Emphasis>-error linear complexity of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>-periodic sequences

Recently the first author presented exact formulas for the number of 2 ⁿ -periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2 ⁿ -periodic binary sequence. A crucial role for the analysis played the Chan–Games algorithm. We use a more sophisticated generalization of the Chan–Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for p ⁿ -periodic sequences over prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of p ⁿ -periodic sequences over .      

LP（Rn）-Boundedness of certain commutators

In this paper, the Lp(Rn)-boundedness of the commutators generalized by BMO(Rn) function and the singular integral operator T with rough kernel Ω∈ Llog+ L(Sn-1) is proved by using the Bony's formula for the paraproduct of two functions.     

The <Emphasis Type="Italic">p</Emphasis>-Adic order of the <Emphasis Type="Italic">k</Emphasis>-Fibonacci and <Emphasis Type="Italic">k</Emphasis>-Lucas numbers

Let (F _k,n ) _n and (L _k,n )n be the k-Fibonacci and k-Lucas sequence, respectively, which satisfies the same recursive relation a _n+1 = ka _n + a _n?1 with initial values F _k,0 = 0, F _k,1 = 1, L _k,0 = 2 and L _k,1 = k. In this paper, we characterize the p-adic orders ν _p (F _k,n ) and ν _p (L _k,n ) for all primes p and all positive integers k.     

Compact embedded rotation hypersurfaces of <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis>+1</Superscript>

In this paper, we prove that and round geodesic spheres are the only n-dimensional compact embedded rotation hypersurfaces with H_m = 0 (1 ≤ m ≤ n − 1) in a unit sphere Sⁿ⁺¹(1). When m = 1, our result reduces to the result of T. Otsuki [O1], [O2], Brito and Leite [BL]. The project is supported by the grant No. 10531090 of NSFC.     

Global -homotopy with <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript> estimates for a family of compact,regular <Emphasis Type="Italic">q</Emphasis>-pseudoconcave CR manifolds

Let M₀ be a compact, regular q-pseudoconcave CR submanifold of a complex manifold G and - a holomorphic vector bundle on G such that dim for some fixed r<q. We prove a global homotopy formula with C^k estimates for r-cohomology of on arbitrary CR submanifold M close enough to M₀.Mathematics Subject Classification (2000):32F20, 32F10in final form: 15 October 2003     

Some inequalities for <Emphasis Type="Italic">k</Emphasis>-colored partition functions

Motivated by a partition inequality of Bessenrodt and Ono, we obtain analogous inequalities for k-colored partition functions \(p_{-k}(n)\) for all \(k\ge 2\). This enables us to extend the k-colored partition function multiplicatively to a function on k-colored partitions and characterize when it has a unique maximum. We conclude with one conjectural inequality that strengthens our results.     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

<Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">c</Emphasis> Queue with catastrophes and state-dependent control at idle time

We consider an M ^X /M/c queue with catastrophes and state-dependent control at idle time. Properties of the queues which terminate when the servers become idle are first studied. Recurrence, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no catastrophes. All of these properties and the first effective catastrophe occurrence time are then investigated for the case of resurrection and catastrophes. In particular, we obtain the Laplace transform of the transition probability for the absorbing M ^X /M/c queue.     

On the outcome of false images of linear <Emphasis Type="Italic">k</Emphasis>-valued functions for composite numbers <Emphasis Type="Italic">k</Emphasis> when the number of variables increases

The problem of constructing discrete functions such that parts of their value sets determine (generate) arbitrary linear functions is considered. A case in which k is a prime number was considered earlier by the author. It is proved that the existence of such partial functions wshen the number of independent variables is no less then two implies they exists for any arbitrary greater number of independent variables. Upper estimates linear with respect to the number of independent variables are proved for the size of the domain of universal functions. The existence of two-variable universal functions is proved for sufficiently large k.     

The existence of global attractors for 2D Navier-Stokes equations in <Emphasis Type="Italic">H</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript> spaces

In this paper, we prove that the 2D Navier-Stokes equations possess a global attractor in Hk（Ω,R2） for any k ≥ 1, which attracts any bounded set of Hk（Ω,R2） in the H^k-norm. The result is established by means of an iteration technique and regularity estimates for the linear semigroup of operator, together with a classical existence theorem of global attractor. This extends Ma, Wang and Zhong＇s conclusion.     

<Emphasis Type="Italic">k</Emphasis>-Free-like groups

The following results are proved. In Theorem 1, it is stated that there exist both finitely presented and not finitely presented 2-generated nonfree groups which are k-free-like for any k ⩾ 2. In Theorem 2, it is claimed that every nonvirtually cyclic (resp., noncyclic and torsion-free) hyperbolic m-generated group is k-free-like for every k ⩾ m + 1 (resp., k ⩾ m). Finally, Theorem 3 asserts that there exists a 2-generated periodic group G which is k-free-like for every k ⩾ 3. Supported by NSF (grant Nos. DMS 0455881 and DMS-0700811). (A. Yu. Olshanskii, M. V. Sapir) Supported by RFBR project No. 08-01-00573. (A. Yu. Olshanskii) Supported by BSF grant (USA–Israel). (M. V. Sapir) Translated from Algebra i Logika, Vol. 48, No. 2, pp. 245–257, March–April, 2009.     

On the <Emphasis Type="Italic">k</Emphasis>-gamma <Emphasis Type="Italic">q</Emphasis>-distribution

We provide combinatorial as well as probabilistic interpretations for the q-analogue of the Pochhammer k-symbol introduced by Díaz and Teruel. We introduce q-analogues of the Mellin transform in order to study the q-analogue of the k-gamma distribution.