The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) is an element of (0, 1] such that no matter how we map the vertices of H into R-d, there is a point covered by at least a c(H)-fraction of the simplices induced by the ...
In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...
A weak metric on a set is a function that satisfies the axioms of a metric except the symmetry and the separation axioms. The aim of this paper is to present some interesting weak metrics and to study some of their properties. In particular, we introduce a ...
This work is concerned with the global continuation for solutions (λ,u,ξ) ∈ R × C1{0}([0,∞), RN) × Rk of the following system of ordinary differential equations: where F: [0,∞) × RN × U × J → RN and φ: U × J → X1, for some open sets J ⊂ R and U ⊂ Rk, and w ...
