This paper presents an algorithm, motivated by Morse Theory, for the topological configuration of the components of a real algebraic curve {f(x, y) = 0}. The running time of the algorithm is O(n12 (d + log n)2 log n), where n, d are the degree and maximum coefficient size of f(x, y).

Moudafi and Maingé [Towards viscosity approximations of hierarchical fixed-point problems, Fixed Point Theory Appl. (2006), Art. ID 95453, 10pp] and Xu [Viscosity method for hierarchical fixed point approach to variational inequalities, Taiwanese J. Math.13(6) (2009)] studied an implicit viscosity method for approximating solutions of variational inequalities by solving hierarchical fixed point problems. The approximate solutions are a net (xs,t) of two parameters s,t∈(0,1), and under certain conditions, the iterated lim t→0lim s→0xs,t exists in the norm topology. Moudafi, Maingé and Xu stated the problem of convergence of (xs,t) as (s,t)→(0,0) jointly in the norm topology. In this paper we further study the behaviour of the net (xs,t); in particular, we give a negative answer to this problem.

Using elementary means, we derive an explicit formula for a3(n), the number of 3-core partitions of n, in terms of the prime factorization of 3n+1. Based on this result, we are able to prove several infinite families of arithmetic results involving a3(n), one of which specializes to the recent result of Baruah and Berndt which states that, for all n≥0, a3(4n+1)=a3(n).

The equivalence of a fixed point theorem and the Fan-Knaster-Kuratowski-Mazurkiewicz theorem in H-space has been established. The fixed point theorem is then applied to obtain a theorem on sets with H-convex sections, and also results on minimax inequalities.

We show that a ruled surface of finite type in a Euclidean space is a cylinder on a curve of finite type or a helicoid in Euclidean 3-space.

The present paper deals with some oscillating and asymptotic properties of the functional differential equations of the form

where λ is an arbitrary positive constant and τ > 0 is a constant delay.

In a uniformly convex Banach space the convergence of Ishikawa iterates to a fixed point is discussed for nonexpansive and generalised nonexpansive mappings.

In one of their most recent works, George Andrews and Peter Paule continue their study of partition functions via MacMahon's Partition Analysis by considering partition functions associated with directed graphs which consist of chains of hexagons. In the process, they prove a congruence related to one of these partition functions and conjecture a number of similar congruence results. Our first goal in this note is to reprove this congruence by explicitly finding the generating function in question. We then prove one of the conjectures posed by Andrews and Paule as well as a number of congruences not mentioned by them. All of our results follow from straightforward generating function manipulations.

A ring R with unity is called a (quasi-) Baer ring if the left annihilator of every (left ideal) nonempty subset of R is generated (as a left ideal) by an idempotent. Armendariz has shown that if R is a reduced PI-ring whose centre is Baer, then R is Baer. We generalise his result by considering the broader question: when does the (quasi-) Baer condition extend to a ring from a subring? Also it is well known that a regular ring is Baer if and only if its lattice of principal right ideals is complete. Analogously, we prove that a biregular ring is quasi-Baer if and only if its lattice of principal ideals is complete.

For r-partite and for r-uniform hypergraphs bounds are given for the minimum degree which ensures d independent edges.

It is shown that if a retarded delay differential equation has a global attractor in the space C ([—τ0, ], ℝd) for a given nonzero constant delay τ0, then the equation has an attractor Aτ in the space C ([—τ, 0], ℝd) for nearby constant delays τ. Moreover the attractors Aτ converge upper semi continuously to in C ([—τ0, 0], ℝd) in the sense that they are identified through corresponding segments of entire trajectories in ℝd with nonempty compact subsets of C ([—τ0, 0], ℝd) which converge upper semi continuously to in C ([—τ0, 0], ℝd).

Until recently most authors have devoted their research to the theory of perturbed systems under continuous perturbations. In this paper, Liapunov's second method is employed to investigate sufficient conditions for integral and integral asymptotic stability of ordinary differential systems with respect to impulsive perturbations.

We establish a link between regular subgroups of the affine group and radical circle algebras on the underlying vector space.

Some characterisations of generalised convex functions are established by means of Clarke's subdifferential and directional derivatives.

Let f: X → X be a map of a continuum X. Let P(f) denote the set of all periodic points of f and R(f) denote the set of all recurrent points of f. In [2], Coven and Hedlund proved that if f: I → I is a map of the unit interval I = [0, 1], then CI(P(f)) = CI(R(f)). In [7], Ye generalised this result to maps of a tree. It is natural to ask whether the result generalises to maps of a dendrite. (A dendrite is a locally connected continuum which contains no simple closed curve.) The aim of this paper is to show that the answer is negative.

A result by the author on the elimination of randomization (or relaxation) for variational problems is partially extended and then used to obtain a very general result on the denseness of the set of original control functions in the set of relaxed control functions. Also, a slight extension of Aumann's theorem on the integrals of multifunctions is shown to follow directly from the elimination result.

The paper introduces a graph theory variation of the general position problem: given a graph $G$, determine a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is a max-gp-set of $G$ and its size is the gp-number $\text{gp}(G)$ of $G$. Upper bounds on $\text{gp}(G)$ in terms of different isometric covers are given and used to determine the gp-number of several classes of graphs. Connections between general position sets and packings are investigated and used to give lower bounds on the gp-number. It is also proved that the general position problem is NP-complete.

An example is given of an infinite cyclic extension of a free group of finite rank in which not every finitely generated subgroup is finitely separable. This answers negatively the question of Peter Scott as to whether in all finitely generated 3-manifold groups the finitely generated subgroups are finitely separable. In the positive direction it is shown that in knot groups and one-relator groups with centre, the finitely generated normal subgroups are finitely separable.

Let Sa (h) denote the class of analytic functions f on the unit disc E with f (0) =0 = f′ (0) −1 satisfying , where (a real), denotes the Hadamard product of Ka with f, and h is a convex univalent function on E, with Re h > 0. Let . It is proved that F ε Sa (h) whenever f ε Sa (h) and also that for a ≥ 1. Three more such classes are introduced and studied here. The method of differential subordination due to Eenigenburg et al. is used.

Let X be a finite set of cardinality n, and let F be a family of k-subsets of X. In this paper we prove the following conjecture of P. Erdös and V.T. Sós.

If n > n0(k), k ≥ 4, then we can find two members F and G in F such that |F ∩ G| = 1.