Sciweavers

2128 search results - page 132 / 426
» A general characterization of indulgence
Sort
View
SIAMDM
2008
123views more  SIAMDM 2008»
15 years 4 months ago
Adapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
Alexandr V. Kostochka, Xuding Zhu
JSC
2007
84views more  JSC 2007»
15 years 4 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
JSYML
2007
91views more  JSYML 2007»
15 years 4 months ago
Ideal convergence of bounded sequences
We generalize the Bolzano-Weierstrass theorem (that every bounded sequence of reals admits a convergentsubsequence) on ideal convergence. Weshow examplesofidealswith and without th...
Rafal Filipów, Reclaw Ireneusz, Mrozek Niko...
AUTOMATICA
2002
62views more  AUTOMATICA 2002»
15 years 4 months ago
On minimal-order stabilization of minimum phase plants
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
Weidong Zhang, Xiaoming Xu
ENTCS
2002
69views more  ENTCS 2002»
15 years 4 months ago
The Uniformity Principle on Traced Monoidal Categories
The uniformity principle for traced monoidal categories has been introduced as a natural generalization of the uniformity principle (Plotkin's principle) for fixpoint operato...
Masahito Hasegawa