Related papers: A New Weak Choice Principle
We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings,…
The thin set theorem $\mathsf{RT}^n_{<\infty,\ell}$ asserts the existence, for every $k$-coloring of the subsets of natural numbers of size $n$, of an infinite set of natural numbers, all of whose subsets of size $n$ use at most $\ell$…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…
We introduce Neural Choice by Elimination, a new framework that integrates deep neural networks into probabilistic sequential choice models for learning to rank. Given a set of items to chose from, the elimination strategy starts with the…
In this paper, we present a new feature selection method that is suitable for both unsupervised and supervised problems. We build upon the recently proposed Infinite Feature Selection (IFS) method where feature subsets of all sizes…
We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…
Suppose we are given a family of choice functions on pairs from a given finite set (with at least three elements) closed under permutations of the given set. The set is considered the set of alternatives (say candidates for an office). The…
Every sequence $f_1, f_2, \cdots \, $ of random variables with $ \, \lim_{M \to \infty} \big( M \sup_{k \in \mathbb{N}} \mathbb{P} ( |f_k| > M ) \big)=0\,$ contains a subsequence $ f_{k_1}, f_{k_2} , \cdots \,$ that satisfies, along with…
A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…
We analyse the structure of imprecise Markov chains and study their convergence by means of accessibility relations. We first identify the sets of states, so-called minimal permanent classes, that are the minimal sets capable of containing…
We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
Ren and the second author established that the weakly optimal subvarieties (e.g. maximal weakly special subvarieties) of a subvariety $V$ of a Shimura variety arise in finitely many families. In this article, we refine this theorem by (1)…
Recent studies on frequent itemset mining algorithms resulted in significant performance improvements. However, if the minimal support threshold is set too low, or the data is highly correlated, the number of frequent itemsets itself can be…
In this paper, we show that if the optimization function is restricted-strongly-convex (RSC) and restricted-smooth (RSM) -- a rich subclass of weakly submodular functions -- then a streaming algorithm with constant factor approximation…
The scope of this work is the constraint-based synthesis of termination arguments for the restricted class of programs called linear lasso programs. A termination argument consists of a ranking function as well as a set of supporting…
We address the subset selection problem for matrices, where the goal is to select a subset of $k$ columns from a "short-and-fat" matrix $X \in \mathbb{R}^{m \times n}$, such that the pseudoinverse of the sampled submatrix has as small…
Let $\mathscr{F}$ be a formation and $G$ a finite group. The weak norm of a subgroup $H$ in $G$ with respect to $\mathscr{F}$ is defined by $N_{\mathscr{F}}(G,H)=\underset{T\leq H}{\bigcap}N_G(T^{\mathscr{F}})$. In particular,…
We say that a subset $S$ of an infinite group $G$ is a Ramsey-product subset if, for any infinite subsets $X$, $Y$ of $G$, there exist $x \in X$ and $y\in Y$ such that $x y \in S$ and $ y x \in S$ . We show that the family $\varphi$ of all…
New Foundations ($\mathrm{NF}$) is a set theory obtained from naive set theory by putting a stratification constraint on the comprehension schema; for example, it proves that there is a universal set $V$. $\mathrm{NFU}$ ($\mathrm{NF}$ with…