Báo cáo toán học: "Some inequalities in functional analysis, combinatorics, and

Báo cáo toán học: "Some inequalities in functional analysis, combinatorics, and probability theory" pdf

... 11T99AbstractThe main purpose of this paper is to show that many inequalities in functional analysis, probability theory and combinatorics are immediate corollaries of the bestapproximation theorem in inner ... electronic journal of combinatorics 17 (2010), #R58 3The main purpose of this paper is to show that many inequalities in functional analysis, probability theory and combinatorics are immediate ... classical inequalities in unitary spaces. Mat. Bilten 42 (1992)63–72.[14] A. R´enyi, Probability Theory. North-Holland Series in Applied Mathematics and Me-chanics, Vol. 10. North-Holland Publishing...

12
268
0

Báo cáo toán học: "ntersecting families in the alternating group and direct product of symmetric groups" potx

... equality holds in (1), then for any independent set I of cardinality α(Γ2) in Γ2, φ−1(I) is an independent set of cardinality α(Γ1) in Γ1.2 Intersecting families in the alternating groupThroughout, ... derangements in Sn. In particulard(4) = 9 and d(5) = 44. Moreover, an independent set in Γqnis an intersecting family in G. A MAPLE computation shows that the smallest eigenvalue of Γ4 and Γ5are ... the possibilities P3 and P4). Since 1 appears in at least two (e.g. the v1- and v2-entry) but in at most m ≤ n − 2 diﬀerent entries in the Snp+1-coordinate of elements in U(˜l,˜j)0,...

15
290
0

Báo cáo toán hoc:"Degree powers in graphs with a forbidden even cycle" pdf

... G and |G| for |V (G)|;- eG(X) for the number of edges induced by X;- eG(X, Y ) for the number of edges joining vertices in X to vertices in Y ;- G −u for the graph obtained by removing ... matrix.If G does not contain C2k+ 2, thenµ2− kµ  k (n − 1 ) .2 Main resultsWe write |X| for the cardinality of a ﬁnite set X. Let G be a graph, and X and Y bedisjoint sets of vertices of ... vertex u and dG(u) for |ΓG(u)|.The main result of this note is the following lemma.Lemma 1 Suppose that k  1 and let the vertices of a graph G be partitioned into twosets A and B.(1)...

9
330
0

Báo cáo toán học: "Some assorted inequalities for positive linear maps on C*-algebras " pot

...

15
308
0

Báo cáo toán học: "Some norm bounds and quadratic form inequalities for Schroedinger operators " docx

...

16
259
0

Báo cáo toán học: "Some norm bounds and quadratic form inequalities for Schroedinger operators." pot

...

20
336
0

Báo cáo toán học: "Some Remarks on Set-Valued Minty Variational Inequalities" ppt

... Stampacchia and Minty variational inequalities, In: General-ized Convexity and Optimization for Economic and Financial Decisions, G. GiorgiSome Remarks on Set-Valued Minty Variational Inequalities ... satisﬁed.Therefore, in this case x0is a set Ξ-minimizer if and only if (x0,y0) is a pointΞ-minimizer. In the sequel, when we deal with Ξ-minimizers, we write explic-itly set Ξ-minimizers or point Ξ-minimizers, ... Let f : K → Y ,beanyincreasing singular function, for instance the well known in the real functionstheory Cantor scale. Then f is continuous and increasing-along-rays starting atx0= 0. At...

26
231
0

Báo cáo toán học: " Some Applications of the Proper and Adjacency Polynomials in the Theory of Graph Spectra" docx

... ν2puk(λ)σk(µ)2.Then, such a minimum turns out to beΦmin=puk(λ)Ek∆ and, according to (18), the upper bound in (31) comes from ν2Φmin1+Φmin. This boundcorresponds to using in (26) the polynomial ... local proper and adjacency polynomials, puk and Quk, are independent of the chosen vertex u and coincide with the correspondingaverage polynomials pk and Qk, respectively (in this case ... without using the proper polynomials, thus obtainingtwo involved (equivalent) expressions in terms of the eigenvalues and multiplicities,which he denoted by h(Σ,µ) and g(Σ,µ) —with Σ denoting the...

27
283
0

Báo cáo toán học: "Some Aspects of Hankel Matrices in Coding Theory and Combinatorics Ulrich Tamm" ppt

... jfor k ≥ 2,n≥ 1. (1.4)Desainte–Catherine and Viennot [24] also gave a combinatorial interpretation of this de-terminant in terms of special disjoint lattice paths and applications to the enumerationof ... method for solvingkey equation for decoding Goppa codes”, Information and Control 27, 1975, 87 – 99.[74] U. Tamm, “Hankel matrices in coding theory and combinatorics”, Preprint 00-055,SFB ... paths in × starting in theorigin (0, 0) and then ﬁrst touching the boundary {(l +1, (p − 1)l +1):l =0, 1, 2, } in (m, (p − 1)m + 1) (cf. e.g. [75]).Viennot [76] gave a combinatorial interpretation...

31
320
0

Báo cáo toán học: "Some new methods in the Theory of m-Quasi-Invariants" pps

... possess a richcombinatorial underpinning resulting in truly surprising identities. The Sncase deservesspecial attention since the results in this case extend in a remarkable manner many wellknown ... (1.5). Of course, since the S3m-quasi-invariants are easily obtained from the m-quasi-invariants of the dihedral groupd D3, in principle, the results in [7] should have a bearingon what we ... have seen in section 2 that every m-quasi-invariant in x1,x2,x3is a sum ofterms involving(1) An invariant(2) The polynomial x2x23Π(x)2mtimes an invariant.(3) An m-quasi-invariant...

32
324
0