English
Related papers

Related papers: Summability

200 papers

In this paper we present results on convergence and Ces\`{a}ro summability of Multiple Fourier series of functions of bounded generalized variation.

Analysis of PDEs · Mathematics 2014-04-25 Ushangi Goginava , Artur Sahakian

"How much c.e. sets could cover a given set?" in this paper we are going to answer this question. Also, in this approach some old concepts come into a new arrangement. The major goal of this article is to introduce an appropriate definition…

Formal Languages and Automata Theory · Computer Science 2012-03-06 Farzad Didehvar , Mohsen Mansouri , Zahra Taheri

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan , Angel V. Kumchev

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…

Symbolic Computation · Computer Science 2018-09-19 Peter Paule , Carsten Schneider

In this paper, we show that certain sums of generalized $m$-gonal numbers represent every positive integer if and only if they represent every positive integer up to an explicit bound $C_m$, verifying a conjecture of Sun for sufficiently…

Number Theory · Mathematics 2021-10-01 Kathrin Bringmann , Ben Kane

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Logic · Mathematics 2017-05-22 Pavel Pudlak

A vocabulary is a list of words designating subsets from a grand set X. We model a vocabulary as a partition of X and study the aggregation of individual vocabularies into a collective one. We characterize aggregation rules when X is…

Theoretical Economics · Economics 2026-03-16 Marco LiCalzi , M. Alperen Yasar

We consider abstract-argumentation-theoretic coalition formability in this work. Taking a model from political alliance among political parties, we will contemplate profitability, and then formability, of a coalition. As is commonly…

Artificial Intelligence · Computer Science 2017-05-23 Ryuta Arisaka , Ken Satoh

Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…

Commutative Algebra · Mathematics 2024-02-09 Carmelo Cisto

We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…

Category Theory · Mathematics 2019-12-30 M. Gavrilovich

We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is…

cmp-lg · Computer Science 2008-02-03 Wlodek Zadrozny

We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…

Logic · Mathematics 2022-12-07 Rosalie Iemhoff , Robert Passmann

We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…

Logic · Mathematics 2016-04-27 Joel David Hamkins , Makoto Kikuchi

Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…

Logic · Mathematics 2016-06-10 Kosta Dosen

We survey some results that provide different versions of classical results through different summability methods. Specifically, in order to adapt such classical results, we analyze which properties should satisfy the summability methods.…

In this paper, we have obtained a necessary and suffcient condition for the series.

Classical Analysis and ODEs · Mathematics 2011-03-04 H. S. Ozarslan , T. Ari

In this note we define summable families in tempered distribution spaces and we state some their properties and characterizations. Summable families are the analogous of summable sequences in separable Hilbert spaces, but in tempered…

Functional Analysis · Mathematics 2011-04-26 David Carfí

A numeral system is defined by three closed $\lambda$-terms : a normal $\lambda$-term $d_0$ for Zero, a $\lambda$-term $S_d$ for Successor, and a $\lambda$-term for Zero Test, such that the $\lambda$-terms $({S_d}^{i} ~ d_0)$ are…

Logic · Mathematics 2009-05-06 Karim Nour
‹ Prev 1 3 4 5 6 7 10 Next ›