Cytokinesis separates cells by contraction of a ring composed of filamentous actin (F-actin) and type II myosin. Iqg1, an IQGAP family member, is an essential protein in Saccharomyces cerevisiae required for assembly and contraction of the actomyosin ring. Localization of F-actin to the ring occurs only after anaphase and is mediated by the calponin homology domain (CHD) of Iqg1, but the regula...

For an element $r$ of a ring $R$, Diophantine $D(r)$ $m$-tuple is $(a_1,a_2,\ldots,a_m)$ elements $R$ such that for all $i,j$ with $i\neq j$, $a_ia_j+r$ perfect square in $R$. In this article, we compute and estimate the measures sets $m$-tuples $\mathbb{Z}_p$ $p$-adic integers, as well its residue field $\mathbb{F}_p$.

let r be an associative ring with unity. an element a in r is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von neumann) element in r. if every element of r is r-clean, then r is called an r-clean ring. in this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. further we prove that if 0 and 1 are the only idempotents...

let r be an associative ring with unity. an element a in r is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von neumann) element in r. if every element of r is r-clean, then r is called an r-clean ring. in this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. further we prove that if 0 and 1 are the only idempotents...

Certain subgraphs of a given graph G restrict the minimum number χ(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such subgraphs are related to the celebrated Strong Perfect Graph Theorem, as it implies that every graph G contains a clique of size χ(G), or an odd hole or an odd anti-hole as an induced subgraph. In thi...

We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...

A graph is Berge if no induced subgraph of it is an odd cycle of length at least five or the complement of one. In joint work with Robertson, Seymour, and Thomas we recently proved the Strong Perfect Graph Theorem, which was a conjecture about the chromatic number of Berge graphs. The proof consisted of showing that every Berge graph either belongs to one of a few basic classes, or admits one o...

for a ring endomorphism $alpha$ and an $alpha$-derivation $delta$, we introduce a concept, so called skew $pi$-armendariz ring, that is a generalization of both $pi$-armendariz rings, and $(alpha,delta)$-compatible skew armendariz rings. we first observe the basic properties of skew $pi$-armendariz rings, and extend the class of skew $pi$-armendariz rings through various ring extensions. we nex...