Temporal decay bounds in generalized heatBconduction
نویسندگان
چکیده
منابع مشابه
UPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملBounds for Generalized Thrackles
A thrackle (resp. generalized thrackle) is a drawing of a graph in which each pair of edges meets precisely once (resp. an odd number of times). For a graph with n vertices and m edges, we show that, for drawings in the plane, m ≤ 32 (n− 1) for thrackles, while m ≤ 2n − 2 for generalized thrackles. This improves theorems of Lovász, Pach, and Szegedy. The paper also examines thrackles in the mor...
متن کاملBounds on Generalized Huffman Codes
New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding — which concern the traditional linear code objective of minimizing average codeword length — these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman co...
متن کاملBounds on generalized Frobenius numbers
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N -tuple is defined to be the largest positive integer that has no representation as PN i=1 aixi where x1, ..., xN are nonnegative integers. More generally, the s-Frobenius number is defined to be the largest positive integer that has precisely s distinct representations like this. We use techniques...
متن کاملBounds relating generalized domination parameters
Henning, A.M. and H.C. Swart, Bounds relating generalized domination parameters, Discrete Mathematics 120 (1993) 933105. The domination number r(G) and the total domination number y,(G) of a graph G are generalized to the K,-domination number 7x,(G) and the total K,-domination number y;_(G) for n>2, where y(G)=y,,(G) and Y~(G)=~~~(G), K,-connectivity is defined and, for every integer n >2, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2004
ISSN: 0022-247X
DOI: 10.1016/s0022-247x(04)00115-5