883 resultados para fruit-bearing trees
Resumo:
On an apple grove situated at Buri, State of São Paulo, fruits were collected from trees 1-2; 3-4; 4-5, and 6 - 7 years old. The fruits were analysed for N, P, K, Ca, Mg, S, B, Cu, Fe, Mn and Zn. The authors concluded: a) the concentrations of the nutrients in the fruits differ according to the variety, age of the tree and age of the fruit; b) the concentrations of nutrients decrease with aging of the fruits; c) the concentrations of the macronutrients obey the following order: N>K>P>Ca>S> Mg; d) for the micronutrients, the following order was ob -served: Fe > B > Mn > Cu > Zn.
Resumo:
v.31:no.16(1947)
Resumo:
v.34:no.19(1953)
Resumo:
n.s. no.9(1981)
Resumo:
v.11:no.1(1947)
Resumo:
Litargus tetraspilotus LeConte, 1856 was collected feeding on Oidium sp. (Fungi, Ascomycota, Erysiphaceae) associated with fruit trees. This is the first time L. tetraspilotus is recorded in Brazil, totaling three species of Mycetophagidae for this country. This study aims to provide a complementary description of this species based on new characters and to present information on its life cycle under laboratory conditions and fluctuation in population in the field. During the period of inventories between July 2004 and August 2006, about every fifteen days, a total of 565 specimens of L. tetraspilotus were collected, with the highest abundance found on citrus plants, with values differing significantly between the two years. The population levels differed between the seasons; spring had the greatest abundance and autumn the least. There was a significant positive correlation of L. tetraspilotus abundance with rainfall and relative humidity. Mycetophagidae, as well as other mycophagous families of Brazilian coleopterans, are barely studied, warranting further future studies of their bioecology and systematics.
Resumo:
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.
Resumo:
We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.
Resumo:
"Vegeu el resum a l’inici del document del fitxer adjunt."