... the convergence of contractive function.
2 Main results
Notations: Throughout t his paper, we set R
τ
=[τ,+∞), τ Î R. C stands for a generic
positive constant, depending on Ω, but independent of ... for autonomous and nonautonomous 3D Navier-Stokes-Voight equations. Discret Contin
Dyn Syst Ser B. 2011(6-3), 985–1002 (2011)
12. Babin, AV, Vishik, MI: Attractors of Evolutionary Equati...
... definition of S(i, d) (1 ≤ r ≤ i).
Proof. In the definition of S(i, d) let the set of vertices of σ
r
be F ⊎{v}. Then the number
of j-faces in S(i, d) containing v is f
j−1
(S(i, d−1)), of those containing ... details.
• Conjecture 1.4 for flag homology spheres of dimension ≤ 4 holds.
Gal showed nonnegativity of the γ-polynomial in this case [8], based on the Davis-Okun
proof [...
... 1994
ABSTRACT
Twenty-one years after the publication of A Handbook of Integer Sequences, a greatly
expanded version of this collection can now be accessed by electronic mail.
1. The on- line version
A Handbook of ... original
entries. The purpose of this note is to announce that the new version of the collection,
The On- Line Encyclopedia of Integer Sequences,
can now be acces...
... the
above construction yields a bijective proof of their result.
3 Variations on the inversion statistic
In this section we introduce analogs of the inversion statistic on permutations correspond-
ing ... observations of this section to Schur functions.
One possibility is to consider the following generalization of the complete homogeneous
symmetric function. Let ϕ
f
be the homomo...
... by
23
the number of horizontal contacts is maximal after application of p
3
. Moreover the number
of vertical contacts between two adjacent columns is also maximal after application of p
3
.
The ... all the
polyominoes of area n. The perimeter P (c) of a polyomino c is the number of unit edges
of the dual lattice (
+1/2)
2
which belong only to one of the unit squares of c....
... eigenvectors of A − E(A). Not quite a bound on
the first eigenvector of A, the bounds are in addition weaker. One gets an upper bound
of O(
log
c
n
√
n
) on the absolute value on the entries of the ... npu(1 − (2α + 2)∆)
This contradicts Equation 14.
the electronic journal of combinatorics 16 (2009), #R131 9
Figure 1: Construction of a Quasi-random graph depicting tightness...