On the algebraic structure of Abelian integrals for a kind of perturbed cubic Hamiltonian systems

The finite generators of Abelian integral are obtained, where Γh is a family of closed ovals defined by H(x,y)=x²+y²+ax⁴+bx²y²+cy⁴=h, h∈Σ, ac(4ac−b²)≠0, Σ=(0,h₁) is the open interval on which Γh is defined, f(x,y), g(x,y) are real polynomials in x and y with degree 2n+1 (n?2). And an upper bound of the number of zeros of Abelian integral I(h) is given by its algebraic structure for a special case a>0, b=0, c=1.     

Conjugate connections and Radon's theorem in affine differential geometry

For a given nondegenerate hypersurfaceM ⁿ in affine space ? ⁿ⁺¹ there exist an affine connection ?, called the induced connection, and a nondegenerate metrich, called the affine metric, which are uniquely determined. The cubic formC=?h is totally symmetric and satisfies the so-called apolarity condition relative toh. A natural question is, conversely, given an affine connection ? and a nondegenerate metrich on a differentiable manifoldM ⁿ such that ?h is totally symmetric and satisfies the apolarity condition relative toh, canM ⁿ be locally immersed in ? ⁿ⁺¹ in such a way that (?,h) is realized as the induced structure? In 1918J. Radon gave a necessary and sufficient condition (somewhat complicated) for the problem in the casen=2. The purpose of the present paper is to give a necessary and sufficient condition for the problem in casesn=2 andn≥3 in terms of the curvature tensorR of the connection ?. We also provide another formulation valid for all dimensionsn: A necessary and sufficient condition for the realizability of (?,h) is that the conjugate connection of ? relative toh is projectively flat.     

Signal Analytic Proofs of Two Basic Results on Lattice Expansions

We present new and short proofs of two theorems in the theory of lattice expansions. These proofs are based on a necessary and sufficient condition, found by Wexler and Raz, for biorthogonality. The first theorem is the Lyubarskii–Seip–Wallstén theorem for lattices, according to which the set of Gaussians 2^1/4 exp(-π(t - na)² + 2πimbt), n, m , constitutes a frame when a > 0,b > 0,ab < 1. In addition, we display dual functions for this case. The second theorem is the result that a set g_na,mb(t) = g(t - na) exp(2πimbt), n, m of time–frequency translates of a g L²( ) cannot be a frame when a > 0,b > 0,ab > 1.     

Weakly separative weakly commutative semigroups

A semigroup S is called a weakly commutative semigroup if, for every a,b∈S, there is a positive integer n such that (ab) ⁿ ∈Sa∩bS. A semigroup S is called archimedean if, for every a,b∈S, there are positive integers m and n such that a ⁿ ∈SbS and b ^m ∈SaS. It is known that every weakly commutative semigroup is a semilattice of weakly commutative archimedean semigroups. A semigroup S is called a weakly separative semigroup if, for every a,b∈S, the assumption a ²=ab=b ² implies a=b. In this paper we show that a weakly commutative semigroup is weakly separative if and only if its archimedean components are weakly cancellative. This result is a generalization of Theorem 4.16 of Clifford and Preston (The Algebraic Theory of Semigroups, Am. Math. Soc., Providence, 1961).     

Reverse Order Law for the Group Inverse in Semigroups and Rings

In this paper, we provide equivalent conditions for the two-sided reverse order law for the group inverse (ab)^# = b ^# a ^# and (ba)^# = a ^# b ^#, in semigroups and rings. Moreover, we prove that, under finiteness conditions, these conditions are also equivalent with the one-sided reverse order law (ab)^# = b ^# a ^#.     

Conical Embeddings of Steiner systems

Any classicalS(3,2 ^a +1;2 ^ab +1) is embedded intoPG(2,2 ^ab ) as point set one may use any conic, the blocks being determined by subplanes of order 2 ^a . Consequently, every classicalS(3,2 ^a +1;2 ^ab +1) is naturally embedded intoPG(2,K) whereK is the algebraic closure ofGF(2).     

Realization of a sum of sequences by a sum graph

It is shown that the realizability of the sequences ϕ=(a ₁,…, _a ), ψ=(b ₁,…,b _n ) and ϕ+ψ is a sufficient condition for the realizability of ϕ+ψ by a graph with a ϕ-factor ifb _i ≦1 fori=1,…,n. The condition is not sufficient in general. A necessary and sufficient condition for the realizability of ϕ+ψ by a graph with a ϕ-factor is given for the case that ϕ is realizable by a star and isolated vertices.     

The hull and geodetic numbers of orientations of graphs

For an oriented graph D, let I_D[u,v] denote the set of all vertices lying on a u-v geodesic or a v-u geodesic. For S⊆V(D), let I_D[S] denote the union of all I_D[u,v] for all u,v∈S. Let [S]_D denote the smallest convex set containing S. The geodetic number g(D) of an oriented graph D is the minimum cardinality of a set S with I_D[S]=V(D) and the hull number h(D) of an oriented graph D is the minimum cardinality of a set S with [S]_D=V(D). For a connected graph G, let O(G) be the set of all orientations of G, define g⁻(G)=min{g(D):D∈O(G)}, g⁺(G)=max{g(D):D∈O(G)}, h⁻(G)=min{h(D):D∈O(G)}, and h⁺(G)=max{h(D):D∈O(G)}. By the above definitions, h⁻(G)≤g⁻(G) and h⁺(G)≤g⁺(G). In the paper, we prove that g⁻(G)<h⁺(G) for a connected graph G of order at least 3, and for any nonnegative integers a and b, there exists a connected graph G such that g⁻(G)−h⁻(G)=a and g⁺(G)−h⁺(G)=b. These results answer a problem of Farrugia in [A. Farrugia, Orientable convexity, geodetic and hull numbers in graphs, Discrete Appl. Math. 148 (2005) 256-262].     

Zero-Semidistributive Inverse Semigroups

An inverse semigroup S is said to be 0-semidistributive if its lattice ?F (S) of full inverse subsemigroups is 0-semidistributive. We show that it is sufficient to study simple inverse semigroups which are not groups. Our main theorem states that such a simple inverse semigroup S is 0-semidistributive if and only if (1) S is E-unitary, (2) S is aperiodic, (3) for any a,b ∈ S/σ with ab ≠ 1, there exist nonzero integers n and m such that (ab) ^m  = a ⁿ or (ab) ^m  = b ⁿ , where σ is the minimum group congruence on S.     

Oscillation of solutions of second-order nonlinear differential equations of Euler type

We consider the nonlinear Euler differential equation t²x^″+g(x)=0. Here g(x) satisfies xg(x)>0 for x≠0, but is not assumed to be sublinear or superlinear. We present implicit necessary and sufficient condition for all nontrivial solutions of this system to be oscillatory or nonoscillatory. Also we prove that solutions of this system are all oscillatory or all nonoscillatory and cannot be both. We derive explicit conditions and improve the results presented in the previous literature. We extend our results to the extended equation t²x^″+a(t)g(x)=0.     

Cubic Thue inequalities with negative discriminant

We give an upper bound for the solutions of the family of cubic Thue inequalities |x³+axy²+by³|?k when a is positive and larger than a certain value depending on b. For the case k=a+|b|+1 and a?360b⁴ we show that these inequalities have only trivial solutions. For the case k=a+|b|+1 and |b|=1,2, we solve these inequalities for all a?1. Our method is based on Padé approximations using Rickert's integrals. We also use a generalization of Legendre's theorem on continued fractions.     

On the asymptotic convergence factor of the total step method in interval computation

For a special class of n×n interval matrices A we derive a necessary and sufficient condition for the asymptotic convergence factor α of the total step method x^(m+1)=Ax^(m)+b to be less than the spectral radius ϱ(|A|) of the absolute value |A| of A.     

Spherical two-distance sets

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b so that the inner products of distinct vectors of S are either a or b. It is known that the largest cardinality g(n) of spherical two-distance sets does not exceed n(n+3)/2. This upper bound is known to be tight for n=2,6,22. The set of mid-points of the edges of a regular simplex gives the lower bound L(n)=n(n+1)/2 for g(n).In this paper using the so-called polynomial method it is proved that for nonnegative a+b the largest cardinality of S is not greater than L(n). For the case a+b<0 we propose upper bounds on |S| which are based on Delsarte's method. Using this we show that g(n)=L(n) for 6<n<22, 23<n<40, and g(23)=276 or 277.     

The forcing hull and forcing geodetic numbers of graphs

For every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. For a graph G, let I_G[u,v] denote the set of all vertices lying on a u-v geodesic. Let S⊆V(G) and I_G[S] denote the union of all I_G[u,v] for all u,v∈S. A subset S⊆V(G) is a convex set of G if I_G[S]=S. A convex hull [S]_G of S is a minimum convex set containing S. A subset S of V(G) is a hull set of G if [S]_G=V(G). The hull number h(G) of a graph G is the minimum cardinality of a hull set in G. A subset S of V(G) is a geodetic set if I_G[S]=V(G). The geodetic number g(G) of a graph G is the minimum cardinality of a geodetic set in G. A subset F⊆V(G) is called a forcing hull (or geodetic) subset of G if there exists a unique minimum hull (or geodetic) set containing F. The cardinality of a minimum forcing hull subset in G is called the forcing hull number f_h(G) of G and the cardinality of a minimum forcing geodetic subset in G is called the forcing geodetic number f_g(G) of G. In the paper, we construct some 2-connected graph G with (f_h(G),f_g(G))=(0,0),(1,0), or (0,1), and prove that, for any nonnegative integers a, b, and c with a+b≥2, there exists a 2-connected graph G with (f_h(G),f_g(G),h(G),g(G))=(a,b,a+b+c,a+2b+c) or (a,2a+b,a+b+c,2a+2b+c). These results confirm a conjecture of Chartrand and Zhang proposed in [G. Chartrand, P. Zhang, The forcing hull number of a graph, J. Combin. Math. Combin. Comput. 36 (2001) 81-94].     

On nonlinear diffusion problems with strong degeneracy

In this paper, we study the “triply” degenerate problem: bt(v)−Δg(v)+divΦ(v)=f on Q:=(0,T)×Ω, b(v(0,⋅))=b(v₀) on Ω and “g(v)=g(a) on some part of the boundary (0,T)×∂Ω,” in the case of continuous nonhomogeneous and nonstationary boundary data a. The functions b,g are assumed to be continuous, locally Lipschitz, nondecreasing and to verify the normalization condition b(0)=g(0)=0 and the range condition R(b+g)=R. Using monotonicity and penalization methods, we prove existence of a weak renormalized entropy solution in the spirit of [K. Ammar, J. Carrillo, P. Wittbold, Scalar conservation laws with general boundary condition and continuous flux function, J. Differential Equations 228 (2006) 111-139].     

The structure of rigid functions

A function f:R→R is called vertically rigid if graph(cf) is isometric to graph(f) for all c≠0. We prove Jankovi?'s conjecture by showing that a continuous function is vertically rigid if and only if it is of the form a+bx or a+bekx (a,b,k∈R). We answer the question of Cain, Clark and Rose by showing that there exists a Borel measurable vertically rigid function which is not of the above form. We discuss the Lebesgue and Baire measurable case, consider functions bounded on some interval and functions with at least one point of continuity. We also introduce horizontally rigid functions, and show that a certain structure theorem can be proved without assuming any regularity.     

On the decomposition of the Foulkes module

The Foulkes module ${H^{(a^b)}}$ is the permutation module for the symmetric group S _ab given by the action of S _ab on the collection of set partitions of a set of size ab into b sets each of size a. The main result of this paper is a sufficient condition for a simple ${\mathbb{C} S_{ab}}$ -module to have zero multiplicity in ${H^{(a^b)}}$ . A special case of this result implies that no Specht module labelled by a hook partition (ab ? r, 1 ^r ) with r ≥ 1 appears in ${H^{(a^b)}}$ .     

Large solutions for an elliptic system of quasilinear equations

In this paper we consider the quasilinear elliptic system Δpu=uavb, Δpv=ucve in a smooth bounded domain Ω⊂RN, with the boundary conditions u=v=+∞ on ∂Ω. The operator Δp stands for the p-Laplacian defined by Δpu=div(|∇u|^p−2∇u), p>1, and the exponents verify a,e>p−1, b,c>0 and (a−p+1)(e−p+1)?bc. We analyze positive solutions in both components, providing necessary and sufficient conditions for existence. We also prove uniqueness of positive solutions in the case (a−p+1)(e−p+1)>bc and obtain the exact blow-up rate near the boundary of the solution. In the case (a−p+1)(e−p+1)=bc, infinitely many positive solutions are constructed.     

A Galerkin Approximation for the Initial-Value Problem for Linear Second-Order Differential Equations

In this paper, a Galerkin type algorithm is given for the numerical solution of L(x)=(r(t)x'(t))'-p(t)x(t)=g(t); x(a)=x_a, x'(a)=x'_a, where r (t)>f0, and Spline hat functions form the approximating basis. Using the related quadratic form, a two-step difference equation is derived for the numerical solutions. A discrete Gronwall type lemma is then used to show that the error at the node points satisfies e_k=0(h²). If e(t) is the error function on a?t?b; it is also shown (in a variety of norms) that e(t)?Ch² and e'(t)?C₁h. Test case runs are also included. A (one step) Richardson or Rhomberg type procedure is used to show that e^R_k=0(h⁴). Thus our results are comparable to Runge-Kutta with half the function evaluations.