Báo cáo toán học: "Explicit enumeration of triangulations with multiple boundaries" pps
Báo cáo khoa học: "Discourse Processing of Dialogues with Multiple Threads" pot
... Implications of this model of Attentional
State are explored more fully in (Rosd 1995).
3 Discourse Processing
We evaluated the effectiveness of our theory of dis-
course structure in the context of ...
ture of discourses with multiple threads in a per-
spicuous manner. While this study only explores
the structure of negotiation dialogues, its results
have implica...
Báo cáo toán học: "A generalization of dissipativity and positive semigroups " ppsx
... class="bi x0 y0 w3 h 1" alt =""
Báo cáo toán học: "An extension of a criterion for unimodality" pps
... zeros: if all the zeros of a polynomial are
real and negative, then it is log concave and therefore unimodal [5]. A simple criterion
for unimodality was established in [2]: if a
j
is a nondecreasing ... Log-concave and unimodal sequences in Algebra, Combinatorics and Ge-
ometry: an update. Contemporary Mathematics, 178, 71-84, 1994.
[4] Stanley, R.: Log-concave and unimodal sequ...
Báo cáo toán học: "A Proof of the Two-path Conjecture" pps
... vertices. The cycle C
6
is the edge-disjoint union of two paths of length 3 with common endpoints. In the first
case, the graph has twelve paths of length 3; in the second there are six such paths.
The ... vertex, then the graph has a third subgraph
that is also a path of length n. For example, the complete graph K
4
is an edge-disjoint
union of two paths of length...
Báo cáo toán học: "Parking functions of types A and B" ppsx
... is a natural action of S
n
on the set of parking functions, which
permutes the a
j
. There is also an action of S
n
on the set of factorizations, which goes
as follows. We define an action of ... local action of S
n
on V
NC
n+1
in [S], Proposition 4.1. Thus we have
two actions of S
n
, one on factorizations and one on parking functions, and the map we are
looking at is...
Báo cáo toán học: "A partition of connected graphs Gus Wiseman" pps
... we
have
a
G
=
Q⊆G
connected
(−1)
|Q|
= η
G
(−1) =
R
increasing
G connected
v∈V −{r}
(−1)
the electronic journal of combinatorics 12 (2005), #N1 5
A partition of connected graphs
Gus Wiseman
gus@ nafindix.com
Submitted: ... component of G.
If G is a rooted connected graph on V with root r, we will call the set partition
π = s(G|
V −{r}
)ofV −{r} the depth-first par...
Báo cáo toán học: "(−1)–enumeration of self–complementary plane partitions" ppsx
... (−1)–enumeration of self–complementary plane partitions in
terms of SC(a, b, c), the ordinary enumeration of self–complementary plane partitions.
Theorem 2. The enumeration of self–complementary plane partitions ... of self–complementary plane partitions is needed.
It will also be used as a step in the proof of the (−1)–enumeration.
Theorem 1 (Stanley [14]). The nu...
Báo cáo toán học: "Splitting Numbers of Grids Dwight Duffus" pps
... pleasing
characterization of these integer vectors. We do have a couple of observations about this
the electronic journal of combinatorics 12 (2005), #R17 29
Splitting Numbers of Grids
Dwight Duffus
Mathematics ... 1)y
k
+1.
This completes the proof of (7) and verification of the upper bound. The proof of
Theorem 1 is complete.
Note that, by (7) and the remark following the...
Báo cáo toán học: "Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums" docx
... journal of combinatorics 12 (2005), #R29 17
Asymptotic Enumeration of Dense 0-1 Matrices with
Equal Row Sums and Equal Column Sums
E. Rodney Canfield
∗
Department of Computer Science
University of ... 0-1 matrices with prescribed line sums, in Enumera-
tion and Design, (Academic Press, 1984) 225–238.
[14] B. D. McKay and X. Wang, Asymptotic enumerat...
Báo cáo toán học: "An analogue of the Thue-Morse sequence" ppsx
... corresponding to the
divisibility order of the integers . The relationship between the Măobius inversion formula and Riemanns
zeta function motivates the use of the name “zeta matrix” in the context of a ... nothing but the
exponential of the incidence matrix of the Hasse diagram of this poset. We prove
that the corresponding Măobius matrix has a simple expre...
Báo cáo toán học: "Explicit enumeration of triangulations with multiple boundaries" pps
... the problem of enumeration of planar near -triangulations,
solved by Tutte in [9] using the method of recursive decomposition. The same method,
applied to the problem of enumeration of triangulations ... obtained
hole with two edges of an additional triangle. This operation provides a bijection between
the complete rooted triangulations with n edges, and triangulatio...
Báo cáo toán học: "Satisfying states of triangulations of a convex n-gon" pot
... converse also holds for planar triangulations: if we delete an intersecting set of edges
from a planar triangulation, we get a bipartite graph and its bipartition defines a pair of
satisfying states.
We ... states of triangulations of a convex n-gon
A. Jim´enez
∗
Departamento de Ingenier´ a Matem´atica
Universidad de Chile
ajimenez@dim.uchile.cl
M. Kiwi
†
Departament...
Báo cáo toán học: "The Enumeration of Sequences with Restrictions on their Partial Sum" docx
... electronic journal of combinatorics 17 (2010), #R160 16
The Enumeration of Sequences
with Restrictions on their Partial Sums
Stephen Suen
Department of Mathematics and Statistics
University of ... up one,” and each “−t” meaning “go right one, g o down t.” We study the number
of paths with conditions on their part ia l sums, on their number of crossings, cr...
Báo cáo toán học: "Asymptotic enumeration of labelled graphs by genus" docx
... Asymptotic enumeration of labelled graphs by genus
Edward A. Bender
Department of Mathematics
University of California at San Diego
La Jolla, CA 92093-0112, USA
ebender@ucsd.edu
Zhicheng Gao
∗
School of ... number of labelled k-connected graphs of orientable
genus g for k ≤ 3.
1 Introducti on
The exact enumeration of various types of maps on the sphere (or, equiv...
Báo cáo toán học: "Critical exponents of words over 3 letters" pps
... example, δ(0110) = 110.
Lemma 1. Let L be the set F act(à(A
3
)) of all subwords of the words in à (A
3
). Let
α ∈]7/4, 2[ and v ∈ A
∗
3
, such that:
- abcbabcv ∈ L
- abcbabcv is α-free.
Suppose ... à.
Proposition 2. Let w be a word over A
3
, and u a subword of µ(w). If |u| ≥ 1 8 , then,
there exists a unique x ∈ A
3
, a unique y ∈ A
3
, and there exist some unique s,...