Báo cáo toán học: "Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes" pptx
Báo cáo toán học: "Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes" pptx
... to k-ary trees in the paper C. Deugau and
F. Ruskey, Complete k-ary Trees and Generalized Meta-Fibonacci Sequences, Fourth
Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combina-
torics ... level in certain infinite sequences of binary trees,
restricted compositions of an integer, and binary compact codes. For this family of
meta-Fibonacci sequences...
Báo cáo toán học: "Generalized Cauchy identities, trees and multidimensional Brownian motions. Part I: bijective proof of generalized Cauchy identities ´ Piotr Sniady" pot
... 11.
while orders < and
do not coincide on {x ∈ T : x R} do1
D ←the minimal element (with respect to <) such that R ≺ D and orders <2
and do not coincide on {x ∈ T : R x and x ≤ D} ;
U ← ... R S and such that on the set
{x ∈ T
σ
: R x and x ≤ S} the orders < and coincide. Also, D is as prescribed by
line 2 of SmallBijection.
Let us denote by (σ
,<) the pa...
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx
... 417-433.
[8] T. Brylawski and J. Oxley, The broken-circuit complex: Its structure and factorizations,Eur.
J. Comb. 2 (1981), 107-121.
[9] T. Brylawski and J. Oxley, The Tutte Polynomial and its Applications, ... antimatroid and let (C, ⊆) be
the lattice of convex sets. Then
β(A)=−
C∈C
µ(∅,C)|C|.
Proof. This follows from Theorem 1 of [19] and the definition of β(A).
Recall that if...
Báo cáo toán học: " Crooked Functions, Bent Functions, and Distance Regular Graphs" pptx
... size |V |/2, and K = {x + y | x, y ∈ H}.
Fix also any element h ∈ H,andletK
0
={h+x|x∈H}.Hbeing sum-free means
that H ∩ K = ∅, and since |K|≥|K
0
|=|H|=|V|/2, we have |K| = |V |/2, and
K = K
0
= ... a
connection between crooked functions and bent functions.
1 Crooked functions and bent functions
Let V and W be n-dimensional vector spaces over GF(2), and Q : V → W any
mapping. We...
Báo cáo toán học: "Compression of root systems and the E-sequence" pptx
... Orthogonality and partial order in Γ
7
.
More generally, one can compare α ∈ ∆
+
s
and β ∈ ∆
+
t
by considering ˜α and
˜
β.
Theorem 3.4.4. Suppose α ∈ ∆
+
s
and β ∈ ∆
+
t
, and s ≤ t. Then α < β if and ... coordinates of x are
non-zero, say x
i
and x
i
, and exactly two coordinates of y are non-zero, say y
j
and y
j
.
If {i, i
} ∩ {j, j
} = ∅ then (x|y) = 0 and...
Báo cáo toán học: "Stapled Sequences and Stapling Coverings of Natural Numbers" doc
... coverings, and to Prof. Lev B. Levitin for useful discussions and
comments. Special thanks are due to the referee for carefully reading the
paper and suggesting thoughtful improvements and to Prof. ... N,
the only r ∈ A
p
, r =2N is odd and, hence, r ∈ A
2
and A
p
can be removed
from W
I
.Thus,thenumber2N can be deleted without violating the stapling
condition, and stapled S
2N−...
Báo cáo toán học: "DERIVATIVE POLYNOMIALS, EULER POLYNOMIALS, AND ASSOCIATED INTEGER SEQUENCES" pps
... as discussed in [4] and
[3]; see also [13]. In this section we show how to compute P
n
(u)andQ
n
(u)foru=1,
√
3,
and 1/
√
3 from the tangent and secant numbers.
Set u = 1 and consider the coefficient ... of the polynomials P
n
and Q
n
(Theorem 6.1), and use them together with the
computations of §3tofindE
n
(p/q) for 0 ≤ p ≤ q and q =2,3,4 and 6. We also write the
Springer and...
Báo cáo toán học: "Tournament Sequences and Meeussen Sequences" pot
... two trees, and therefore a unique bijection between tournament sequences
and Meeussen sequences which respects the ideas of extending or truncating a sequence.
To better understand Meeussen sequences, ... (1995), 313–316.
[12] West, J. Generating trees and the Catalan and Schr¨oder numbers. Discrete Math.
146 (1995), 247–262.
[13] West, J. Generating trees and forbidden subse...
Từ khóa: