Báo cáo toán học: " h∗-vectors, Eulerian polynomials and stable polytopes of graph" pdf
Báo cáo toán học: " h∗-vectors, Eulerian polynomials and stable polytopes of graph" pdf
... subcomplex
of the boundary complex of a simplicial polytope. Sections 4 and 5 include applications of
Theorem 1.1 to order polytopes of (not necessarily graded) posets and to stable polytopes
of perfect ... collection of convex polytopes in R
N
such that (i) any face of a
polytope in F is also in F and (ii) the intersection of any two polytopes in F is a (possi...
Báo cáo toán học: "A note on polynomials and f -factors of graphs" docx
... upper rank of the hypergraph – that is, the size of the largest
hyperedge.
The proofs of Theorems 1 and 2 involve the use of the combinatorial nullstellensatz [2].
the electronic journal of combinatorics ... #N22 2
A note on polynomials and f-factors of graphs
Hamed Shirazi Jacques Verstra¨ete
Dept of Combinatorics & Optimization Dept of Mathematics & Statistics...
Báo cáo toán học: "Weakly Self-Avoiding Words and a Construction of Friedman" ppt
... leaf, and we print it out. If q is weakly self-avoiding
then we append q0andq1 to the end of the queue.
the electronic journal of combinatorics 8 (2001), #N2 2
Weakly Self-Avoiding Words and a ... Words and a Construction of
Friedman
Jeffrey Shallit
∗
and Ming-wei Wang
Department of Computer Science
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1
shallit@graceland.uw...
Báo cáo toán học: "Parking functions, empirical processes, and the width of rooted labeled trees" pps
... n
.
One of the motivations of Odlyzko and Wilf, when they study the width of labeled
trees, is to give a tight estimate for the average bandwidth of this class of tree.
2 The breadth first search random ... Bandwidths and profiles of trees. J. Comb. Theory,
Ser. B 42, 348-370.
[22] V.V. Petrov, (1975) Sums of independant random variables. Springer .
[23] J. Pitman, (1998) En...
Báo cáo toán học: "A recurrence relation for the “inv” analogue of q-Eulerian polynomials" ppsx
... recurrence relation for the “inv” analogue of
q -Eulerian polynomials
Chak-On Chow
Department of Mathematics and Information Technology,
Hong Kong Institute of Education,
10 Lo Ping Road, Tai Po, ... degree n. We give an algebraic proof and a
combinatorial proof of the recurrence relation.
1 Introduction
Let S
n
denote the symmetric group of degree n. Any element σ of S
n
i...
Báo cáo toán học: "RESTRICTED PERMUTATIONS, CONTINUED FRACTIONS, AND CHEBYSHEV POLYNOMIALS" pot
... CONTINUED
FRACTIONS, AND CHEBYSHEV POLYNOMIALS
Toufik Mansour
∗
and Alek Vainshtein
†
∗
Department of Mathematics
†
Department of Mathematics and Department of Computer Science
University of Haifa, Haifa, ... ,i
j
)isanoccurrenceof12 j in π then either i
j
<l,andsoit
is also an occurrence of 12 j in π
,ori
1
>l, and so it is also an occurrence of
12 j in π
,or...
Báo cáo toán học: "321-polygon-avoiding permutations and Chebyshev polynomials" pps
... 1,i
k−1
),
Part (d) follows from here as in the proof of (4) and (5). Finally, (a)–(d) yield (e). ✷
2.4 Proofs of Theorem 5 and Corollary 6
Theorem 17 For k ≥ 3 and s ≥ 1, define L
k
n
(s)=
s
j=0
(−1)
j
s−j
j
f
k
(n−j). ... S
n
whose Kazhdan-Lusztig and Poincar´e polynomials,
and the singular loci of whose Schubert varieties have fairly simple formulas and descrip-
tio...
Báo cáo toán học: "Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials" pot
... #R7 22
and 2143 and has π(i +1)=n,exactlyoneof1, 2, ,n− i appears to the left of n in
π.(Iftwoormoreof1, 2, ,n−i appeared to the left of n then two of these elements,
together with n and some ... techniques of Bandlow and Killpatrick [2] and Bandlow, Egge, and
Killpatrick [1] to compute this bijection directly.
To define our bijection, we first need to introduce some notatio...
Báo cáo toán học: "H-free graphs of large minimum degree" doc
... the proof of the lemma.
Lemma 2.7 Let s be a fixed integer and let U
1
, ,U
k
be subsets of typical vertices of sizes
|U
1
| =2s and |U
2
| = = |U
k
| = s, which belong to k different parts of the ... o(n
2
) edges.
The proof of this statement is a standard application of Szemer´edi’s Regularity Lemma
and we refer the interested reader to the comprehensive survey of Koml´os...
Báo cáo toán học: "A combinatorial representation with Schr¨der paths of o biorthogonality of Laurent biorthogonal polynomials" pps
... a
R
k
b
R
k+1
and a
L
k
b
L
k+1
peaks of level
k. Similarly, we call b
R
k
a
R
k−1
and b
L
k
a
L
k−1
valleys of level k. Let Π
SnP
and Π
SnV
be the sets
of Schr¨oder paths without peaks and without ... representation in terms of Schr¨oder paths and other weighted
plane paths are given of Laurent biorthogonal polynomials (LBPs) and a linear
functional with which LBPs ha...