نتایج جستجو برای: schinzel equation
تعداد نتایج: 229987 فیلتر نتایج به سال:
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bijective encoding of such sequences by rooted plane trees with distinguished nonleaves and we give a combinatorial proof of the formula 1 k − n+ 1 ( 2k − 2n k − n )( k − 1 2n− k − 1 ) for the number of such normalized seq...
Abstract We resolve Schinzel’s Hypothesis (H) for $$100\%$$ 100 % of polynomials arbitrary degrees. deduce that a positive proportion diagonal conic bundles over $${\mathbb {Q}}$$ Q with any given number degenerate fibres have rational point, and obtain...
Let n be a positive integer, Pd(n) denotes the product of all positive divisors of n, qd(n) denotes the product of all proper divisors of n. In this paper, we study the properties of the sequences {PdCn)} and {qd(n)}, and prove that the Makowski &. Schinzel conjecture hold for the sequences {pd(n)} and {qd(n)}.
در این پایان نامه یک روش عددی برای حل معادلات کسری-زمانی و کسری-فضایی برگر egin{equation*} d_t^{alpha}u+varepsilon uu_{x}= u u_{xx}+eta d_x^{eta}u, end{equation*} معادله ی کسری-زمانی و کسری-فضایی پوآسن egin{equation*} d_x^{eta}u + d_t^{alpha}u = f(x,t), end{equation*} و معادله ی کسری-زمانی انتشار egin{equation*} d_t^alpha u+u=k abla^2 u + f(x,t), end{equation*} ...
Filredi, Z. and P. Hajnal, Davenport-Schinzel theory of matrices, Discrete Mathematics 103 (1992) 233-251. Let C be a configuration of 1’s. We define f(n; C) to be the maximal number of l’s in a O-l matrix of size n x n not having C as a subconfiguration. We consider the problem of determining the order off (n; C) for several forbidden C’s. Among other results we prove that f (n; (’ 1 ’ J) = @(...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید