Strong convergence of the composite Halpern iteration

Let C be a closed convex subset of a uniformly smooth Banach space E and let T:C→C be a nonexpansive mapping with a nonempty fixed points set. Given a point u∈C, the initial guess x₀∈C is chosen arbitrarily and given sequences , and in (0,1), the following conditions are satisfied:

(i)

;

(ii)

αn→0, βn→0 and 0<a?γn, for some a∈(0,1);

(iii)

, and . Let be a composite iteration process defined by

     

The topology of continua that are approximated by disjoint subcontinua

Suppose that is a collection of disjoint subcontinua of continuum X such that limi→∞dH(Yi,X)=0 where dH is the Hausdorff metric. Then the following are true:

(1)

X is non-Suslinean.

(2)

If each Yi is chainable and X is finitely cyclic, then X is indecomposable or the union of 2 indecomposable subcontinua.

(3)

If X is G-like, then X is indecomposable.

(4)

If all lie in the same ray and X is finitely cyclic, then X is indecomposable.

     

Exponential stability and inequalities of solutions of abstract functional differential equations

With the Lyapunov second method, we study the abstract functional differential equation, . We obtain inequalities of solutions and exponential stability with conditions like:

(i)

,

(ii)

.

Applications in ordinary and partial functional differential equations are given.     

Simple arguments on consecutive power residues

By some extremely simple arguments, we point out the following:

(i)

If n is the least positive kth power non-residue modulo a positive integer m, then the greatest number of consecutive kth power residues mod m is smaller than m/n.

(ii)

Let OK be the ring of algebraic integers in a quadratic field with d∈{−1,−2,−3,−7,−11}. Then, for any irreducible π∈OK and positive integer k not relatively prime to , there exists a kth power non-residue ω∈OK modulo π such that .

     

Packing 1×2×4 bricks in a cubical box

Given a cubical box C_2n+1 of side 2n+1 and a supply of 1×2×4 bricks, it is proved that if n≥2, then

(A1)

one can pack bricks for n odd, and bricks for n even,

(A2)

the capacity of C_2n+1 is , and if n≡1 or 2 (mod4), this upper bound for the capacity can be reduced by 1.

     

Toppling kings in multipartite tournaments by introducing new kings

Let and be two n-tuples of nonnegative integers. An all-4-kings n-partite tournament T(V₁,V₂,…V_n) is said to have a -property if there exists an n-partite tournament T₁(W₁,W₂,…,W_n) such that for each i∈{1,…,n}:

(1)

V_i⊆W_i;

(2)

exactly t_i 4-kings of V_i are not 4-kings in T₁;

(3)

exactly c_i 4-kings of W_i are not vertices of V_i.

We describe all pairs such that there exists an n-partite tournament having -property.     

Complexity results in graph reconstruction

We investigate the relative complexity of the graph isomorphism problem (GI) and problems related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs (in particular, deck checking (DC) and legitimate deck (LD) problems). We show that these problems are closely related for all amounts c?1 of deletion:

(1)

, , , and .

(2)

For all k?2, and .

(3)

For all k?2, .

(4)

.

(5)

For all k?2, .

For many of these results, even the c=1 case was not previously known.Similar to the definition of reconstruction numbers vrn_∃(G) [F. Harary, M. Plantholt, The graph reconstruction number, J. Graph Theory 9 (1985) 451-454] and ern_∃(G) (see [J. Lauri, R. Scapellato Topics in Graph Automorphism and Reconstruction, London Mathematical Society, Cambridge University Press, Cambridge, 2003, p. 120]), we introduce two new graph parameters, vrn_∀(G) and ern_∀(G), and give an example of a family {G_n}_n?4 of graphs on n vertices for which vrn_∃(G_n)<vrn_∀(G_n). For every k?2 and n?1, we show that there exists a collection of k graphs on (2^k-1+1)n+k vertices with 2ⁿ 1-vertex-preimages, i.e., one has families of graph collections whose number of 1-vertex-preimages is huge relative to the size of the graphs involved.     

Constructions of unitals in Desarguesian planes

We present a new construction of non-classical unitals from a classical unital U in . The resulting non-classical unitals are B-M unitals. The idea is to find a non-standard model Π of with the following three properties:

(i)

points of Π are those of ;

(ii)

lines of Π are certain lines and conics of ;

(iii)

the points in U form a non-classical B-M unital in Π.

Our construction also works for the B-T unital, provided that conics are replaced by certain algebraic curves of higher degree.     

Definable sets of generators in maximal cofinitary groups

A group G?Sym(N) is cofinitary if g has finitely many fixed points for every g∈G except the identity element. In this paper, we discuss the definability of maximal cofinitary groups and some related structures. More precisely, we show the following two results:

(1)

Assuming V=L, there is a set of permutations on N which generates a maximal cofinitary group.

(2)

Assuming V=L, there is a mad permutation family in Sym(N).

     

On the Cauchy problem for a reaction-diffusion equation with a singular nonlinearity

We consider the following Cauchy problem with a singular nonlinearity

(P)

     

K-group and similarity classification of operators

Let H be a complex separable Hilbert space and L(H) denote the collection of bounded linear operators on H. An operator A in L(H) is said to be a Cowen-Douglas operator if there exist Ω, a connected open subset of complex plane C, and n, a positive integer, such that

(a)

(b)

  for z in Ω;

(c)

; and

(d)

for z in Ω.

In the paper, we give a similarity classification of Cowen-Douglas operators by using the ordered K-group of the commutant algebra as an invariant, and characterize the maximal ideals of the commutant algebras of Cowen-Douglas operators. The theorem greatly generalizes the main result in (Canada J. Math. 156(4) (2004) 742) by simply removing the restriction of strong irreducibility of the operators. The research is also partially inspired by the recent classification theory of simple AH algebras of Elliott-Gong in (Documenta Math. 7 (2002) 255; On the classification of simple inductive limit C^*-algebras, II: The isomorphism theorem, preprint.) (also see (J. Funct. Anal. (1998) 1; Ann. Math. 144 (1996) 497; Amer. J. Math. (1996) 187)).     

Extended directed triple systems

Let {n;b₂,b₁} denote the class of extended directed triple systems of the order n in which the number of blocks of the form [a,b,a] is b₂ and the number of blocks of the form [b,a,a] or [a,a,b] is b₁. In this paper, we have shown that the necessary and sufficient condition for the existence of the class {n;b₂,b₁} is b₁≠1, 0?b₂+b₁?n and

(1)

for ;

(2)

for .

     

Inverse spectral problems for the Sturm-Liouville operator on a d-star graph

In this work, we consider inverse spectral problems for the Sturm-Liouville differential operator on a d-star-type graph with standard matching conditions in the internal vertex, where the integer d?2. By using the Yurko's method (Yurko (2008) [27], Yurko (2009) [28]) we show that

(1)

if the potential function qj(x) on a fixed edge ej is prescribed on the interval , then the reciprocal of d of the spectrum suffices to determine qj(x) on the whole interval [0,π];

(2)

the 2 over d of the spectrum suffices to determine qj(x) on a fixed edge ej.

     

Asymptotic cones of finitely presented groups

Let G be a connected semisimple Lie group with at least one absolutely simple factor S such that and let Γ be a uniform lattice in G.

(a)

If CH holds, then Γ has a unique asymptotic cone up to homeomorphism.

(b)

If CH fails, then Γ has 2^2ω asymptotic cones up to homeomorphism.