The PCP theorem states that NP PCP(log n; (log n) c). We build gradually towards its proof. As an intermediate step we show that NP PCP(log n; (log n) c) for some constant c > 1. The presentation here is taken in most parts from 4] (which is heavily based on 2], where NP PCP(log n log log n; log n log log n) was proved. We save a log log n factor in the number of random bits (at a cost of a pol...

با توجه به رشد بالای جمعیت در جهان و نیاز اطمینان از امنیت غذایی، افزایش تولید واحد سطح محصولات زراعی به‌منزلة راهبردی اساسی حل مسئلة تأمین غذا به‌شمار می‌رود. سوی دیگر، وجود محدودیت زیرکشت پایین‌بودن میانگین عملکرد برخی کشاورزی مانند گندم کشور، محصول می‌تواند راهکاری عملی پاسخ کشور محسوب شود. یکی مهم‌ترین بیماری‌های فوزاریوم است که، نقش پیش‌بینی این بیماری جلوگیری کاهش بهره‌وری محصول، مدل‌هایی...

‎let $x=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the hankel matrix of size $2times n$ and let $g$ be a closed graph on the vertex set $[n].$ we study the binomial ideal $i_gsubset k[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $x$ which correspond to the edges of $g.$ we show that...

A central limit theorem for stochastic recursive sequences of topical operators. Abstract Let (A n) n∈N be a stationary sequence of topical (i.e. isotone and ad-ditively homogeneous) operators. Let x(n, x 0) be defined by x(0, x 0) = x 0 and x(n + 1, x 0) = A n x(n, x 0). It can modelize a wide range of systems including train or queuing networks, job-shop, timed digital circuits or parallel pr...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....