Báo cáo toán học: "Weighted Aztec Diamond Graphs and the Weyl Character Formula" doc
Báo cáo toán học: "Weighted Composition Operators between Different Weighted Bergman Spaces in Polydiscs " pot
... let
Weighted Composition Operators Between Different Weighted Bergman Spaces 257
function theoretic characterizations are given for the boundedness and compact-
ness of the weighted composition operators.
Throughout ... (2006) 255–264
Weighted Composition Operators
Between Different Weighted Bergman
Spaces in Polydiscs
Li Songxiao
*
Department of Math....
Báo cáo toán học: "Weighted Estimates of Multilinear Singular Integral Operators with Variable Calder´n-Zygmund Kernel for the Extreme Cases" ppt
... Journal of Mathematics 34:1 (2006) 51–61
Weighted Estimates of Multilinear
Singular Integral Operators with Variable
Calder´on-Zygmund Kernel for the Extreme Cases
*
Liu Lanzhe
College of Math. ... C
||=m
D
A
BMO
.
This completes the proof of Theorem 1.
Proof of Theorem 2. We only give the proof for case of homogeneous Herz
type Hardy space. Without...
Báo cáo toán học: "ON RAMSEY MINIMAL GRAPHS" doc
... C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for star
forests, Discrete Math. 33 (1981), 227–237.
[4] S.A.Burr, P.Erd˝os, R.J.Faudree, C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for match-
ings,inThe ... Threshold functions for Ramsey properties,submitted.
Key words and phrases: critical graphs, Ramsey theory
1991 Mathematics Subject Classifications: 05D10, 05C80
4
O...
Báo cáo toán học: "Symmetry Breaking in Graphs" pptx
... and φ cannot be
distinguishing. This contradicts our assumption that φ is an r-distinguishing
labeling. ✷
We remark that this proves that the largest integer in D(S
3
)is3,since
the subgroups ... the goal is to minimize the number of colors used.
Consequently we define the distinguishing number of a graph G by
D(G)=min{r | G has a labeling that is r-distinguishing}.
The original key problem...
Báo cáo toán học: "Ramseyan Properties of Graphs by Ermelinda DeLaVina" doc
... the class of all 4-chromatic graphs.
The structure of the red graph is obvious by Corollary, but we do not know
which graphs can occur as blue graphs and what are the properties of graphs in
which ... on the Wall, a list of conjectures of Graffiti.
Ramseyan Properties of Graphs
by
Ermelinda DeLaVina
delavina@math.uh.edu
Siemion Fajtlowicz
siemion@math.uh.edu
Uni...
Báo cáo toán học: " Orthogonal Colorings of Graphs" ppt
... The notion of orthogonal colorings is strongly related to the
notion of orthogonal Latin squares. The orthogonal chromatic number of G, denoted by
Oχ(G), is the minimum possible number of colors ... 2, 3, 1, 3).
The notion of k -orthogonal colorings is strongly related to the notion of orthogonal Latin
squares. Recall that two Latin squares L
1
,L
2
of order r are...
Báo cáo toán học: "Nim-Regularity of Graphs" docx
... parts are all of size one.
Alternately, the complement of such a graph either has no edges or consists of the the
disjoint union of three or fewer complete graphs.
Proof. The complement of K
−
5
is ... similar proofs for complexes of
dimension 2 and higher. We conjecture that the answer is “yes,” but the complexity
of the proof would be astronomical, even for dimension 2. Hidden...
Báo cáo toán học: "Parking functions, empirical processes, and the width of rooted labeled trees" pps
... 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 walk
From ... initially
(0). Then, at each of the n following stages of the BFS, the vertex x at the head of the
queue is removed from the queue, and all “new” neighbor...
Báo cáo toán học: "Weighted Aztec Diamond Graphs and the Weyl Character Formula" doc
... be the product
of the weights of all the edges in the matching. Then the weight of the Aztec graph A is
(A)=
m
(m), the sum over all matchings of A. Using the tilted version of the Aztec
diamond ... 1)-order Aztec diamond
subgraphs A
NW
, A
SW
,andA
SE
.LetA
mid
be the (n − 2)-order Aztec diamond subgraph
of A lying directly in the middle, concentric wi...
Báo cáo toán học: "Distinguishing numbers for graphs and groups" docx
... |Γ|≤m! and the subset {y
1
, ,y
j
} satisfies
1. φ(y
i
)=i for each i,
2. y
i+1
is in Γ
i−1
.y
i
for each i from 2 to j − 1, and y
1
is in Γ
j−1
.y
j
,
then j ≤ m and |Γ
i−1
.y
i
|≥j − i + 2for each ... shows this and two
other graphs with the same automorphism group and demonstrates that all three have
different distinguishing numbers. This example disproves a conjecture in [...
Báo cáo toán học: "Compression of root systems and the E-sequence" pptx
... 4
2
These are the simple roots of E
8
, which span the E
8
lattice. They correspond to the
vertices v
1
, . . . , v
8
of Dyn(E
8
), in the order shown on the right. This ordering of simple
the ... reflect the structure of the underlying root system.
The main examples are E
6
and E
7
.
1 Introduction
The primary goal of this paper is to provide a convenient way...
Báo cáo toán học: "Fixing Numbers of Graphs and Groups" pptx
... the transposition of the remaining two vertices. This implies that
the only graphs which have fix(G) = n−1 are the complete graphs and the empty graphs.
On the other hand, the graphs with fix(G) ... e),
where v and e are a vertex and an edge of G, and v and e are incident. Inf(G) has an
edge between (v
1
, e
1
) and (v
2
, e
2
) if v
1
= v
2
or e
1
= e
2
. We denote the...
Báo cáo toán học: "Dense H-free graphs are almost (χ(H) − 1)-partite" docx
... (G
[X
1
]) εn, v(N) >
3r−4
3r−1
n + 2εn. Now consider u ∈ N. We have
d
N
(u) > v(N) −
3
3r − 1
− 4ε
n
> v(N) −
3
3r − 1
− 4ε
3r − 1
3r − 4
v(N) >
3r − 7
3r − 4
+ 4ε
v(N) .
By ... |V
1
| −
n
3r−1
choices for v
1
. At the second step we
have more than
|V
2
| −
n
3r − 1
−
3
3r − 1
− 4ε
n + (|V
1
| −...
Báo cáo toán học: "Weighted spanning trees on some self-similar graphs" pot
... Yang, Spanning Trees on the Sierpinski Gasket,
J. Stat. Phys., 126, No. 3, (2007), 649–667.
[7] D. D’Angeli, A. Donno and T. Nagnibeda, Partition functions of the Ising mo del on
some self-similar ... functions of the spanning trees in the directional model and in the Schreier model,
are different.
3 Spanning trees on the Schr eier graphs of the Hanoi
Towers group
In this...
Báo cáo toán học: "Self-dual Planar Hypergraphs and Exact Bond Percolation Thresholds" doc
... hypergraph s,
leading to definitions of planar hypergraphs and self-dual planar hypergraphs. T here
exist infinitely many self-dual planar 3-uniform hypergraphs, and, as a consequence,
there exist ... Self-dual Planar Hypergraphs and
Exact Bond Percolation Thresholds
John C. Wierman
∗
Department of Applied Mathematics and Statistics
Johns Hopkins University
wierman@jh...
Từ khóa: