<Emphasis Type="Italic">∂</Emphasis>-operations and <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">V</Emphasis></Subscript>-fields

The hyperoperations, called theta-operations （δ）, are motivated from the usual property, which the derivative has on the derivation of a product of functions. Using any map on a set, one can define δ-operations. In this paper, we continue our study on the δ-operations on groupoids, rings, fields and vector spaces or on the corresponding hyperstructures. Using δ-operations one obtains, mainly, Hwstructures, which form the largest class of the hyperstructures. For representation theory of hyperstructures, by hypermatrices, one needs special Hv-rings or Hy-fields, so these hyperstructures can be used. Moreover, we study the relation of these δ-structures with other classes of hyperstructures, especially with the Hv-structures.     

辛空间的排列问题及具有容错能力的pooling设计的紧界

该文利用辛空间上的子空间构造了一类新的d ^z析取矩阵,然后研究了如下排列问题：对于给定的整数m, r, s,ν, d, q 和辛空间F^2ν _q中的一个(m, s) 型子空间S, 这里ν+s≥ m>r≥2s-1≥1, d≥2,q 是一个素数的幂, 作者从S中找到d个(m-1, s-1) 型子空间H₁,… H_d, 使包含在这些(m-1, s-1) 型子空间中的(r, s-1)型子空间个数达到最大. 然后利用这个排列的有关结论, 给出了一类pooling设计的紧界.     

Polynomial Approximation of Conformal Maps

Let G be a finite domain, bounded by a Jordan curve Γ , and let f ₀ be a conformal map of G onto the unit disk. We are interested in the best rate of uniform convergence of polynomial approximation to f ₀ , in the case that Γ is piecewise-analytic without cusps. In particular, we consider the problem of approximating f ₀ by the Bieberbach polynomials π _n and derive results better than those in [5] and [6] for the case that the corners of Γ have interior angles of the form π/N . In the proof, the Lehman formulas for the asymptotic expansion of mapping functions near analytic corners are used. We study the question when these expansions contain logarithmic terms. December 6, 1995. Date revised: August 5, 1996.     

Double Hopf bifurcation and chaos in Liu system with delayed feedback

In this paper, we consider the stability of equilibria,&nbsp;Hopf and&nbsp;double Hopf bifurcation in Liu system with delay&nbsp;feedback. Firstly,&nbsp;we identify the critical values for stability switches and&nbsp;Hopf&nbsp;bifurcationusing the method of bifurcation&nbsp;analysis. When we choose&nbsp;appropriate feedback strength and delay, two symmetrical nontrivial&nbsp;equilibria of Liusystem can be controlled to be stable at the same&nbsp;time, and the stable bifurcating periodic solutions occur in the&nbsp;neighborhood of the two equilibria at the same time. Secondly, by&nbsp;applying the normal form method and center manifold theory,the&nbsp;normal form near the double Hopf bifurcation, as well as&nbsp;classifications of local dynamics are analyzed. Furthermore, we give&nbsp;the bifurcation diagram to illustrate numerically that a family of&nbsp;stable periodic solutions bifurcated from Hopf bifurcation occur in&nbsp;a large region of delay and the Liu system with delay can appear the&nbsp;phenomenon of ``chaos switchover''.     

Normal Spreads

In Dedicata 16 (1984), pp. 291–313, the representation of Desarguesian spreads of the projective space PG(2t – 1, q) into the Grassmannian of the subspaces of rank t of PG(2t – 1, q) has been studied. Using a similar idea, we prove here that a normal spread of PG(rt – 1,q) is represented on the Grassmannian of the subspaces of rank t of PG(rt – 1, q) by a cap V _{r, t} of PG(r ^t – 1, q), which is the GF(q)-scroll of a Segre variety product of t projective spaces of dimension (r – 1), and that the collineation group of PG(r ^t – 1, q) stabilizing V _{r, t} acts 2-transitively on V _{r, t} . In particular, we prove that V _{3, 2} is the union of q ² – q + 1 disjoint Veronese surfaces, and that a Hermitan curve of PG(2, q ²) is represented by a hyperplane section U of V _{3, 2}. For q 0,2 (mod 3) the algebraic variety U is the unitary ovoid of the hyperbolic quadric Q ⁺ (7, q) constructed by W. M. Kantor in Canad. J. Math., 5 (1982), 1195–1207. Finally we study a class of blocking sets, called linear, proving that many of the known examples of blocking sets are of this type, and we construct an example in PG(3, q ²). Moreover, a new example of minimal blocking set of the Desarguesian projective plane, which is linear, has been constructed by P. Polito and O. Polverino.     

Factoring and decomposing a class of linear functional systems

Within a constructive homological algebra approach, we study the factorization and decomposition problems for a class of linear functional (determined, over-determined, under-determined) systems. Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we first concentrate on the computation of morphisms from a finitely presented left module M over an Ore algebra to another one M′, where M (resp., M′) is a module intrinsically associated with the linear functional system Ry = 0 (resp., R′z = 0). These morphisms define applications sending solutions of the system R′z = 0 to solutions of R y = 0. We explicitly characterize the kernel, image, cokernel and coimage of a general morphism. We then show that the existence of a non-injective endomorphism of the module M is equivalent to the existence of a non-trivial factorization R = R₂R₁ of the system matrix R. The corresponding system can then be integrated “in cascade”. Under certain conditions, we also show that the system Ry = 0 is equivalent to a system R′z = 0, where R′ is a block-triangular matrix of the same size as R. We show that the existence of idempotents of the endomorphism ring of the module M allows us to reduce the integration of the system Ry = 0 to the integration of two independent systems R₁y₁ = 0 and R₂y₂ = 0. Furthermore, we prove that, under certain conditions, idempotents provide decompositions of the system Ry = 0, i.e., they allow us to compute an equivalent system R′z = 0, where R′ is a block-diagonal matrix of the same size as R. Applications of these results in mathematical physics and control theory are given. Finally, the different algorithms of the paper are implemented in the Maple package Morphisms based on the library oremodules.     

A dynamic adaptive local search algorithm for the circular packing problem

This paper studies the circular packing problem (CPP) which consists of packing n non-identical circles C_i of known radius r_i, i ∈ N = {1, … , n}, into the smallest containing circle C. The objective is to determine the coordinates (x_i, y_i) of the center of C_i, i ∈ N, as well as the radius r and center (x, y) of C. This problem, which is a variant of the two-dimensional open dimension problem, is solved using a two-step, dynamic, adaptive, local search algorithm. At each iteration, the algorithm identifies the set of potential “best local positions” of a circle C_i, i ∈ N, given the positions of the previously packed circles, and determines for each of these positions the coordinates and radius of the smallest containing circle. The “best local position” minimizes the radius of the current containing circle. That is, every time an additional circle is packed, both the center and the radius of the containing circle are dynamically updated, and the smallest containing circle is known. The experimental results reflect the good performance of the algorithm.     

Algebraic properties of Manin matrices 1

We study a class of matrices with noncommutative entries, which were first considered by Yu.I. Manin in 1988 in relation with quantum group theory. They are defined as “noncommutative endomorphisms” of a polynomial algebra. More explicitly their defining conditions read: (1) elements in the same column commute; (2) commutators of the cross terms are equal: [M_ij,M_kl]=[M_kj,M_il] (e.g. [M₁₁,M₂₂]=[M₂₁,M₁₂]). The basic claim is that despite noncommutativity many theorems of linear algebra hold true for Manin matrices in a form identical to that of the commutative case. Moreover in some examples the converse is also true, that is, Manin matrices are the most general class of matrices such that linear algebra holds true for them. The present paper gives a complete list and detailed proofs of algebraic properties of Manin matrices known up to the moment; many of them are new. In particular we provide complete proofs that an inverse to a Manin matrix is again a Manin matrix and for the Schur formula for the determinant of a block matrix; we generalize the noncommutative Cauchy–Binet formulas discovered recently arXiv:0809.3516, which includes the classical Capelli and related identities. We also discuss many other properties, such as the Cramer formula for the inverse matrix, the Cayley–Hamilton theorem, Newton and MacMahon–Wronski identities, Plücker relations, Sylvester's theorem, the Lagrange–Desnanot–Lewis Carroll formula, the Weinstein–Aronszajn formula, some multiplicativity properties for the determinant, relations with quasideterminants, calculation of the determinant via Gauss decomposition, conjugation to the second normal (Frobenius) form, and so on and so forth. Finally several examples and open question are discussed. We refer to [A. Chervov, G. Falqui, Manin matrices and Talalaev's formula, J. Phys. A 41 (2008) 194006; V. Rubtsov, A. Silantiev, D. Talalaev, Manin matrices, elliptic commuting families and characteristic polynomial of quantum gl_n elliptic Gaudin model, in press] for some applications in the realm of quantum integrable systems.     

Extensions and biextensions of locally constant group schemes,tori and abelian schemes

Let S be a scheme. We compute explicitly the group of homomorphisms, the S-sheaf of homomorphisms, the group of extensions, and the S-sheaf of extensions involving locally constant S-group schemes, abelian S-schemes, and S-tori. Using the obtained results, we study the categories of biextensions involving these geometrical objects. In particular, we prove that if G _i (for i = 1, 2, 3) is an extension of an abelian S-scheme A _i by an S-torus T _i , the category of biextensions of (G ₁, G ₂) by G ₃ is equivalent to the category of biextensions of the underlying abelian S-schemes (A ₁, A ₂) by the underlying S-torus T ₃.      

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants

Laurent Padé-Chebyshev rational approximants,A _m (z,z ⁻¹)/B _n (z, z ⁻¹), whose Laurent series expansions match that of a given functionf(z,z ⁻¹) up to as high a degree inz, z ⁻¹ as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients off up to degreem+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions betweenf(z,z ⁻¹)B _n (z, z ⁻¹)). The derivation was relatively simple but required knowledge of Chebyshev coefficients off up to degreem+2n. In the present paper, Padé-Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé-Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m, n) Padé-Chebyshev approximant, of degreem in the numerator andn in the denominator, is matched to the Chebyshev series up to terms of degreem+n, based on knowledge of the Chebyshev coefficients up to degreem+2n. Numerical tests are carried out on all four Padé-Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent-Chebyshev series on a variety of functions. In part II of this paper [7] Padé-Chebyshev approximants of Clenshaw-Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

A lowest order divergence-free finite element on rectangular grids

It is shown that the conforming Q _2,1;1,2-Q′₁ mixed element is stable, and provides optimal order of approximation for the Stokes equations on rectangular grids. Here, Q _2,1;1,2 = Q _2,1 × Q _1,2, and Q _2,1 denotes the space of continuous piecewise-polynomials of degree 2 or less in the x direction but of degree 1 in the y direction. Q′₁ is the space of discontinuous bilinear polynomials, with spurious modes filtered. To be precise, Q′₁ is the divergence of the discrete velocity space Q _2,1;1,2. Therefore, the resulting finite element solution for the velocity is divergence-free pointwise, when solving the Stokes equations. This element is the lowest order one in a family of divergence-free element, similar to the families of the Bernardi-Raugel element and the Raviart-Thomas element.     

On a class of equilibrium problems in the real axis

In a series of seminal papers, Thomas J. Stieltjes (1856-1894) gave an elegant electrostatic interpretation for the zeros of classical families of orthogonal polynomials, such as Jacobi, Hermite and Laguerre polynomials. More generally, he extended this approach to the zeros of polynomial solutions of certain second-order linear differential equations (Lamé equations), the so-called Heine-Stieltjes polynomials.In this paper, a class of electrostatic equilibrium problems in R, where the free unit charges x₁,…,x_n∈R are in presence of a finite family of “attractors” (i.e., negative charges) z₁,…,z_m∈C?R, is considered and its connection with certain class of Lamé-type equations is shown. In addition, we study the situation when both n→∞ and m→∞, by analyzing the corresponding (continuous) equilibrium problem in presence of a certain class of external fields.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

The local spectra of regular line graphs

The local spectrum of a graph G=(V,E), constituted by the standard eigenvalues of G and their local multiplicities, plays a similar role as the global spectrum when the graph is “seen” from a given vertex. Thus, for each vertex i∈V, the i-local multiplicities of all the eigenvalues add up to 1; whereas the multiplicity of each eigenvalue λ of G is the sum, extended to all vertices, of its local multiplicities.In this work, using the interpretation of an eigenvector as a charge distribution on the vertices, we compute the local spectrum of the line graph LG in terms of the local spectrum of the regular graph G it derives from. Furthermore, some applications of this result are derived as, for instance, some results about the number of circuits of LG.     

Block-Coordinate Gradient Descent Method for?Linearly Constrained Nonsmooth Separable Optimization

We consider the problem of minimizing the weighted sum of a smooth function f and a convex function P of n real variables subject to m linear equality constraints. We propose a block-coordinate gradient descent method for solving this problem, with the coordinate block chosen by a Gauss-Southwell-q rule based on sufficient predicted descent. We establish global convergence to first-order stationarity for this method and, under a local error bound assumption, linear rate of convergence. If f is convex with Lipschitz continuous gradient, then the method terminates in O(n ²/ε) iterations with an ε-optimal solution. If P is separable, then the Gauss-Southwell-q rule is implementable in O(n) operations when m=1 and in O(n ²) operations when m>1. In the special case of support vector machines training, for which f is convex quadratic, P is separable, and m=1, this complexity bound is comparable to the best known bound for decomposition methods. If f is convex, then, by gradually reducing the weight on P to zero, the method can be adapted to solve the bilevel problem of minimizing P over the set of minima of f+δ _X , where X denotes the closure of the feasible set. This has application in the least 1-norm solution of maximum-likelihood estimation. This research was supported by the National Science Foundation, Grant No. DMS-0511283.     

On the security analysis of an image scrambling encryption of pixel bit and its improved scheme based on self-correlation encryption

An image scrambling encryption scheme for pixel bits was presented by Ye [Ye GD. Image scrambling encryption algorithm of pixel bit based on chaos map. Pattern Recognit Lett 2010;31:347-54], which can be seen as one kind of typical binary image scrambling encryption considering from the bit-plain of size M × (8N). However, recently, some defects existing in the original image encryption scheme, i.e., Ye’s scheme, have been observed by Li and Lo [Li CQ, Lo KT. Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks. Signal Process 2011;91:949-54]. In the attack proposed by Li and Lo at least 3 + ⌈log₂(MN)⌉ plain images of size M × N are used to reveal the permutation matrix W = [w(i, k)] (i ∈ {1, 2, … , M}; k ∈ {1, 2, … , 8N}) which can be applied to recover the exact plain image. In the current paper, at first, one type of special plain image/cipher image is used to analyze the security weakness of the original image scrambling scheme under study. The final encryption vectors TM and TN or the decryption vectors TM′ and TN′ are revealed completely according to our attack. To demonstrate the performance of our attack, a quantified comparison is drawn between our attack and the attack proposed by Li and Lo. Compared with Li and Lo’s attack, our attack is more efficient in the general conditions. In particular, when the sizes of images satisfy the condition M = N or M ? 8N, the number of the used plain images/cipher images is at most 9, which is sharply less than 3 + ⌈log₂(MN)⌉ when M and N are of large size. To overcome the weaknesses of the original scheme, in this paper, an improved image scrambling encryption scheme is proposed. In the improved scheme, the idea of the “self-correlation” method is used to resist the chosen-plaintext attack/known-plaintext attack. The corresponding simulations and analyses illustrate that the improved encryption method has good cryptographic properties, and can overcome the weakness of the original image encryption scheme. Finally, farther improvement is briefly presented for the future work.     

Classification of Simple C-Algebras: Inductive Limits of Matrix Algebras Over One-Dimensional Spaces

In this article, we will give a complete classification of simple C^*-algebras which can be written as inductive limits of algebras of the form A_n=⊕_i=1^k_nM_[n,i](C(X_n,i)), where X_n,i are arbitrary variable one-dimensional compact metrizable spaces. The results unify and generalize the previous results for the case X_n,i=S¹ and for the case of X_n,i being trees. We obtain our classification results by reducing the case of general one-dimensional spaces to the case of circles. The techniques in this paper play important roles in the study of the case of higher-dimensional spaces.     

The Tropical Totally Positive Grassmannian

Tropical algebraic geometry is the geometry of the tropical semiring (ℝ, min, +). The theory of total positivity is a natural generalization of the study of matrices with all minors positive. In this paper we introduce the totally positive part of the tropicalization of an arbitrary affine variety, an object which has the structure of a polyhedral fan. We then investigate the case of the Grassmannian, denoting the resulting fan Trop⁺ Gr_k,n. We show that Trop⁺ Gr_2,n is the Stanley-Pitman fan, which is combinatorially the fan dual to the (type A_n−3) associahedron, and that Trop⁺ Gr_3,6 and Trop⁺ Gr_3,7 are closely related to the fans dual to the types D₄ and E₆ associahedra. These results are strikingly reminiscent of the results of Fomin and Zelevinsky, and Scott, who showed that the Grassmannian has a natural cluster algebra structure which is of types A_n−3, D₄, and E₆ for Gr_2,n, Gr_3,6, and Gr_3,7. We suggest a general conjecture about the positive part of the tropicalization of a cluster algebra.     

Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub‐tournaments

Ao and Hanson, and Guiduli, Gyárfás, Thomassé and Weidl independently, proved the following result: For any tournament score sequence S = (s₁, s₂, … ,s_n) with s₁≤s₂ ≤ … ≤ s_n, there exists a tournament T on vertex set {1,2, …, n} such that the score of each vertex i is s_i and the sub‐tournaments of T on both the even and the odd indexed vertices are transitive in the given order; that is, i dominates j whenever i > j and i ≡ j (mod 2). In this note, we give a much shorter proof of the result. In the course of doing so, we show that the score sequence of a tournament satisfies a set of inequalities which are individually stronger than the well‐known set of inequalities of Landau, but collectively the two sets of inequalities are equivalent. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 244–254, 2001     

A sufficient condition for the existence of a “dead zone” for solutions of degenerate semilinear parabolic equations and inequalities

We consider the solutions of degenerate parabolic equations and inequalities of the formLu-u _t = |u| ^q sgnu and sgnu(Lu−u _t )−|u| ^q ≥0, 0<q<1, with the elliptic operatorL in divergent or nondivergent form. We establish a dependence of the maximum modulus of the solution on the domain and on the equation (inequality) such that this dependence guarantees the existence of a “dead zone” of the solution. In this case, the character of degeneracy is unessential. Translated fromMatematicheskie Zametki, Vol. 60, No. 6, pp. 824–831, December, 1996.