Sciweavers

434 search results - page 38 / 87
» sum 2007
Sort
View
EJC
2010
13 years 7 months ago
Bijections for a class of labeled plane trees
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
Nancy S. S. Gu, Helmut Prodinger, Stephan Wagner
EJC
2010
13 years 7 months ago
A q-enumeration of alternating permutations
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...
Matthieu Josuat-Vergès
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
13 years 7 months ago
A feedback stabilization and collision avoidance scheme for multiple independent non-point agents,
A navigation functions' based methodology, established in our previous work for centralized multiple robot navigation, is extended to address the problem of decentralized nav...
Dimos V. Dimarogonas, Savvas G. Loizou, Kostas J. ...
DM
2007
74views more  DM 2007»
13 years 7 months ago
Parameters for which the Griesmer bound is not sharp
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
Andreas Klein, Klaus Metsch
ARSCOM
2005
92views more  ARSCOM 2005»
13 years 7 months ago
Binary Strings Without Odd Runs of Zeros
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
Ralph Grimaldi, Silvia Heubach