Báo cáo toán học: "A short proof of a partition relation for triples" pdf
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 ... journal of combinatorics 10 (2003), #R39 10
[6] J. Skokan and L. Thoma, Bipartite subgraphs and quasi-randomness, accepted to
Graphs and Combinatorics.
[7] E. Szemer´edi, Regular p...
Báo cáo toán học: "On the Proof of a Theorem of P´lfy a" doc
... y.
Proof. As x and y are abelian, and a transitive abelian subgroup is regular [3,
Theorem 4. 2A (v)], we have that fix
x
(B) and fix
y
(B) have order k and x/B, y/B
are cyclic of order ... 2
On the Proof of a Theorem of P´alfy
Edward Dobson
Department of Mathematics and Statistics
Mississippi State University
PO Drawer MA
Mississippi State, MS 39762 USA
dobson@math...
Báo cáo toán học: " The Translational Hull of a Strongly Right or Left Adequate Semigroup" pdf
... call a mapping ρ from S into itself
a right translation of S if (ab)ρ = a( bρ) for all a, b ∈ S. A left translation λ and
a right translation ρ of S are said to be linked if a( λb)= (a )b for all ... that λ
+
is a left translation of S. For any a, b ∈ S,by
Lemma 2.4, we have
λ
+
(ab)=[λ(ab)
+
]
+
· ab =[λ(ab)
+
]
+
· a
+
· ab
=[λ(ab)
+
· a
+
]
+
· ab = {λ[(ab)
+...
Báo cáo toán học: "The Quantum Double of a Dual Andruskiewitsch-Schneider Algebra Is a Tame Algebra" pdf
... we know that the most typical examples of basic Hopf algebras of
finite representation type are Taft algebras and the dual of A( n, d, μ, q), which
as an associative algebra is generated by two ... algebra is a kind of generalization of gener-
alized Taft algebra and of course Taft algebra. Therefore, it is natural to ask
the following question: whether is the quantum double of...
Báo cáo toán học: "The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements" doc
... graphs. Encyclopedia of
Mathematics and its Applications, 66. Cambridge University Press, Cambridge,
1997.
[4] N. Deo, F. Harary and A. J. Schwenk, An Eigenvector Characterization of Cospectral
Graphs ... not Hamiltonian. For the second graph, take H = G. Again
all the vertex-deleted subgraphs of both H and H are Hamiltonian, yet this time H is
also Hamiltonian.”
A different problem...
Báo cáo toán học: "THE AVERAGE ORDER OF A PERMUTATION" ppt
... Handbook of Mathematical Functions,NationalBureauof
Standards, Washington DC, 1972.
2. P. Erd˝os and P. Tur´an, On some problems of a statistical group theory, III,, Acta Math. Acad.
Sci. Hungar. ... Bound.
Call a partition π =(π
1
,π
2
, ,π
s
) minimal if for each sub -partition π
of π we
have m(π
) <m(π). For each partition λ of n choose a minimal sub -partitio...
Báo cáo toán học: "The polynomial part of a restricted partition function related to the Frobenius problem" pptx
... (u
i
is nonzero for only finitely many negative
values of i) then the residue of F (z)isresF (z)=u
−1
. An elementary fact about formal
Laurent series is the change of variables formula for residues: ... derive an explicit
formula for the polynomial part of p
A
.
Let A = {a
1
, ,a
n
} be a set of positive integers with gcd (a
1
, ,a
n
)=1. The
classical Frobenius prob...
Báo cáo toán học: "The arc-width of a graph" ppsx
... 05C83
Abstract
The arc-representation of a graph is a mapping from the set of vertices to the arcs
of a circle such that adjacent vertices are mapped to intersecting arcs. The width
ofsucharepresentationisthemaximumnumberofarcshavingapointincommon.
The ... set of arcs of a base circle, such that adjacent vertices of G are
mapped to intersecting arcs. The width (in a repr...
Báo cáo toán học: "The subword complexity of a two-parameter family of sequences" pps
... question
of whether A has a similar property when s ≥ 2. Perhaps associated with some of the A
sequences for s ≥ 2 is an integer m ≥ 2 such that for all i, j, k, | (A
k+i
A
k
)− (A
j+i
A
j
)|≤
m.
Another ... for every s, t ∈
>0
.
In this paper we investigate an additional property of the class of heap games for
general s, t ∈
>0
: the subword complexity of...
Từ khóa: