Totally symmetric functions are reconstructible from identification minors

Erkko Lehtonen

doi:10.37236/2863

Totally symmetric functions are reconstructible from identification minors

Erkko Lehtonen

Mathematics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

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.

Original language	British English
Journal	Electronic Journal of Combinatorics
Volume	21
Issue number	2
DOIs	https://doi.org/10.37236/2863
State	Published - 16 Apr 2014

Keywords

Function of several arguments
Reconstruction problem
Totally symmetric function

Access to Document

10.37236/2863

Cite this

@article{37b63e6141824c47851b5286c82ba719,

title = "Totally symmetric functions are reconstructible from identification minors",

abstract = "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.",

keywords = "Function of several arguments, Reconstruction problem, Totally symmetric function",

author = "Erkko Lehtonen",

year = "2014",

month = apr,

day = "16",

doi = "10.37236/2863",

language = "British English",

volume = "21",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2",

}

TY - JOUR

T1 - Totally symmetric functions are reconstructible from identification minors

AU - Lehtonen, Erkko

PY - 2014/4/16

Y1 - 2014/4/16

N2 - 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.

AB - 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.

KW - Function of several arguments

KW - Reconstruction problem

KW - Totally symmetric function

UR - http://www.scopus.com/inward/record.url?scp=84898987848&partnerID=8YFLogxK

U2 - 10.37236/2863

DO - 10.37236/2863

M3 - Article

AN - SCOPUS:84898987848

SN - 1077-8926

VL - 21

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2

ER -

Totally symmetric functions are reconstructible from identification minors

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this