Related papers: Generic Selective Independent Families
The estimation of categorical distributions under marginal constraints summarizing some sample from a population in the most-generalizable way is key for many machine-learning and data-driven approaches. We provide a parameter-agnostic…
We study families of positive and completely positive maps acting on a bipartite system $\mathbb{C}^M\otimes \mathbb{C}^N$ (with $M\leq N$). The maps have a property that when applied to any state (of a given entanglement class) they result…
In this paper, we solve a maximization problem where the objective function is quadratic and convex or concave and the constraints set is the reachable value set of a convergent discrete-time affine system. Moreover, we assume that the…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…
Strong external difference families (SEDFs) are much-studied combinatorial objects motivated by an information security application. A well-known conjecture states that only one abelian SEDF with more than 2 sets exists. We show that if the…
We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…
A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. We say a subset of…
We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…
Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…
Finding a maximum independent set (MIS) of a given fam- ily of axis-parallel rectangles is a basic problem in computational geom- etry and combinatorics. This problem has attracted significant atten- tion since the sixties, when Wegner…
We investigate families of partitions of omega which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these…
We show, for every $r>d\ge 0$ or $r=d\ge 2$, the existence of a Baire generic set of $C^d$-families of $C^r$-maps $(f_a)_{a\in (-1,1)^k}$ of a manifold $M$ of dimension $\ge 2$, so that for every $a$ small the map $f_a$ has infinitely many…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…
The Donald-Flanigan conjecture asserts that any group algebra of a finite group has a separable deformation. We apply an inductive method to deform group algebras from deformations of normal subgroup algebras, establishing an infinite…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…
If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we…
We prove that for a Hecke cuspform $f\in S_k(\Gamma_0(N),\chi)$ and a prime $l>\max\{k,6\}$ such that $l\nmid N$, there exists an infinite family $\{k_r\}_{r\geq 1}\subseteq\mathbb{Z}$ such that for each $k_r$, there is a cusp form…