Effects of some agronomic practices on the quality of starch content of maize grains

Received: February 1st, 2021 ; Accepted: January 15th, 2022 ; Published: February 28th, 2022 ; Correspondence: [email protected] use of maize, both as main and by-product, is extremely versatile and diverse. The highest amount of carbohydrate within maize is found in the form of starch (C6H10O5)x. In terms of industrial starch, maize is the most important raw material. Fodder maize is primarily an energy source due to its high starch content, and its protein and oil content are less important. It was found that starch and protein content, which are negatively correlated with each other, are significantly affected by fertilizer doses. The experiment is located in the Hajdúság Loess Plateau, its soil is loess-based deep humus layered calcareous chernozem. The following treatments were applied in the scope of the polyfactorial experiment: Tillage: T1 = winter ploughing, T2 = strip tillage, T3 = ripping. Crop years: 2017, 2018 and 2019. Fertilization treatments: N 0 kg ha-1 P2O5 0 kg ha-1 K2O 0 kg ha-1 (control); N 80kg ha-1 P2O5 60 kg ha-1 K2O 90 kg ha-1 and N 160 kg ha-1 P2O5 60 kg ha-1 K2O 90 kg ha-1. Analysis of the nutritional component was carried out by means of a Foss Infratec TM 1241 Grain Analyser. In terms of fertilization treatments, the highest (64.42%) maize starch content was measured for the control treatment, while the lowest starch content was recorded in the case of the 160 kg N ha-1 treatment (62.62%). The analysis of the crop year effect showed that 2018 was the most favourable year for the maize starch content of the examined samples (65.76%). Of the studied years, the lowest starch content was measured in 2017 (61.78%)

Improved quantum algorithms for the ordered search problem via semidefinite programming

One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log_{605} N \approx 0.433 log_2 N queries, which improves upon the previously best known exact algorithm.Comment: 8 pages, 4 figure

On Taylor series of functions regular in Gaier regions

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41617/1/13_2005_Article_BF01899316.pd

On the order of summability of the Fourier inversion formula

In this article we show that the order of the point value, in the sense of Łojasiewicz, of a tempered distribution and the order of summability of the pointwise Fourier inversion formula are closely related. Assuming that the order of the point values and certain order of growth at infinity are given for a tempered distribution, we estimate the order of summability of the Fourier inversion formula. For Fourier series, and in other cases, it is shown that if the distribution has a distributional point value of order k, then its Fourier series is e.v. Cesàro summable to the distributional point value of order k+1. Conversely, we also show that if the pointwise Fourier inversion formula is e.v. Cesàro summable of order k, then the distribution is the (k+1)-th derivative of a locally integrable function, and the distribution has a distributional point value of order k+2. We also establish connections between orders of summability and local behavior for other Fourier inversion problems