Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

... β invariant from matroids to greedoids, con- centrating especially on antimatroids. Several familiar expansions for β( G) have greedoid analogs. We give combinatorial interpretations for β( G )for simplicial ... greedoid and let {e}∈F. Then β( G) =β( G/e)+(−1) r(G)−r(G−e) β( G − e). We remark that since r(G − e)=r(G) for all non-isthmuses e in a matroid G, the formula above...

Ngày tải lên: 07/08/2014, 06:20

13 285 0
Báo cáo khoa học: "a system for tutoring and computational linguistics experimentation" pptx

Báo cáo khoa học: "a system for tutoring and computational linguistics experimentation" pptx

... turns. 4 Conclusions and Future Work The BEETLE II system we present was built to serve as a platform for research in computational linguistics and tutoring, and can be used for task- based evaluation ... 2010. c 2010 Association for Computational Linguistics BEETLE II: a system for tutoring and computational linguistics experimentation Myroslava O. Dzikovska and Johanna D....

Ngày tải lên: 17/03/2014, 00:20

6 493 0
Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx

Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx

... = λ, n − k − l +1=0 ,and P(n −k − l +1,k− 1,l− 1) = {λ}.Otherwise, d(α)=d(π) − 1and =(α 1 , α m )wherem = π  2 − 1, α i = π i+1 − 1 for 1 ≤ i ≤ m and α  i = π  i+1 − 1for1 ≤ i ≤ d(π) − 1. Clearly, ... [ER]) and that [RA1] lim n→∞ |G(n)| |P(n)| ≤ .25. Acknowledgements: Thanks to Steve Skiena for bringing this problem to our attention, to Frank Ruskey for pointing out references [...

Ngày tải lên: 07/08/2014, 06:20

10 300 0
Báo cáo toán học: " A criterion for unimodality" docx

Báo cáo toán học: " A criterion for unimodality" docx

...  2 < 1. Therefore the polynomial P (α ,β) m (a):= m  k=0 b k (m)(a +1) k is unimodal. This is a special case of the Jacobi family, where the parameters α and β are not standard since they ... sequences α j := m  k=j n k  k j  ,β j := m  k=j k n  k j  , and γ j := m  k=j k k  k j  are unimodal for 0 ≤ j ≤ m. Example 5.Let2<a 1 < ··· <a p and n 1 , ··· ,n p b...

Ngày tải lên: 07/08/2014, 06:20

4 264 0
Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx

Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx

... z l }, and suppose  I =  J, i.e. k  i=1 y i − l  i=1 z i =0. For appropriate choices of α i and β i ,wehave: y i = n  j=α i d S (j) z i = n  j =β i d S (j). Notice that the α  i s and β  i s ... Conway and Guy and Lunnon. In particular, d  1 is the difference vector corresponding to the Conway–Guy sequence (for more on the Conway–Guy sequence see [B] and [G1]), an...

Ngày tải lên: 07/08/2014, 06:22

14 268 0
Báo cáo toán học: " A Macdonald Vertex Operator and Standard Tableaux Statistics for the Two-Column (q, t)-Kostka Coefficients" doc

Báo cáo toán học: " A Macdonald Vertex Operator and Standard Tableaux Statistics for the Two-Column (q, t)-Kostka Coefficients" doc

... on a standard tableau, it maps it to an x-standard tableaux with the relation µ(N a T )= type (2 a 1 b ) (T )forT ∈ST 2a+b . This operator is a bijection between standard tableaux and x-standard ... known to be isomorphic to standard tableaux. It would be better to have these statistics directly for standard tableau since the bijection between standard tableau and rigged configurations i...

Ngày tải lên: 07/08/2014, 06:22

46 260 0
Báo cáo toán học: "A Bound for Size Ramsey Numbers of Multi-partite Graphs" pot

Báo cáo toán học: "A Bound for Size Ramsey Numbers of Multi-partite Graphs" pot

... Let us consider a random red-blue edge-coloring of G, in which each edge is red with probability 1/2 and the edges are colored independently. Then the probability P that such a random coloring yields ... graph 1 Introduction Let G, G 1 and G 2 be simple graphs with at least two vertices, and let G → (G 1 , G 2 ) signify that in any edge-coloring of edge set E(G) of G in red and blue,...

Ngày tải lên: 07/08/2014, 13:21

5 278 0
Báo cáo toán học: "A characterization for sparse ε-regular pairs" pps

Báo cáo toán học: "A characterization for sparse ε-regular pairs" pps

... write e G (A, B) for the number of edges with one endpoint in A and one endpoint in B. For a vertex v ∈ V , we write Γ G (v) for its set of neighbours and deg G (v) = |Γ G (v)| for its degree. ... F.R Chung, R.L Graham, and R.K. Wilson. Quasi-random graphs. Combinatorica, 9:345–362, 1989. [4] A. Frieze and R. Kannan. The regularity lemma and approximation schemes for dense...

Ngày tải lên: 07/08/2014, 15:22

12 181 0
Báo cáo toán học: "A multivariate interlace polynomial and its computation for graphs of bounded clique-width" docx

Báo cáo toán học: "A multivariate interlace polynomial and its computation for graphs of bounded clique-width" docx

... C, b and C, b and A. It follows that N(G a , a) = N(G, a) and N(G a , b) = A ∪ B ∪ {a}. The local complementation at b toggles edges and loops in A, B, {a} and edges between A and B, a and A, a and ... subgraphs H and K. For two graphs G and H we write H = h(G) and we say that they are isomorphic by h if h is a bijection of V G onto V H and M H (h(i), h(j)) = M G (i,...

Ngày tải lên: 07/08/2014, 21:20

36 255 0
Báo cáo khoa học: "A System for Detecting Subgroups in Online Discussions" pptx

Báo cáo khoa học: "A System for Detecting Subgroups in Online Discussions" pptx

... package. The system works on all the standard platforms. The system has a command-line interface that 2 http://nlp.stanford.edu/software/corenlp.shtml 3 http://java-ml.sourceforge.net/ provides full access ... www.createdebate.com, www.forandagainst.com, etc (1) Discussant 1: I believe that school uniform is a good idea because it improves student attendance. (2) Discussant 2: I disagree with...

Ngày tải lên: 16/03/2014, 20:20

6 411 0
Từ khóa:
w