Báo cáo toán học: "An improved tableau criterion for Bruhat order" ppt
Báo cáo toán học: "An improved tableau criterion for Bruhat order" ppt
... of Deodhar’s criterion, which is valid for all Coxeter groups.
1 Introduction
The classical tableau criterion for Bruhat order on
S
n
says that
x
≤
y
if and only if
x
i,k
≤
y
i,k
for all 1
≤
i
≤
k
≤
n
−
1, ... x
k
<x
k+1
< <x
r
(for if
x
i,k
>x
k
then x
i−1,k−1
= x
i,k
and hence y
i−1,k−1
≤ y
i,k
<x
i,k
= x
i−1,k−1
which contradicts
An improved tableau crite...
Báo cáo toán học: "An improved bound on the minimal number of edges in color-critical graphs" pot
... odd cycles is called a Gallai tree,aGallai forest is a graph all of whose
connected components are Gallai trees. A k-Gallai forest (tree) is a Gallai forest (tree), in
which all vertices have ... are done, therefore we may assume that
n
L
> 0.
An improved bound on the minimal number of edges in
color-critical graphs
Michael Krivelevich
∗
School of Mathematics,
Institute for Advanced .....
Báo cáo khoa học: "An Improved Error Model for Noisy Channel Spelling Correction" ppt
... that assigns uniform
probability to all words in the dictionary. In
Table 1 we show K-best results for different
maximum context window sizes, without
using positional information. For instance,
the ... channel model
for spelling correction. This paper
describes a new channel model for
spelling correction, based on generic
string to string edits. Using this model
gives significant per...
Báo cáo toán học: " AN EXACT PERFORMANCE BOUND FOR AN O(m + n) TIME GREEDY MATCHING PROCEDURE" pptx
... for 1 ≤ r ≤
2n+2
5
, (3)
f(r)=g(r) for r =
2n+2
5
, (4)
g(r) ≥ f(r) for r ≥
2n+2
5
. (5)
Define b(n, r)by
b(n, r)=
f(n, r)ifr≤
2n+2
5
,
g(n, r)ifr≥
2n+2
5
.
(6)
For fixed n ≥ 2, b(r)=b(n, r) is ... Also,
b(n, r) = max(f(n, r),g(n, r)) when n ≥ 2 and r ≥ 1. (7)
4 Performance Guarantees
The following performance guarantee for the greedy matching procedure is the main
result of the pap...
Báo cáo toán học: "An Ehrhart Series Formula For Reflexive Polytopes" pptx
... that
p
q
∈
∩
i
ˆ
H
i
∩
∩
j
ˆ
K
j
∩ t (P ⊕ Q).
For the “⊇” containment, let
p
q
∈
∩
i
ˆ
H
i
∩
∩
j
ˆ
K
j
∩ t (P ⊕ Q). We know
that p · a
i
≥ 0 for all i, q · b
j
≥ 0 for all j and (from the proof of ... {H
i
}
k
i=1
and {K
j
}
l
j=1
are halfspaces of the form H
i
=
y ∈ R
d
P
: y · a
i
≥ 0
for some a
i
∈ R
d
P
and K
j
=
u ∈ R
d
Q
: u · b
j
≥ 0
for some b...
Báo cáo toán học: "An elementary proof of the hook formula" ppt
... probabilistic proof of
a formula for the number of Young tableaux of a given shape. Adv. in Math.,
31(1):104–109, 1979.
[GT96] Adriano M. Garsia and Glenn Tesler. Plethystic formulas for Macdonald q, ... shifted tableaux case.
2 Acknowledgements
The author is grateful to Adriano Garsia for pointing out the q, t-analog of the hook
formula in [GT96]. This suggested that the recursion for...
Báo cáo toán hoc:" An Edge-Minimization Problem for Regular Polygons " pps
... following:
Proposition 4 The smallest edge-sharing necklace for an n-gon is a
3-cycle for n ≡ 0 (mod 6)
4-cycle for n ≡ 2, 4 (mod 6)
6-cycle for n ≡ 1, 3, 5 (mod 6).
2.7 Classification of 4-cycle ... 1
f − 1
.
Therefore, maximizing f for fixed v is equivalent to minimizing e/(f − 1). In the next
subsection we will show that for each n there is a minimum length c
min
∈ {3,...
Báo cáo toán hoc:" An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane" pps
... particular,
χ
Z
S
n
(q) = (q − n + 1)
n
for q n − 1,
χ
mod
S
n
(q) = q(q − n)
n−1
for q > n,
χ
∗
S
n
(q) = q(q − n)
n−1
.
As we mentioned, the formula for χ
∗
S
n
(q) is already known from ... expressions G − [(G\e) − (G/e)] for links e of edge minors G ∈ M(Γ
0
) and all
expressions G for edge minors with loops, because
¯
f maps them all to 0 ∈ C
0
(G) due to
(4.2). Therefore,...
Báo cáo toán học: "The edge-count criterion for graphic lists" doc
... and s form the degree lists for a bipartite p-graph if and only
if they satisfy the Bipartite Edge-Count Criterion that for all I ⊆ [m] and J ⊆ [n],
i∈I
r
i
+
j∈J
(pm − s
j
) p|I| |J|.
For ... satisfies the Edge-Count Criterion (ECC) for p- graphs
if for all I, J ⊆ [n] with I ∩ J = ∅,
i∈I
d
i
+
j∈J
[p(n − 1) − d
j
] p|I| |J|. (*)
We call this the Edge-Count Criterion...