Sciweavers

1215 search results - page 201 / 243
» Combinatorics
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 12 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
DCG
2010
77views more  DCG 2010»
14 years 12 months ago
Oriented Mixed Area and Discrete Minimal Surfaces
Abstract. Recently a curvature theory for polyhedral surfaces has been established which associates with each face a mean curvature value computed from areas and mixed areas of tha...
Christian Müller, Johannes Wallner
DAM
2008
123views more  DAM 2008»
14 years 12 months ago
Ultrametrics, Banach's fixed point theorem and the Riordan group
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
Ana Luzón, Manuel A. Morón
EJC
2010
14 years 12 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
DM
2008
127views more  DM 2008»
14 years 12 months ago
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
David Cariolaro