Related papers: On universal sets and sumsets
When we think of model ensembling or ensemble modeling, there are many possibilities that come to mind in different disciplines. For example, one might think of a set of descriptions of a phenomenon in the world, perhaps a time series or a…
A set $I$ is said to be a universal indifferent set for $1$-genericity if for every $1$-generic $G$ and for all $X \subseteq I$, $G \Delta X$ is also $1$-generic. Miller showed that there is no infinite universal indifferent set for…
The concept of a universal algorithm is discussed. Examples of this kind of algorithms are presented. Software implementations of such algorithms in C++ type languages are discussed together with means that provide for computations with an…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
We give a proof of universality in the bulk of spectrum of unitary matrix models, assuming that the potential is globally $C^{2}$ and locally $C^{3}$ function. The proof is based on the determinant formulas for correlation functions in…
Recent work on the use of dimensional reduction for the regularisation of non--supersymmetric theories is reviewed. It is then shown that there exists a class of theories for which a universal form of the soft supersymmetry breaking terms…
Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…
In this paper, we intend to generalize the classical set theory as much as possible. we will do this by freeing sets from the regular properties of classical sets; e.g., the law of excluded middle, the law of non-contradiction, the…
In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…
We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…
We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.
Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{U_1,\ldots,U_n\}$ is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of…
The concept of full points of abstract unitals has been introduced by Korchm\'aros, Siciliano and Sz\H{o}nyi as a tool for the study of projective embeddings of abstract unitals. In this paper we give a more detailed description of the…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
In this paper we introduce a new approach to the concept of multipolynomials and generalize several results of the homogeneous polynomials and symmetric multilinear applications. We also present an abstract approach to the concept of…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…