Related papers: Summability
We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
We give necessary and sufficient conditions on a presentable infinity-category C so that families of objects of C form an infinity-topos. In particular, we prove a conjecture of Joyal that this is the case whenever C is stable.
A superredundant clause is a clause that is redundant in the resolution closure of a formula. The converse concept of superirredundancy ensures membership of the clause in all minimal CNF formulae that are equivalent to the given one. This…
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…
The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…
We propose a simple definition of an explanation for the outcome of a classifier based on concepts from causality. We compare it with previously proposed notions of explanation, and study their complexity. We conduct an experimental…
We show that every sum system is divisible. Combined with B. V. R. Bhat and R. Srinivasan's result, this shows that every product system arising from a sum system (and every generalized CCR flow) is either of type I or type III. A…
In this note we generalize the trace inequality derived by [1] to the case where the number of terms of the sum (denoted by K) is arbitrary.
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
Two quantum effects are considered coexistent if they can be measured together. It is known that commutativity and comparability are sufficient but not necessary for the coexistence of two effects. We unify those two conditions to a simple…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
The concept of weighted $\beta\gamma$ - summability of order $\theta$ in case of fuzzy functions is introduced and classified into ordinary and absolute sense. Several inclusion relations among the sets are investigated. Also we have found…
In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…
We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a $p$-summability condition for $1\le p<2$. This settles a problem left open…
A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular…
We address in this paper how tightly the composability nature of systems: $S_{A+B} =\Omega (S_A, S_B)$ constrains definition of generalized entropies and investigate explicitly the composability in some ansatz of the entropy form.