In this paper we consider an existence of a solution for a nonlinear nonmonotone wave equation in [0,π]xR and an existence of a positive solution for a non-positone Dirichlet problem in a bounded subset of R^n.

This dissertation is a study of the dynamics of one-dimensional unimodal maps and is mainly concerned with those maps which are trapezoidal. The trapezoidal function, f_e, is defined for eΣ(0,1/2) by f_e(x)=x/e for xΣ[0,e], f_e(x)=1 for xΣ(e,1-e), and f_e(x)=(1-x)/e for xΣ[1-e,1]. We study the symbolic dynamics of the kneading sequences and relate them to the analytic dynamics of these maps. Chapter one is an overview of the present theory of Metropolis, Stein, and Stein (MSS). In Chapter two a formula is given that counts the number of MSS sequences of length n. Next, the number of distinct primitive colorings of n beads with two colors, as counted by Gilbert and Riordan, is shown to equal the number of MSS sequences of length n. An algorithm is given that produces a bisection between these two quantities for each n. Lastly, the number of negative orbits of size n for the function f(z)=z^2-2, as counted by P.J. Myrberg, is shown to equal the number of MSS sequences of length n. For an MSS sequence P, let H_ϖ(P) be the unique common extension of the harmonics of P. In Chapter three it is proved that there is exactly one J(P)Σ[0,1] such that the …

A lattice L is said to be dually semimodular if for all elements a and b in L, a ∨ b covers b implies that a covers a ∧ b. L is consistent if for every join-irreducible j and every element x in L, the element x ∨ j is a join-irreducible in the upper interval [x,l]. In this paper, finite dually semimodular consistent lattices are investigated. Examples of these lattices are the lattices of subnormal subgroups of a finite group. In 1954, R. P. Dilworth proved that in a finite modular lattice, the number of elements covering exactly k elements is equal to the number of elements covered by exactly k elements. Here, it is established that if a finite dually semimodular consistent lattice has the same number of join-irreducibles as meet-irreducibles, then it is modular. Hence, a converse of Dilworth's theorem, in the case when k equals 1, is obtained for finite dually semimodular consistent lattices. Several combinatorial results are shown for finite consistent lattices similar to those already established for finite geometric lattices. The reach of an element x in a lattice L is the difference between the rank of x*, the join of x and all …