Related papers: On the structure of measurable filters on a counta…

We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…

We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines,…

The concept of measurability of functions on a charge space is generalised for functions taking values in a uniform space. Several existing forms of measurability generalise naturally in this context, and new forms of measurability are…

We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…

Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.

As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author's and a few others' current…

We introduce the concept of cloning for classes of observables and classify cloning machines for qubit systems according to the number of parameters needed to describe the class under investigation. A no-cloning theorem for observables is…

We undertake a detailed numerical study of the phenomenon of stochastic resonance with multisignal inputs. A bistable cubic map is used as the model and we show that it combines the features of a bistable system and a threshold system. A…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

We analyze the observability of motion estimates from the fusion of visual and inertial sensors. Because the model contains unknown parameters, such as sensor biases, the problem is usually cast as a mixed identification/filtering, and the…

Measurement incompatibility is a cornerstone of quantum mechanics. In the context of estimating multiple parameters of a quantum system, this manifests as a fundamental trade-off between the precisions with which different parameters can be…

This work addresses the problem of learning sparse representations of tensor data using structured dictionary learning. It proposes learning a mixture of separable dictionaries to better capture the structure of tensor data by generalizing…

Problems about attainability in topological spaces are considered. Some nonsequential version of the Warga approximate solutions is investigated: we use filters and ultrafilters of measurable spaces. Attraction sets are constructed.

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Finite mixtures are a flexible modeling tool for irregularly shaped densities and samples from heterogeneous populations. When modeling with mixtures using an exchangeable prior on the component features, the component labels are arbitrary…

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

We study the compatibility (or joint measurability) of quantum observables in a setting where the experimenter has access to multiple copies of a given quantum system, rather than performing the experiments on each individual copy…