Báo cáo toán học: "Matrix-free proof of a regularity characterization" doc
Báo cáo toán học: "The dual of a subnormal operator " pps
... class="bi x0 y2 w1 h 3" alt =""
Báo cáo toán học: "Some applications of a technique for constructing reflexive operator algebras " pdf
... class="bi x0 y1 w3 h 4" alt =""
Báo cáo toán học: "Strong Insertion of a Contra - Continuous Function" ppt
... Insertion of a
Contra - Continuous Function
*
Majid Mirmiran
Department of Mathematics, University of Isfahan
Isfahan 8174 6-7 3441, Iran
Received February 22, 2004
Revised October 20, 2005
Abstract. ... topological spaces that Λ−sets are open [3].
A real-valued function f defined on a topological space X is called contra-
continuous if the preimage of every open s...
Báo cáo toán học: "RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS" pdf
... 3).
We use the fact that there is a bijection between rhombus tilings of the hexagon and
perfect matchings of the hexagon s ‘dual’ graph G (see Figure 2 for the construction of
the dual graph and Figure ... are missing. In particular, Problem 4 of [8] asks for
a formula for the number of rhombus tilings of a regular hexagon, where two of the
six ce...
Báo cáo toán học: "Critical subgraphs of a random graph" docx
... such that at least one pair of the configuration will
contain a point from each of T
1
u
,T
v
, and at least one pair will contain a point from each
of T
2
u
,T
v
, with probability at least 1 ... Molloy. A gap between the appearances of a k-core and a (k+1)-chromatic graph.
Random Structures and Algorithms, 8 (1996), 159 - 160.
[21] M. Molloy and B. Reed. A critical poin...
Báo cáo toán học: "The Multiplicities of a Dual-thin Q-polynomial Association Scheme" doc
... The Multiplicities of a Dual-thin Q-polynomial
Association Scheme
Bruce E. Sagan
Department of Mathematics
Michigan State University
East Lansing, MI 44824-1027
sagan@math.msu.edu
and
John S. Caughman, ... Springer-
Verlag, Berlin, 1989.
[3] J. S. Caughman IV, The Terwilliger algebra for bipartite P -andQ-polynomial asso-
ciation schemes, in preparation.
[4] J. S. Caughman IV, S...
Báo cáo toán học: "The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene" pot
... Macdonald as a second special case.
The main purpose of this paper is to give a planarized construction and proof for
the bijection of Edelman and Greene between reduced words and certain pairs of ... Similarly a partial arrangement is an
isomorphism class of simple marked partial arrangements of pseudolines.
Goodman and Pollack [8] described a one-to-many corre...
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: "The Rank of a Cograph" pptx
... and Motivation
The rank of a graph X is the rank of its adjacency matrix A( X). As the rank is such
a fundamental algebraic concept, the relationship between the structure of a graph and
its rank ... of other matrices associated with a
graph, or about the ranks of certain graphs over finite fields (for examples, see Godsil &
Royle [7]).
In calculating the rank...
Báo cáo toán học: "Matrix-free proof of a regularity characterization" doc
... journal of combinatorics 10 (2003), #R39 6
2.1 An Invariant of Szemer´edi’s Regularity Lemma
Let G =(U ∪ V, E) be a bipartite graph. For an integer t, we define a t-equitable
partition V (G) as a ... state, up front, that we always
assume m is a sufficiently large integer.
Our proof of Theorem 1.5 uses a well-known invariant formulation of Szemer´edi’s
Regularity Lemma....
Báo cáo toán học: "Depth reduction of a class of Witten zeta functions" pdf
... proof.
Lemma 2.4. Every Witten multiple zeta value of the form ζ
sl(4)
(a, b, 1, d, 0, 1) with a, b, d ∈
N can be expressed as a rational linear combination of products of single and double Euler
sums ... multiple zeta value of the form ζ
sl(4)
(a, b, c, d, 0 , f ) with
a, b, c, d, f, ∈ N can be expressed as a rational linear combination of products of single and
dou...
Báo cáo toán học: "Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover" pdf
... known that the matching polynomial of a graph G is equal to the charac-
teristic polynomial of G if and only if G is a forest. To prove Theorem 3.3, the following
characterization of θ-essential vertices ... joined to
at least two θ-essential vertices.
the electronic journal of combinatorics 16 (2009), #R81 5
Maximum Multiplicity of a Root of the Matc...
Báo cáo toán học: "Combinatorial proof of a curious q-binomial coefficient identit" ppt
... (3) and (4) are obviously equivalent. Recently, an elegant combinatorial
proof of (4) was given by Shattuck [12], and a little complicated combinatorial proof of
(2) was provided by Chen and Pang ... (4).
In this paper, motivated by the two aforementioned combinatorial proofs for q = 1, we
propose a combinatorial proof of (5) within the framework of partition theory by apply...
Báo cáo toán học: "Automorphism groups of a graph and a vertex-deleted subgraph" pot
... group of a graph G, and another group Γ
2
is the
∗
Department of Mathematics, Unive rsity of Nebraska, Lincoln, Nebraska, 68688-0130, USA;
hartke@math.unl.edu. This author was supported in part ... labeling algo-
rithm. In Communicating Mathematics, volume 479 of Contemporary Mathe-
matics, pages 99–111. American Mathematical Society, 2009.
[LS03] Josef Lauri and Raffaele Scape...
Báo cáo toán học: "Further applications of a power series method for pattern avoidance" ppt
... research report TH 94-04.
the electronic journal of combinatorics 18 (2011), #P134 7
Further applications of a power series method
for pattern avoidance
Narad Rampersad
∗
Department of Mathematics ... probabilistic approach to pattern avoidance using the Lov´asz local lemma (see [2, 9]).
For pattern avoidance it may even be more powerful than the local lemma in cert...
Từ khóa: