Related papers: On strongly summable ultrafilters
In this paper, we establish strong backward uniqueness for solutions to sublinear parabolic equations of the type (1.1). The proof of our main result Theorem 1.1 is achieved by means of a new Carleman estimate and a Weiss type monotonicity…
The hyperharmonic numbers h_{n}^{(r)} are defined by means of the classical harmonic numbers. We show that the Euler-type sums with hyperharmonic numbers: {\sigma}(r,m)=\sum_{n=1}^{\infty}((h_{n}^{(r)})/(n^{m})) can be expressed in terms of…
Two results on product of compact filters are shown to be the common principle behind a surprisingly large number of theorems.
In this article a new method of generating sums of like powers is presented.
In this article we discuss the transcendence of certain infinite sums and products by using the Subspace theorem. In particular we improve the result of Han\v{c}l and Rucki \cite{hancl3}.
Using probability theory we derive an expression for the sum of a series of definite integrals involving upper incomplete Gamma functions. In the proof, a normal variance mixture distribution with Beta mixing distributions plays a crucial…
Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…
We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…
We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…
We give necessary and sufficient conditions for the sum of n subspaces of a Hilbert space to be closed. We also present various properties of n-tuples of subspaces with closed sum.
An approach to constructing an upper bound for the Riemann-Farey sum is described.
A divisibility relation on ultrafilters is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also belongs to $\cal G$. After describing the…
In this work we provide explicit calculations that support the conclusions stated in Phys. Rev. Lett. 111, 039102 (2013) (comment), regarding recent literature on transverse polarization. We also compare and contrast two methods of deriving…
We give some new relations for Newman digit sums respectively different modulos and put some problems. In particular, for the odd prime modulos we put an important conjecture.
We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…
The purpose of this paper is to prove the First and Second Fundamental Theorems of invariant theory for the complex special linear supergroup and discuss the superalgebra of invariants, via the super Plucker relations.
In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.
In this paper we present some interesting results involving summation of series in particular trigonometric ones. We failed to locate these results in existing literature or in the web like MathWorld (http://mathworld.wolfram.com/) nor…
We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect…