Let K be a finite unramified extension of Qp. We parametrize the (φ, Γ)-modules corresponding to reducible two-dimensional Fp-representations of GK and characterize those which have reducible crystalline lifts with certain Hodge-Tate weights.

This paper reports the disassembly of layer-by-layer (LbL) films of plasmid DNA and a reducible cationic polypeptide. To utilize a reducing microenvironment of cellular plasma membrane as a potential trigger, LbL films are assembled to contain both DNA and the TAT-based polypeptide (PTAT) with reducible disulfide bonds in the backbone. The assembly and disassembly processes are monitored by gon...

by JIANPING ZHU (Under the Direction of Robert W. Robinson) ABSTRACT In this thesis, we consider the following problem: Given a strongly connected digraph G = (V, E), where V is the set of vertices and E is the set of edges , “is it a minimal strong connected digraph?”. A reducible edges e is one for which G−e is strongly connected. A minimal strongly connected digraph is one with no reducible ...

Identify a string x over f0; 1g with the positive integer whose binary representation is 1x. We say that a self-reduction is k-local if on input x all queries belong to fx ? 1; : : :; x ? kg. We show that all k-locally self-reducible sets belong to PSPACE. However, the power of k-local self-reductions changes drastically between k = 2 and k = 3. Although all 2-locally self-reducible sets belong...

A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...

We show that there exists a 2-membership comparable set that is not btt-reducible to any pselective set. This is a rare example of an unconditional separation in computational complexity. More generally there are 2-membership comparable sets that are not n-tt-reducible to any pselective sets for any constant c. The proof of this result heavily relies on the fact that the p-selector must examine...

A set A is m-reducible (or Karp-reducible) to B if and only if there is a polynomial-time computable function f such that, for all x, x ∈ A if and only if f(x) ∈ B. Two sets are: • 1-equivalent if and only if each is m-reducible to the other by one-one reductions; • p-invertible equivalent if and only if each is m-reducible to the other by one-one, polynomial-time invertible reductions; and • p...

Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P c...

The novel concept of a cyclic sequence of a digraph that has precisely one factor is defined, and is used to characterize the entries of the inverse of a matrix with such a digraph. This leads to a characterization of a strongly sign-nonsingular matrix in terms of cyclic sequences. Nonsingular nearly reducible matrices are a well-known class of matrices having precisely one nonzero diagonal, an...

zn/acoh on silica gel converts a range of structurally different sulfoxides to their corresponding thioethers in excellent yields under microwave irradiation. it has been found that chemoselective deoxygenation of sufoxides can be achieved in the presence of other reducible functional groups such as acetals, acids, amides,   esters, ketones and nitriles.