Related papers: Summability

We offer some summation formulas that appear to have great utility in probability theory. The proofs require some recent results from analysis that have thus far been applied to basic hypergeometric functions.

In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.

This survey is devoted to necessary and suffcient conditions for a rational number to be representable by a Cantor series. Necessary and suffcient conditions are formulated for the case of an arbitrary sequence $(q_k)$.

There is no single definition of complexity (Edmonds 1999; Gershenson 2008; Mitchell 2009; De Domenico, et al., 2019), as it acquires different meanings in different contexts. A general notion is the amount of information required to…

We prove that a set is K-trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K-trivial if and only if it is not ML-cuppable. These results settle a question of Ku\v{c}era, who introduced both…

In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…

Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

In this paper we prove a generalization of a theorem of Schneider, which gives a criterion for a projective surface over the complex numbers to have an ample cotangent bundle. After reviewing different notions of positivity, we introduce a…

We study properties of relative modular categories and derive sufficient conditions for their existence. In particular, we derive sufficient conditions for relative pre-modular categories to be non-degenerate and relative modular, and for…

In the analysis of large/big data sets, aggregation (replacing values of a variable over a group by a single value) is a standard way of reducing the size (complexity) of the data. Data analysis programs provide different aggregation…

The common cause completeness (CCC) is a philosophical principle that asserts that if we consider two positively correlated events then it evokes a common cause. The principle is due to H. Reichenbach and has been largely studied in Boolean…

In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…

Conjugacy separability of any group of the class of one-relator groups given by the presentation $<a, b; [a^m,b^n]=1>$ ($m,n>1$) is proven.

We show that elements of unital $C^*$-algebras without tracial states are finite sums of commutators. Moreover, the number of commutators involved is bounded, depending only on the given $C^*$-algebra.

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.

We are developing techniques to generate summary descriptions of sets of objects. In this paper, we present and evaluate a rule-based NLG technique for summarising sets of bibliographical references in academic papers. This extends our…