Báo cáo toán học: "Permutations generated by a stack of depth 2 and an infinite stack in series" potx
Báo cáo toán học: "Permutations generated by a stack of depth 2 and an infinite stack in series" potx
... that the set of permutations generated by a stack of depth two and an
in nite stack in series has a basis (defining set of forbidden patterns) consisting of
20 permutations of length 5, 6, 7 and ... following are equivalent.
1. σ can be generated by a stack of depth two and an in nite stack.
2. σ can be generated by Algorithm 4.
3. σ...
Báo cáo toán học: " Permutations which are the union of an increasing and a decreasing subsequence" doc
... the increasing and decreasing subsequences
are clearly visible. In the terminology of dimension 2 posets, an increasing
subsequence is a chain and a decreasing subsequence is an anti-chain.
Permutations ... permutations
are exactly those which are the union of an increasing subsequence α and a
decreasing subsequence β thathaveacommonpoint.Insuchapermutation
(σ,say)α...
Báo cáo toán học: "Words restricted by patterns with at most 2 distinct letters" pptx
... f
1 12, 221
(0, k) = 1, f
1 12, 221
(1, k) = k.
Proof. Let α ∈ [k]
n
(1 12, 22 1) and j ≤ n be such that α
1
, . . ., α
j
are all distinct and j
is maximal. Clearly, j ≤ k. Since α avoids {1 12, 22 1} and ... 3
1
3
2
3
3
2
1
2
2
2
3
4
1
→ 3
1
3
2
1
1
1
2
1
3
3
3
2
1
2
2
2
3
4
1
∈ [4]
10
( 121 ).
Thus, 4
1
and 3
1
are inserted in the beginning, the 2
1
is inse...
Báo cáo toán học: "Chromatic number for a generalization of Cartesian product graphs" pot
... nonnegative
integer-valued random variable, Prob[X ≥ 1] ≥
E(X)
max(X)
. Since A[ z] cannot induce more
than |A[ z]| /2 edges, we obtain a lower bound on the probability p that A[ z] contains an
edge by computing
p ≥
1
2k− ... proofs. Set k =
d
6 log d
and assume k ≥ 3. We
randomly g enerate a graph G with vertex set [2k]
d
. As before an element z in [d] ×[2k]
d−1
designa...
Báo cáo toán học: "How frequently is a system of 2-linear Boolean equations solvable" ppsx
... 51–75.
[22 ] B. Pittel, On the largest component of the random graph at a nearcritical stage, J.
Comb. Theory B, 82 (20 01) 23 7 26 9.
[23 ] A. D. Scott and G. B. Sorkin, Solving sparse random instances of ... MAX CUT and
MAX 2- CSP in linear expected time, Comb i natorics , Probability and Computing, 15
(20 06) 28 1–315.
[24 ] V. E. Stepanov, On some feautures of the...
Báo cáo hóa học: " Research Article On a Class of Parametric Transforms and Its Application to Image Compression" ppt
... Analysis,vol .2, no.4,
pp. 394–408, 19 92.
[22 ] S. Minasyan, D. Guevorkian, and H. Sarukhanyan, “On pa-
rameterized fast Haar- and Hadamard-like transforms of arbi-
trary order,” in Proceedings of the 3rd International ... Hadamard-like trans-
forms and a family of slant-like transforms have been intro-
duced in [22 , 23 ].
The general goal of this paper is to analyze...
Báo cáo hóa học: "MAXIMUM PRINCIPLES FOR A CLASS OF NONLINEAR SECOND-ORDER ELLIPTIC BOUNDARY VALUE PROBLEMS IN DIVERGENCE FORM CRISTIAN ENACHE " pptx
... u
nn
are the first and second outward normal derivatives of u
on ∂Ω,andK is the average curvature of ∂Ω. The insertion of (2. 20 )in (2. 19)leadsto
∂Φ
∂n
= 2 fg (a −h)u
n
2( N −1)Kg
2
u
2
n
,on∂Ω. (2. 21)
Clearly, ... existence of classical solutions of the non-
linear equation (1.1), are known and have been well studied in the literature. See, for
instance, Lady
ˇ
zen...
Báo cáo toán học: "On the non-holonomic character of logarithms, powers, and the nth prime function" ppsx
... asymptotic expansion
in a scale that involves logarithms and iterated logarithms; (ii) at least one term in that
expansion is an iterated logarithm or a power of a logarithm with an exponent not in Z
≥0
.
It ... Maxsein, and P. R. Smith, Primzahlpotenzen in rekurrenten Folgen,
Analysis. International Mathematical Journal of Analysis and its Applications 10
(1990),...
Báo cáo toán học: "Riemann-Roch for Sub-Lattices of the Root Lattice An" ppt
... Z
n+1
and the Laplacian lattice L
G
⊂ A
n
.
Remark 1 .2 Laplacian of graphs and their spectral theory have been well studied. The
Laplacian captures information about the geometry and combinatorics ... simplicial distance d
between y and
p. By translation invariance of the simplicial distance function (Lemma 4 .2) , translation
invariance of the Voronoi cells (Lemma 4.5),...
Báo cáo toán học: " Alspach’s Problem: The Case of Hamilton Cycles and 5-Cycles" pps
... [7] and defect 2 [29 ], and hooked m-extended
Langford sequences with defect 1 [28 ] (as a consequence of a more general result).
Theorem 2. 3 (Ba ker [7], Linek and Jiang [28 ], Linek and Shalaby ... decompositions of K
n
into 2- factors in which most of the 2- factors are Hamilton
cycles and the remaining 2- factors are any specified 2- regular graphs on n vertic...
Từ khóa: