Related papers: Reconstructing multisets over commutative groupoid…
We investigate the problem whether a function of several arguments can be reconstructed from its identification minors. We focus on functions with a unique identification minor, and we establish some positive and negative results on the…
Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', and we give a…
Multisets are sets that allow repetition of elements. As such, multisets pave the way to a number of interesting possibilities of theoretical and applied nature. In the present work, after revising the main aspects of traditional sets, we…
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas…
We deal with a problem of the explicit reconstruction of any holomorphic function $f$ on $\mathbb{C}^2$ from its restricions on a union of complex lines. The validity of such a reconstruction essentially depends on the mutual repartition of…
We consider the problem of reconstructing an image from compressive measurements using a multi-resolution grid. In this context, the reconstructed image is divided into multiple regions, each one with a different resolution. This problem…
We study generalized permutohedra and supermodular functions. Specifically we analyze decomposability and irreducibility for these objects and establish some asymptotic behavior. We also study a related problem on irreducibility for…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
This paper concerns with iterative schemes for the perfect reconstruction of functions belonging to multiresolution spaces on bounded manifolds from nonuniform sampling. The schemes have optimal complexity in the sense that the…
We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
A decreasing Cartesian code is defined by evaluating a monomial set closed under divisibility on a Cartesian set. Some well-known examples are the Reed-Solomon, Reed-Muller, and (some) toric codes. The affine permutations consist of the…
We study affine semigroup rings as algebras over subsemigroup rings. From this relative viewpoint with respect to a given subsemigroup ring, the fibered sum of two affine semigroup algebras is constructed. Such a construction is compared to…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
A reconstruction problem is formulated for Sperner systems, and infinite families of nonreconstructible Sperner systems are presented. This has an application to a reconstruction problem for functions of several arguments and identification…
In this paper we consider the problem of reconstructing an image that is downsampled in the space of its $SE(2)$ wavelet transform, which is motivated by classical models of simple cells receptive fields and feature preference maps in…