Sciweavers

922 search results - page 16 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
DM
2006
80views more  DM 2006»
13 years 7 months ago
A class of combinatorial identities
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of ...
Yingpu Deng
FOCS
2006
IEEE
14 years 1 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 4 days ago
On a small gain theorem for networks of iISS systems
— This paper considers networks consisting of integral input-to-state stable (iISS) subsystems and addresses the problem of verifying iISS property of a given network. First, we ...
Hiroshi Ito, Sergey Dashkovskiy, Fabian Wirth
JCT
1998
99views more  JCT 1998»
13 years 7 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
DM
1999
79views more  DM 1999»
13 years 7 months ago
A bijective proof of Riordan's theorem on powers of Fibonacci numbers
Let Fk(x) = n=0 Fk n xn . Using the interpretation of Fibonacci numbers in the terms of Morse codes, we give a bijective proof of Riordan's formula (1 - Lkx + (-1)k x2 )Fk(x...
Andrej Dujella