In this paper we discuss two partially ordered sets and give a connection between max-min identity and GCD-LCM one.

In this paper we analyze a slight modification of Jebelean’s version of the k-ary GCD algorithm. Jebelean had shown that on n-bit inputs, the algorithm runs in O(n) time. In this paper, we show that the average running time of our modified algorithm is O(n/ logn). This analysis involves exploring the behavior of spurious factors introduced during the main loop of the algorithm. We also introduc...

The stress-activated protein kinase Gcn2 regulates protein synthesis by phosphorylation of translation initiation factor eIF2α. Gcn2 is activated in amino acid-deprived cells by binding of uncharged tRNA to the regulatory domain related to histidyl-tRNA synthetase, but the molecular mechanism of activation is unclear. We used a genetic approach to identify a key regulatory surface in Gcn2 that ...

In the cochlear nucleus, there is a magnocellular core of neurons whose axons form the ascending auditory pathways. Surrounding this core is a thin shell of microneurons called the granule cell domain (GCD). The GCD receives auditory and nonauditory inputs and projects in turn to the dorsal cochlear nucleus, thus appearing to serve as a central locus for integrating polysensory information and ...

For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.

We examined the distribution and ancestral relationships of genetic caste determination (GCD) in 46 populations of the seed-harvester ants Pogonomyrmex barbatus and P. rugosus across the east-to-west range of their distributions. Using a mtDNA sequence and two nuclear markers diagnostic for GCD, we distinguished three classes of population phenotypes: those with GCD, no evidence of GCD, and mix...

Let R be an integral domain in which every two nonzero elements have a greatest common divisor. Let (an)n>1 be a sequence of nonzero elements in R. We prove that gcd(an, am) = agcd(n,m) for all n,m > 1 if and only if an = ∏

In this paper we focus on connected directed/undirected circulant graphs Cn(a, b). We investigate some topological characteristics, and define a simple combinatorial model, which is new for the topic. Building on such a model, we derive a necessary and sufficient condition to test whether two circulant graphs Cn(a, b) and Cn(a , b) are isomorphic or not. The method is entirely elementary and co...