More on the generalized macaulay theorem — II
نویسندگان
چکیده
منابع مشابه
A generalized Macaulay theorem and generalized face rings
We prove that the f -vector of members in a certain class of meet semi-lattices satisfies Macaulay inequalities 0 ≤ ∂k(fk) ≤ fk−1 for all k ≥ 0. We construct a large family of meet semi-lattices belonging to this class, which includes all posets of multicomplexes, as well as meet semi-lattices with the ”diamond property”, discussed by Wegner [11], as special cases. Specializing the proof to the...
متن کاملSome remarks on generalized Cohen-MacAulay rings
We consider the possibility of characterizing Buchsbaum and some special generalized Cohen-Macaulay rings by systems of parameters having certain properties of regular sequences. As an application, we give a bound on Castelnuovo-Mumford regularity of so-called (k, d)-Buchsbaum graded Kalgebras.
متن کاملSome More Noiseless Coding Theorem on Generalized R-Norm Entropy
A parametric mean length is defined as the quantity L R = R R−1 [ 1 − ∑N i=1 p β i D −ni( R−1 R ) ∑N j=1 p β j ] where R > 0 ( 1) , β > 0, pi > 0, ∑ pi = 1, i = 1, 2, . . . ,N. This being the mean length of code words. Lower and upper bounds for L R are derived in terms of R-norm information measure for the incomplete power distribution. AMS Subject classification. 94A15, 94A17, 94A24, 26D15.
متن کاملOn a Theorem of Macaulay on Colons of Ideals∗
Let R be a polynomial ring over a field of dimension n. Let m be the maximal homogeneous ideal of R. Let I be a complete intersection homogeneous ideal of R minimally generated by polynomials of degrees d1, d2, . . . , dn. F. S. Macaulay showed that for all integers i = 0, 1, . . . , δ + 1, I : m = I + m where δ = d1 + d2 + . . .+ dn − n. We provide a modern proof of a generalization of this re...
متن کاملA More General Version of the Costa Theorem
In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90129-7