Search Sciweavers | Sciweavers

We provide bounds for the product of the lengths of distinguished shortest paths in a finite network induced by a triangulation of a topological planar quadrilateral.

Sa'ar Hersonsky

claim paper

Read More »

14

click to vote

EJC
2008

161views Information Technology» more EJC 2008»

Labeled posets are universal

13 years 5 months ago

Download math.tut.fi

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...

Erkko Lehtonen

claim paper

Read More »

17

click to vote

EJC
2008

88views Information Technology» more EJC 2008»

Partitions and Clifford algebras

13 years 5 months ago

Download www.loria.fr

Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...

René Schott, G. Stacey Staples

claim paper

Read More »

15

click to vote

EJC
2008

91views Information Technology» more EJC 2008»

On the number of combinations without certain separations

13 years 5 months ago

Download math.haifa.ac.il

Abstract. In this paper we enumerate the number of ways of selecting k objects from n objects arrayed in a line such that no two selected ones are separated by m-1, 2m-1,

Toufik Mansour, Yidong Sun

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers