A Generalization of Riemann Sums Omran Kouba

Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc

Tài liệu Báo cáo khoa học: "A GENERALIZATION OF THE OFFLINE PARSABLE GRAMMARS" doc

... conjectures that grammars whose acyclic backbone is depth-bounded in fact generate the same languages as the offline parsable grammars. Conclusion The offline parsable grammars apparently have enough ... sorts, assign a sort to each label and to each atomic dag. The arity of a label is a set of sorts (not a sequence of sorts as in term unification). A dag is well-form...
Ngày tải lên : 21/02/2014, 20:20
  • 6
  • 440
  • 0
Báo cáo toán học: "A Generalization of Gosper’s Algorithm to Bibasic" docx

Báo cáo toán học: "A Generalization of Gosper’s Algorithm to Bibasic" docx

... 1995. [2] W. Al-Salam and A. Verma, On quadratic transformations of basic series,SIAMJ. Math. Anal., 15 (1984), 414–421. [3] G. Gasper, Summation, transformation, and expansion formulas for bibasic series, Trans. ... journal of combinatorics 3 (1996), #R19 16 [4] G. Gasper and M. Rahman, An indefinite bibasic summation formula and some quadratic, cubic, and quartic summation and transform...
Ngày tải lên : 07/08/2014, 06:20
  • 16
  • 340
  • 0
Báo cáo toán học: " Colored partitions and a generalization of the braid arrangemen" docx

Báo cáo toán học: " Colored partitions and a generalization of the braid arrangemen" docx

... U A =  H A H of an arrangement A. The result by Ziegler & ˇ Zivaljevi´c is actually far more general and is valid for general arrangements of linear subspaces. Here, we state an equivariant version ... combinatorics of an arrangement of hyperplanes in C n that generalizes the classical braid arrangement. The arrangement plays in important role in the work of Schechtman &...
Ngày tải lên : 07/08/2014, 06:20
  • 12
  • 410
  • 0
Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx

Báo cáo toán học: "DETERMINANT IDENTITIES AND A GENERALIZATION OF THE NUMBER OF TOTALLY SYMMETRIC SELF-COMPLEMENTARY PLANE PARTITIONS" pptx

... observation makes it apparent that similar replace- ments in the rest of Step 1 of Proposition 5 will produce a valid proof of Lemma 7. In particular, in (4.17), in the statements of Claim 1 and Claim ... to give a short inductive proof of the determinant evaluation in Theorem 10 (and also of its q-analogue in [9]), and could also be used to give an inductive proof of the de...
Ngày tải lên : 07/08/2014, 06:20
  • 62
  • 398
  • 0
Báo cáo toán học: "RESTRICTED SET ADDITION IN GROUPS, II. ˝ A GENERALIZATION OF THE ERDOS-HEILBRONN CONJECTURE" pptx

Báo cáo toán học: "RESTRICTED SET ADDITION IN GROUPS, II. ˝ A GENERALIZATION OF THE ERDOS-HEILBRONN CONJECTURE" pptx

... with (a, b) /∈R, and we obtain a partial generalization of this estimate for arbitrary Abelian groups. 1. Background: mapping restrictions For two subsets A and B of the set of elements of a group ... number of sums a+ b where a ∈ A and b ∈ B range over given sets A, B ⊆ Z/pZ of residues modulo a prime p,sothata = b. A solution was given in 1994 by Dias da Si...
Ngày tải lên : 07/08/2014, 06:20
  • 10
  • 516
  • 0
Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc

Báo cáo toán học: "A generalization of Simion-Schmidt’s bijection for restricted permutations" doc

... number of diagram squares of rank at least m − 2. In particular, π avoids all patterns of A m if and only if every diagram square is of rank at most m − 3. the electronic journal of combinatorics ... components of a diagram form Young diagrams. For a diagram square, its rank is defined to be the number of dots northwest of it. Clearly, connected diagram squares have the s...
Ngày tải lên : 07/08/2014, 07:21
  • 9
  • 342
  • 0
Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot

Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot

... of graphs. A d-fold grid over G is a graph obtained from a d-dimensional rectangular grid of vertices by placing a graph from G on each of the lines parallel to one of the axes. Thus each vertex ... DIMACS, DIMATIA and Renyi tripartite work- shop “Combinatorial Challenges” held in DIMACS in April 2006; we thank the DIMACS center for its hospitality. We also thank Stephen Hartk...
Ngày tải lên : 07/08/2014, 21:21
  • 9
  • 263
  • 0
Báo cáo toán học: "A generalization of generalized Paley graphs and new lower bounds for R(3, q)" pot

Báo cáo toán học: "A generalization of generalized Paley graphs and new lower bounds for R(3, q)" pot

... by a . This equivalence relation gives rise to a partition of A i . In fact, an equivalence class is an orbit of A i under the action of H. Lemma 5 Let k be a special element of ord er s of the ... a, a, ka, −ka, . . . , k s−1 a, −k s−1 a} of A i forms an i nterval under ≺ with a ≺ a ≺ ka ≺ −ka ≺ · · · ≺ k s−1 a ≺ −k s−1 a. (2) Assume that x ∈ a , y ∈ b and...
Ngày tải lên : 08/08/2014, 11:20
  • 10
  • 368
  • 0