Reconstruction of Partitions
نویسندگان
چکیده
For the partition x = [x1 ≥ x2 ≥ · · · ≥ xk] of the integer n = ∑ i xi a t-deletion is a partition y = [y1 ≥ y2 ≥ · · · ≥ yk] with xi ≥ yi ≥ 0 and ∑ i (xi−yi) = t. We prove that all partitions of n are reconstructible from their t–deletions if n is sufficiently large in relation to t.
منابع مشابه
Tsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions
The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...
متن کاملPartitions for Spectral (Finite) Volume Reconstruction in the Tetrahedron
In this paper, we compute partitions of the tetrahedron for up to the fourth-order spectral volume reconstruction. Certain optimization is made to these partitions and previously obtained partitions of lower dimensional simplex. These optimized partitions have the smallest Lebesgue constants among currently known spectral volume partitions. Institute for Mathematics and its Applications, Univer...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملGraham's Tree Reconstruction Conjecture and a Waring-Type Problem on Partitions
Suppose G is a tree. Graham’s “Tree Reconstruction Conjecture” states that G is uniquely determined by the integer sequence |G|, |L(G)|, |L(L(G))|, |L(L(L(G)))|, . . ., where L(H) denotes the line graph of the graph H . Little is known about this question apart from a few simple observations. We show that the number of trees on n vertices which can be distinguished by their associated integer s...
متن کاملEfficient reconstruction of partitions
We consider the problem of reconstructing a partition x of the integer n from the set of its tsubpartitions. These are the partitions of the integer n − t obtained by deleting a total of t from the parts of x in all possible ways. It was shown (in a forthcoming paper) that all partitions of n can be reconstructed from t-subpartitions if n is sufficiently large in relation to t. In this paper we...
متن کاملCFD analysis of natural convection heat transfer in a square cavity with partitions utilizing Al2O3 nanofluid
In the present study, natural convective heat transfer in a partitioned square cavity utilizing nanofluids is studied. The vertical left and right walls are considered as the hot and cold walls, respectively and the partitions assumed to be adiabatic. The nanofluid used in this study is Al2O3 with the volume fraction of 20%. It is assumed that nanofluid is a single phase f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 11 شماره
صفحات -
تاریخ انتشار 2005