Totally Symmetric Functions are Reconstructible from Identification Minors
نویسنده
چکیده
We formulate a reconstruction problem for functions of several arguments: Is a function of several arguments uniquely determined, up to equivalence, by its identification minors? We establish some positive and negative results on this reconstruction problem. In particular, we show that totally symmetric functions (of sufficiently large arity) are reconstructible.
منابع مشابه
Reconstructing Permutations from Identification Minors
We consider the problem whether a permutation of a finite set is uniquely determined by its identification minors. While there exist non-reconstructible permutations of every set with two, three, or four elements, we show that every permutation of a finite set with at least five elements is reconstructible from its identification minors. Moreover, we provide an algorithm for recovering a permut...
متن کاملReconstructing Multisets over Commutative Groupoids and Affine Functions over Nonassociative Semirings
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of multisets are determined. These results find an application in a different kind of reconstruction problem for functions of several arguments and identification min...
متن کاملPermutation Reconstruction from Minors
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible way to obtain (n k ) subsequences. We renumber the sequences from 1 to n−k preserving the relative size of the elements to form (n−k)-minors. These minors form a multiset Mk(p) with an underlying set M ′ k(p). We study ...
متن کاملNonnegative Minors of Minor Matrices
Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that 2× 2 minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial interpretation for the minors of minor matrices in terms of the weights of families of paths in a network. Introduction By attaching weights to the edges of a finite, di...
متن کاملRegular Symmetric Arrays For Non-Symmetric Functions1
A new class of non-totally symmetric functions which can be represented as simple regular symmetric arrays without redundancy is identified. Regular circuits are becoming crucialy important for deep submicron technologies, which needs new layout approaches to fully utilized their potential. The new class of functions contains the classes of totally symmetric and totally symmetric with mixed pol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014