2,293 research outputs found
Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information
The characterization of a binary function by partial frequency information is
considered. We show that it is possible to reconstruct binary signals from
incomplete frequency measurements via the solution of a simple linear
optimization problem. We further prove that if a binary function is spatially
structured (e.g. a general black-white image or an indicator function of a
shape), then it can be recovered from very few low frequency measurements in
general. These results would lead to efficient methods of sensing,
characterizing and recovering a binary signal or a shape as well as other
applications like deconvolution of binary functions blurred by a low-pass
filter. Numerical results are provided to demonstrate the theoretical
arguments.Comment: IEEE Transactions on Information Theory, 201
Pseudorandom binary functions on rooted plane trees
International audienceIn an earlier paper the authors considered r-almost s-uniform trees, i.e. rooted planar trees T such that the root has r successors, and every other vertex has s suc- cessors. They considered binary functions f : V (T ) → {−1, +1} defined on the set V (T ) of the vertices of such a tree T and studied the pseudorandomness of binary functions of this type. Here the authors extend the problem to general rooted plane trees: the measures of pseudorandomness of binary functions defined on trees of this type are introduced; the connection between these measures is analyzed; the size of these measures for truly random binary functions is studied; binary functions with strong pseudorandom properties are constructed; pseudorandom properties of impor- tant special binary functions are studied
Minors for alternating dimaps
We develop a theory of minors for alternating dimaps --- orientably embedded
digraphs where, at each vertex, the incident edges (taken in the order given by
the embedding) are directed alternately into, and out of, the vertex. We show
that they are related by the triality relation of Tutte. They do not commute in
general, though do in many circumstances, and we characterise the situations
where they do. The relationship with triality is reminiscent of similar
relationships for binary functions, due to the author, so we characterise those
alternating dimaps which correspond to binary functions. We give a
characterisation of alternating dimaps of at most a given genus, using a finite
set of excluded minors. We also use the minor operations to define simple Tutte
invariants for alternating dimaps and characterise them. We establish a
connection with the Tutte polynomial, and pose the problem of characterising
universal Tutte-like invariants for alternating dimaps based on these minor
operations.Comment: 51 pages, 7 figure
Associative polynomial functions over bounded distributive lattices
The associativity property, usually defined for binary functions, can be
generalized to functions of a given fixed arity n>=1 as well as to functions of
multiple arities. In this paper, we investigate these two generalizations in
the case of polynomial functions over bounded distributive lattices and present
explicit descriptions of the corresponding associative functions. We also show
that, in this case, both generalizations of associativity are essentially the
same.Comment: Final versio
On a Subposet of the Tamari Lattice
We explore some of the properties of a subposet of the Tamari lattice
introduced by Pallo, which we call the comb poset. We show that three binary
functions that are not well-behaved in the Tamari lattice are remarkably
well-behaved within an interval of the comb poset: rotation distance, meets and
joins, and the common parse words function for a pair of trees. We relate this
poset to a partial order on the symmetric group studied by Edelman.Comment: 21 page
- …