... transpositions, then the poly- nomial (1) is equal to a sum of polynomials of the form (2) and again is TNN. (⇐) Suppose that π is not less than or equal to σ in the Bruhat order. By Theorem 1 we ... geome- try [4, Conj. 2.8, Conj. 5.1]. Theorem 3 Let π and σ be permutations in S n . Then π is less than or equal to σ in the Bruhat order if and only if the polynomial...
Ngày tải lên: 07/08/2014, 08:20
... deduce the rational cohomology of certain spaces of polynomials in the complement of the standard discriminant that have no root in the first s integers. 1 Introduction In this paper we study the ... Edelman & Reiner, their motivation for studying the corresponding arrangements origins in the “freeness” condition (see the book by Orlik & Terao [11]) and theref...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Total domination and matching numbers in claw-free graphs" doc
... 14 There is no 4-cycle containing both v 1 and v 2 or containing both v 3 and v 4 . Proof. Suppose, to the contrary, that there is a 4-cycle containing both v 1 and v 2 or containing both v 3 and ... matching in G is a matching with the property that every vertex is incident with an edge of the matching. Matchings in graphs are extensively studied in the literature (see,...
Ngày tải lên: 07/08/2014, 13:21
Báo cáo toán học: "Rationality, irrationality, and Wilf equivalence in generalized factor order" ppsx
... an embedding of u in ¯w with the n in position i + ℓk for each i ∈ η(w) and these are the only embeddings. These embeddings exist because there is a pseudo-embedding of v into w with the n in position ... (directed) path in ∆ starting at α, we construct a word in P ∗ by concatenating the elements on the arcs on the path in the order in which they are encountered....
Ngày tải lên: 08/08/2014, 01:20
Báo cáo toán học: "Chemical composition and antibacterial activity of the essential oils from Launaea resedifolia L." docx
... as the diameter of the inhibition zone in millimeter. Results obtained in the antibacterial study are shown in Table 2. The results indicated that S. aureus was the most sensitive strain to the ... al. [6]. In continuation of our phytochemical and antibacterial studies of the Algerian Sahara medicinal plants [7–11], we report here the findings of our studies on t...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: "Antioxidant, antimicrobial, and theoretical studies of the thiosemicarbazone derivative Schiff base 2-(2-imino-1-methylimidazolidin-4-ylidene)hydrazinecarbothioamide (IMHC)" potx
... using the DFT in the methodology. DMol3 model was employed to obtain quantum chemical parameters and optimization of the molecule geometry. Competing interests The HOMO−LUMO explain the ... structure where the creatinine group is cis to the hydrazinic nitrogen across the C=N bond. The existence of the thione form predominantly in the solid state is demonstrat...
Ngày tải lên: 20/06/2014, 20:20
Báo cáo toán học: "Operator systems and their application to the Tomita-Takesaki theory " pptx
... h 1" alt =""
Ngày tải lên: 05/08/2014, 09:46
Báo cáo toán học: "Mapping cones and exact sequences in KK-theory " pptx
... h 1" alt =""
Ngày tải lên: 05/08/2014, 15:21
Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx
... functions in x and ¯y, the denominators containing factors of the form (x + c) (which come from the coefficients in the linear combination (3.20)). Taking the limit x →−cin (3.21) then reveals that these ... sum of minors into a single determinant (using a result of Stembridge [15, Theorem 3.1, Theorem 8.3]) and evaluating the determinant. Since Zeilberger shows in [16, Le...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Distance domination and distance irredundance in graphs" ppsx
... k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in ... k-dominating set of G if the distance between each vertex u ∈ V − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distan...
Ngày tải lên: 07/08/2014, 15:22