Báo cáo toán học: "Permutations without long decreasing subsequences and random matrices" doc
Báo cáo toán học: " Optical sensing nanostructures for porous silicon rugate filters" doc
... it appeared upon acceptance. Fully formatted
PDF and full text (HTML) versions will be made available soon.
Optical sensing nanostructures for porous silicon rugate filters
Nanoscale Research ... interferometers: reflective interferometric Fourier transform
spectroscopy. J Am Chem Soc 2005, 127:11636-11645.
Optical sensing nanostructures for porous silicon rugate...
Báo cáo toán học: " EURASIP Journal on Wireless Communications and Networking" potx
... ad-
dress configuration time (
¯
T
conf
), by simply consider-
ing the two possible configuration situations: (i) there
is on average multi-hop connectivity between the un-
configured vehicle and the ... evaluated the config-
uration time
¯
T
conf
under different traffic conditions
and for different deployment configuration parame-
ters. The traffic conditions are defined by the vehicu-
lar density...
Báo cáo toán học: "Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles" pptx
... 2-cycles.
Perfect factorisations of bipartite graphs and
Latin squares without proper subrectangles
I. M. Wanless
Department of Mathematics and Statistics
University of Melbourne
Parkville ... describe a Latin square using a single line of text. We do this by first reducing
of order 2 is said to be N
2
and a Latin square without proper subsquares is N...
Báo cáo toán học: "HARMONIC FUNCTIONS ON MULTIPLICATIVE GRAPHS AND INTERPOLATION POLYNOMIALS" docx
... harmonic functions on certain
graded graphs: the Young lattice and its generalizations. Such functions first emerged
in harmonic analysis on the infinite symmetric group. Our method relies on multi-
variate ... this section, we deal with an abstract graph G satisfying certain conditions
listed below. In the next sections, concrete examples of G will be considered.
Our assumptions...
Báo cáo toán học: " Permutations which are the union of an increasing and a decreasing subsequence" doc
... terminology of dimension 2 posets, an increasing
subsequence is a chain and a decreasing subsequence is an anti-chain.
Permutations which are the union of an
increasing and a decreasing subsequence
M.D. ... figure the vertical and horizontal lines have the obvious
separation meaning; for example, if R and W are red and white points we
would ha...
Báo cáo toán học: "On the Domination Number of a Random Graph" docx
... V is
either in γ or is adjacent to a vertex in γ.Thedomination number D of G is the size of
a dominating set of smallest cardinality. Domination has been the subject of extensive
research; see ... zero as
n →∞. The treatises of Bollob´as [2] and Janson et al. [8] between them cover the theory
of random graphs in admirable detail. Dreyer [3] generalizes some resul...
Báo cáo toán học: "Permutations avoiding two patterns of length three" ppt
... work
of Mansour [14], who computed generating functions for the number of n-permutations
that avoid two distinct patterns of length three and contain exactly one copy of another
pattern of any length.
It ... avoid two distinct patterns of length three and any
additional set of patterns. We begin by showing how to enumerate these permuta-
tions using generating tre...
Báo cáo toán học: "Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials" pot
... enumerations and
generating functions for permutations which avoid 1243, 2143, and certain additional
patterns. We also give generating functions for permutations which avoid 1243 and
2143 and contain ... permutations which avoid
132, continued fractions, and Chebyshev polynomials of the second kind. In this
paper we prove analogues of some of these results fo...
Báo cáo toán học: "Asymptotics of generating the symmetric and alternating groups" docx
... Univ. Press, 1997).
the electronic journal of combinatorics 12 (2005), #R56 5
Asymptotics of generating the symmetric and
alternating groups
John D. Dixon
School of Mathematics and Statistics
Carleton ... (x, y)ofelementsfromA
n
(respectively, S
n
) such that the parts of Π are the orbits of the group x, y generated by
x and y. Similarly let g
A
(Π) and g...
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, cycles and the pattern 2–13" pdf
... Furthermore, the cycle structure is obviously
preserved.
The seven patterns involved the above theorem share the property that they are
equidistributed with the non-cyclic occurrences. Let Π(p) denote the ... unique pair of N and S steps. (The rightmost
N step to the left of the F step ending at the F step’s level is paired with the leftmost S
step to the right of th...
Báo cáo toán học: "Permutations without long decreasing subsequences and random matrices" doc
... 9:1141–1164, 1959.
[Meh91] Madan Lal Mehta. Random matrices (2
nd
ed.). Academic Press, Boston, 1991.
[Oko00] Andrei Okounkov. Random matrices and random permutations. Internat.
Math. Res. Notices, ... (−z)
k
+ (summands of lower
degree) the above expression takes a simpler form:
the electronic journal of combinatorics 14 (2007), #R11 8
Permutations without long decreasing sub...
Báo cáo toán học: "Permutations with Kazhdan-Lusztig polynomial Pid,w (q) = 1 + q h" pptx
... follows that H
u,π
2
(q) = P
u,w
(q) + q
h
2
E
u
(q) .
Since H
u,π
2
(q) − P
u,w
(q) has nonnegative coefficients and deg P
u,w
(q) ≤ (h − 1) /2 < h − 1,
P
u,w
(q) = 1 + · · · + q
s 1
4
For tho se readers ... w]:
I:
(y + 1) z · · · 1( y + z + 2) · · · (y + 2), (y + z + 2)(y + 1) y · · · 2(y + z + 1)...
Báo cáo toán học: "Traces Without Maximal Chains" pptx
... C
S
|
X
contains a maximal chain of X. Pick a ∈ (A∩B)\D, then B
S
|
X∪{a}
contains an
almost maximal chain of X∪{a} and D∩(X ∪{a}) = ∅. This is a contradiction as A|
X∪{a}
would contain a maximal chain ... C
S
|
X
contains a maximal chain of X.
Pick a ∈ S ∩ (A \ B), then B
S
|
X∪{a}
contains an almost maximal chain of X ∪ {a} and
B ∩ (X ∪ {a}) = ∅. This is a contradiction as A|
X∪{a...
Báo cáo toán học: "Permutations with Ascending and Descending Blocks" pps
... with exactly one descending vertex also has exa ctly one ascending
vertex. Also, conditions (i) and (iii) do not change b ecause they have nothing to do with
whether a block is ascending or descending. ... same block, and if that block is ascending then v
and v
′
are in the same order as their successors, whereas if it is descending they are in
the opposite order.
Now sup...
Từ khóa: