相关论文: Getting results with negative thinking

Multisets are sets that allow repetition of elements. As such, multisets pave the way to a number of interesting possibilities of theoretical and applied nature. In the present work, after revising the main aspects of traditional sets, we…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

We introduce the notion of a pseudomultiplier of a Hilbert space $\mathcal H$ of functions on a set $\Omega$. Roughly, a pseudomultiplier of $\mathcal H$ is a function which multiplies a finite-codimensional subspace of $\mathcal H$ into…

Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…

Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…

Intuitively, a pluralist solution is one in which a single question receives multiple answers. Such pluralist solutions have been proposed in many widely disparate contexts. This paper restates the concept of pluralism with greater…

We show that the algorithm to extract diverse M -solutions from a Conditional Random Field (called divMbest [1]) takes exactly the form of a Herding procedure [2], i.e. a deterministic dynamical system that produces a sequence of hypotheses…

Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…

In \cite{Oz}, M. \"Ozdemir defined a new non-commutative number system called hybrid numbers. In this paper, we define the hybrid Fibonacci and Lucas numbers. This number system can be accepted as a generalization of the complex…

A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum…

Here a novel idea to handle imprecise or vague set viz. Pseudo fuzzy set has been proposed. Pseudo fuzzy set is a triplet of element and its two membership functions. Both the membership functions may or may not be dependent. The hypothesis…

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…

Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

For every positive integer h, the representation function of order h associated to a subset A of the integers or, more generally, of any group or semigroup X, counts the number of ways an element of X can be written as the sum (or product,…