Related papers: Testing idealness in the filter oracle model
Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem…
In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the…
Ranking objects is a simple and natural procedure for organizing data. It is often performed by assigning a quality score to each object according to its relevance to the problem at hand. Ranking is widely used for object selection, when…
Model selection in clustering requires (i) to specify a suitable clustering principle and (ii) to control the model order complexity by choosing an appropriate number of clusters depending on the noise level in the data. We advocate an…
Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…
Suppose $\mathcal I$ and $\mathcal J$ are proper ideals on some set $X$. We say that $\mathcal I$ and $\mathcal J$ are incompatible if $\mathcal I \cup \mathcal J$ does not generate a proper ideal. Equivalently, $\mathcal I$ and $\mathcal…
We examine an important combinatorial challenge in clearing clutter using a mobile robot equipped with a manipulator, seeking to compute an optimal object removal sequence for minimizing the task completion time, assuming that each object…
We used quantum process tomography to investigate and identify the function of a nonideal two-qubit quantum-state filters subject to various degree of decoherence. We present a simple decoherence model that explains the experimental results…
Particle filtering is a popular method for inferring latent states in stochastic dynamical systems, whose theoretical properties have been well studied in machine learning and statistics communities. In many control problems, e.g.,…
Duplicate detection is the problem of identifying whether a given item has previously appeared in a (possibly infinite) stream of data, when only a limited amount of memory is available. Unfortunately the infinite stream setting is…
In this paper a new method for checking the subsumption relation for the optimal-size sorting network problem is described. The new approach is based on creating a bipartite graph and modelling the subsumption test as the problem of…
As one step in a working program initiated by Pudl\'ak [Pud17] we construct an oracle relative to which $\mathrm{P}\ne\mathrm{NP}$ and all non-empty sets in $\mathrm{NP}\cup\mathrm{coNP}$ have $\mathrm{P}$-optimal proof systems.
Clustering is the technique to partition data according to their characteristics. Data that are similar in nature belong to the same cluster [1]. There are two types of evaluation methods to evaluate clustering quality. One is an external…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…
Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of…
In combinatorial group testing problems Questioner needs to find a special element $x \in [n]$ by testing subsets of $[n]$. Tapolcai et al. introduced a new model, where each element knows the answer for those queries that contain it and…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
The problem of the optimal allocation (in the expected mean square error sense) of a measurement budget for particle filtering is addressed. We propose three different optimal intermittent filters, whose optimality criteria depend on the…
For a given nonnegative matrix $A=(A_{ij})$, the matrix scaling problem asks whether $A$ can be scaled to a doubly stochastic matrix $D_1AD_2$ for some positive diagonal matrices $D_1,D_2$.The Sinkhorn algorithm is a simple iterative…