对于规范Hermite-Fejér插值的P.Turán的第24问题

本文给出规范 Hermite-Fejer 插值的 P.Turan 的第 24问题的一个完全解:对于任何规范 Hermite-Fejer插值过程,其对应的定义在同一组节点上的 Lagrange插值过程必对任何满足条件f∈Lipa(a>9/11)的f一致收敛。     

P．Turán问题XXXV的一个注记

本文给出了有关Ｐ．Ｔｕｒáｎ，问题ＸＸＸＶ［关于逼近论的某些未解决的问题，Ｊ．ＡｐｐｒｏｘｉｍａｔｉｏｎＴｈｅｏｒｙ，１９８０，２９（１）：２３－８５］的一个结果．设ｒ＿（ｉｎ）（ｘ）为（０，２）插值的第一类基函数，其插值节点为（１－ｘ）（ｘ）之零点而Ｐ＿ｎ（ｘ）为ｎ次Ｌｅｇｅｎｄｒｅ多项式．那么．但对ｆ￣＊＝ｘ￣２却有     

Bemerkungen zur Arbeit von S. Knapowski und P. Turán

The present paper shows that by an easy modification of the ideas of S. Knapowski and P. Turán [2] one can prove the following Theorem 1: LetV ₁ (Y) denote the number of sign changes of π(x)?lix in the interval [2,Y. Then forY>C ₁ the inequality $$V_1 (Y) > C_2 (\log \log Y)C_3 $$ holds with positive effectively calculable constantsC ₁, C₂ andC ₃.     

Tiling Turán Theorems

H in a large graph G. Received June 2, 1998     

Bemerkung über die Konvergenz eines Interpolationsverfahrens von P. Turán

Ohne ZusammenfassungVorgelegt vonP. Turán Mathematisches Forschungsinstitut der Ungarischen Akademie der Wissenschaften     

Two Turán type inequalities

Turán’s book [2], in Section 19.4, refers to the following result of Gábor Halász. Let a ₀, a ₁, ..., a _n−1 be complex numbers such that the roots α ₁, ⋯, α _n of the polynomial x ⁿ + a _n−1 x ⁿ⁻¹ + ⋯ + a ₁ x + a ₀ satisfy min _j Re α _j ≧ 0 and let function Y(t) be a solution of the linear differential equation Y ⁽ⁿ⁾ + a _n−1 Y ⁽ⁿ⁻¹⁾ + ⋯ + a ₁ Y′ + a ₀ Y = 0. Then

ON possible Turán densities

The Turán density π(F) of a family F of k-graphs is the limit as n → ∞ of the maximum edge density of an F-free k-graph on n vertices. Let Π _∞ ^(k) consist of all possible Turán densities and let Π _fin ^(k) ? Π _∞ ^(k) be the set of Turán densities of finite k-graph families. Here we prove that Π _fin ^(k) contains every density obtained from an arbitrary finite construction by optimally blowing it up and using recursion inside the specified set of parts. As an application, we show that Π _fin ^(k) contains an irrational number for each k ≥ 3. Also, we show that Π _∞ ^(k) has cardinality of the continuum. In particular, Π _∞ ^(k) ≠ Π _fin ^(k) .     

Existence of Rational Interpolation Function and an Open Problems of P. Turán

An existence theorem of rational interpolation function for the sufficient condition has correctly been stated by Macon-Dupree in [2], but some arguments in their proof are not true. In this paper: (i) A related theorem for both the sufficient and necessary condition is asserted and proved by a new and rigorous approach, namely by introducing the notion of (m/n) quasi-rational interpolant of a given function. (ii) With use of these results thus obtained an open problem proposed by P. Turán in [4] is completely solved.     

Turán numbers for odd wheels

The Turán number $\text{ex}(n,G)$ is the maximum number of edges in any $n$-vertex graph that does not contain a subgraph isomorphic to $G$. A wheel$W_n$ is a graph on $n$ vertices obtained from a $C_{n?1}$ by adding one vertex $w$ and making $w$ adjacent to all vertices of the $C_{n?1}$. We obtain two exact values for small wheels:

$\text{ex}(n,W_5)=?\frac{n^2}{4}+\frac{n}{2}?,$

$\text{ex}(n,W_7)=?\frac{n^2}{4}+\frac{n}{2}+1?.$

Given that $\text{ex}(n,W_6)$ is already known, this paper completes the spectrum for all wheels up to 7 vertices. In addition, we present the construction which gives us the lower bound $\text{ex}(n,W_{2k+1})>?\frac{n^2}{4}?+?\frac{n}{2}?$ in general case.     

Explicit evaluations of Turán expressions

Summary Positive representations for [P _n ^(λ) (x)]²−P _n ^−1/(λ) (x)P _n ^+1/(λ) (x) and for analogous expressions involving orthogonal polynomials are obtained. This is an excerpt from the author's doctoral dissertation, written under the direction of ProfessorW. Seidel, to whom the author is grateful for his encouragement and assistance.     

Notes on a problem of Turán

Let z1,z2, ... ,znbe complex numbers, and write S= z ^j _{1 + ... +} z ^j _n for their power sums. Let R _n= min_{z 1,z2,...,zn} max_1≤j≤n |Sj| where the minimum is taken under the condition that max_1≤t≤n |z_t| = 1 Improving a result of Komlós, Sárközy and Szemerédi (see [KSSz]) we prove here that Rn <1 -(1 - ") log log n /log n We also discuss a related extremal problem which occurred naturally in our earlier proof ([B1]) of the fact that Rn >½     

On the Turán Density of Uniform Hypergraphs

Acta Mathematicae Applicatae Sinica, English Series - Let p, q be two positive integers. The 3-graph F(p, q) is obtained from the complete 3-graph K 3 by adding q new vertices and $$p(_2^q)$$ new...     

The Turán Number Of The Fano Plane

  Let PG₂(2) be the Fano plane, i. e., the unique hypergraph with 7 triples on 7 vertices in which every pair of vertices is contained in a unique triple. In this paper we prove that for sufficiently large n, the maximum number of edges in a 3-uniform hypergraph on n vertices not containing a Fano plane is

On A Hypergraph Turán Problem Of Frankl

Let be the 2k-uniform hypergraph obtained by letting P₁, . . .,P_r be pairwise disjoint sets of size k and taking as edges all sets P_i∪P_j with i ≠ j. This can be thought of as the ‘k-expansion’ of the complete graph K_r: each vertex has been replaced with a set of size k. An example of a hypergraph with vertex set V that does not contain can be obtained by partitioning V = V1 ∪V₂ and taking as edges all sets of size 2k that intersect each of V₁ and V₂ in an odd number of elements. Let denote a hypergraph on n vertices obtained by this construction that has as many edges as possible. For n sufficiently large we prove a conjecture of Frankl, which states that any hypergraph on n vertices that contains no has at most as many edges as . Sidorenko has given an upper bound of for the Tur′an density of for any r, and a construction establishing a matching lower bound when r is of the form 2^p+1. In this paper we also show that when r=2^p+1, any -free hypergraph of density looks approximately like Sidorenko’s construction. On the other hand, when r is not of this form, we show that corresponding constructions do not exist and improve the upper bound on the Turán density of to , where c(r) is a constant depending only on r. The backbone of our arguments is a strategy of first proving approximate structure theorems, and then showing that any imperfections in the structure must lead to a suboptimal configuration. The tools for its realisation draw on extremal graph theory, linear algebra, the Kruskal–Katona theorem and properties of Krawtchouck polynomials. * Research supported in part by NSF grants DMS-0355497, DMS-0106589, and by an Alfred P. Sloan fellowship.