Related papers: On minimal collections of sequences for testing co…

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

We introduce an algorithm for detection of bugs in sequential circuits. This algorithm is incomplete i.e. its failure to find a bug breaking a property P does not imply that P holds. The appeal of incomplete algorithms is that they scale…

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

We present an intrinsic and concrete development of the subdivision of small categories, give some simple examples and derive its fundamental properties. As an application, we deduce an alternative way to compare the homotopy categories of…

In multiple classification, one aims to determine whether a testing sequence is generated from the same distribution as one of the M training sequences or not. Unlike most of existing studies that focus on discrete-valued sequences with…

In nearest-neighbor classification, a training set $P$ of points in $\mathbb{R}^d$ with given classification is used to classify every point in $\mathbb{R}^d$: Every point gets the same classification as its nearest neighbor in $P$.…

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…

We investigate closure operators and describe their properties for $E$-combinations and $P$-combinations of structures and their theories. We prove, for $E$-combinations, that the existence of a minimal generating set of theories is…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…

Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…

In this paper, by an example we show that the general minimax results of Fan and Sion cannot be extended on usual dense sets. Nevertheless, we obtain some new minimax results on a special type of dense set that we call self-segment-dense.…

The blocker $A^{*}$ of an antichain $A$ in a finite poset $P$ is the set of elements minimal with the property of having with each member of $A$ a common predecessor. The following is done: 1. The posets $P$ for which $A^{**}=A$ for all…

The chain covering number $\Cov(P)$ of a poset $P$ is the least number of chains needed to cover $P$. For a cardinal $\nu$, we give a list of posets of cardinality and covering number $\nu$ such that for every poset $P$ with no infinite…

Discovering the most interesting patterns is the key problem in the field of pattern mining. While ranking or selecting patterns is well-studied for itemsets it is surprisingly under-researched for other, more complex, pattern types. In…

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…

Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning task as the problem of sequentially testing how the minimum…

Let $X$ be an $n$-element set, where $n$ is even. We refute a conjecture of J. Gordon and Y. Teplitskaya, according to which, for every maximal intersecting family $\mathcal{F}$ of $\frac{n}2$-element subsets of $X$, one can partition $X$…

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Let $N$ be a finite set, let $p \in (0,1)$, and let $N_p$ denote a random binomial subset of $N$ where every element of $N$ is taken to belong to the subset independently with probability $p$ . This defines a product measure $\mu_p$ on the…