Related papers: Testing idealness in the filter oracle model
We consider the following combinatorial search problem: we are given some excellent elements of $[n]$ and we should find at least one, asking questions of the following type: "Is there an excellent element in $A \subset [n]$?". G.O.H.…
We study the problem of estimating the number of defective items $d$ within a pile of $n$ elements up to a multiplicative factor of $\Delta>1$, using deterministic group testing algorithms. We bring lower and upper bounds on the number of…
The membership problem asks to maintain a set $S\subseteq[u]$, supporting insertions and membership queries, i.e., testing if a given element is in the set. A data structure that computes exact answers is called a dictionary. When a (small)…
We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…
We consider a combinatorial question about searching for an unknown ideal $\mu$ within a known poset $\lambda$. Elements of $\lambda$ may be queried for membership in $\mu$, but at most $k$ positive query results are permitted. The goal is…
Model selection is a major challenge in non-parametric clustering. There is no universally admitted way to evaluate clustering results for the obvious reason that no ground truth is available. The difficulty to find a universal evaluation…
Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…
We deal with the category of finitely generated modules over an artin algebra $A$. Recall that an object in an abelian category is said to be a brick provided its endomorphism ring is a division ring. Simple modules are, of course, bricks,…
We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…
Let $I$ be an equigenerated squarefree monomial ideal in the polynomial ring $\mathbb{K}[x_1,\ldots,x_n]$, and let $\mathcal{H}$ be a uniform clutter on the vertex set $\{x_1,\ldots,x_n\}$ such that $I=I(\mathcal{H})$ is its edge ideal. A…
A unitary perfect number is a positive integer n satisfying \sigma^*(n)=2n, where \sigma^* sums unitary divisors. Only five examples are known, and no sixth has been found. We revisit the Subbarao-Warren problem by keeping the seed factor…
When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor twist on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…
If C is a clutter with n vertices and q edges whose clutter matrix has column vectors V={v1,...,vq}, we call C an Ehrhart clutter if {(v1,1),...,(vq,1)} is a Hilbert basis. Letting A(P) be the Ehrhart ring of P=conv(V), we are able to show…
Let C be a clutter and let I(C) be its edge ideal. This is a survey paper on the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regularity of R/I(C) and apply this criterion to give…
In this paper we propose a sequence of tests which gives a definitive test for checking $2\times M$ separability. The test is definitive in the sense that each test corresponds to checking membership in a cone, and that the closure of the…
Under MA we prove that for the ideal $\cal I$ of thin sets on $\omega$ and for any ordinal $\gamma \leq \omega_1$ there is an ${\cal I}$-ultrafilter (in the sense of Baumgartner), which belongs to the class ${\cal P}_{\gamma}$ of…
We study the problem of packing a knapsack without knowing its capacity. Whenever we attempt to pack an item that does not fit, the item is discarded; if the item fits, we have to include it in the packing. We show that there is always a…
We consider a simple model of imprecise comparisons: there exists some $\delta>0$ such that when a subject is given two elements to compare, if the values of those elements (as perceived by the subject) differ by at least $\delta$, then the…
We investigate crowdsourcing algorithms for finding the top-quality item within a large collection of objects with unknown intrinsic quality values. This is an important problem with many relevant applications, for example in networked…
We consider the problem of sorting $n$ items, given the outcomes of $m$ pre-existing comparisons. We present a simple and natural deterministic algorithm that runs in $O(m + \log T)$ time and does $O(\log T)$ comparisons, where $T$ is the…