peer reviewedA 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 minors: classes of linear or affine functions over nonassociative semirings are shown to be weakly reconstructible. Moreover, affine functions of sufficiently large arity over finite fields are reconstructible
summary:Let $G = G(\cdot)$ be a commutative groupoid such that $\{(a,b,c) \in G^3$; $a\cdot bc \ne a...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
In this thesis we shall consider three types of extremal problems (i.e. problems involving maxima an...
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a mult...
AbstractBrylawski first raised the questions of whether a matroid can be reconstructed from its mult...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
A vertex-deleted subgraph (or simply a card) of graph G is an induced subgraph of G containing all ...
Publisher Copyright: © 2021 World Scientific Publishing Company.We study the algebraic properties of...
AbstractTwo multirelations M and M′ on the same set E are hypomorphic when for every element x of E,...
AbstractA general technique for tackling various reconstruction problems is presented and applied to...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractTwo methods are developed for showing deletion reconstructibility of geometries that are uni...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
Abstract. A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulate...
summary:Let $G = G(\cdot)$ be a commutative groupoid such that $\{(a,b,c) \in G^3$; $a\cdot bc \ne a...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
In this thesis we shall consider three types of extremal problems (i.e. problems involving maxima an...
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a mult...
AbstractBrylawski first raised the questions of whether a matroid can be reconstructed from its mult...
AbstractIn this paper we consider the problem of reconstructing a subsetA⊂Zn, up to translation, fro...
A vertex-deleted subgraph (or simply a card) of graph G is an induced subgraph of G containing all ...
Publisher Copyright: © 2021 World Scientific Publishing Company.We study the algebraic properties of...
AbstractTwo multirelations M and M′ on the same set E are hypomorphic when for every element x of E,...
AbstractA general technique for tackling various reconstruction problems is presented and applied to...
Set reconstruction on the hypercube, Discrete Analysis 2017:17, 10 pp. A well-known open problem in...
AbstractTwo methods are developed for showing deletion reconstructibility of geometries that are uni...
AbstractThe Reconstruction Conjecture asserts that every finite simple undirected graph on 3 or more...
We consider the problem of reconstructing a set of real numbers up to translation from the multiset ...
Abstract. A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulate...
summary:Let $G = G(\cdot)$ be a commutative groupoid such that $\{(a,b,c) \in G^3$; $a\cdot bc \ne a...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
In this thesis we shall consider three types of extremal problems (i.e. problems involving maxima an...