Related papers: An intermediate value theorem for sequences with t…
Characterizations of finite sequences $\beta_{1}<\cdots<\beta_{n}$ representing expected values of order statistics from a random sample of size $n$ are given. As a by-product, a characterization of binomial mixtures, when the mixing random…
Disproving a conjecture of Bleicher and Erd\H{o}s, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all rational numbers from a non-empty open interval. We also…
In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals
In the present study we consider an example of a boundary value problem for a simple second order ordinary differential equation, which may exhibit a boundary layer phenomenon. We show that usual central finite differences, which are second…
Following an approach presented by N. Frantzikinakis, we prove that any multiple correlation sequence, defined by invertible measure preserving actions of commuting transformations with integer part polynomial iterates, is the sum of a…
We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
We set general conditions under which the general poverty index, which summarizes all the available indices, is asymptotically represented with some empirical processes. This representation theorem offers a general key, in most directions,…
We use the repeated averages hierarchy to prove a Ramsey theorem regarding uniform upper estimates of convex block sequences of weakly null sequences. The base case of the theorem recovers a result of Freeman.
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
We show that strategies implemented in automatic theorem proving involve an interesting tradeoff between execution speed, proving speedup/computational time and usefulness of information. We advance formal definitions for these concepts by…
We address generating theorems from a given set of axioms, without proof goal, aiming at value from a mathematical point of view or as lemmas for automated proving. As benchmark, we convert a fragment of the Metamath database set.mm. Our…
Properties of 2-adic valuation sequences for general quadratic polynomials with integer coefficients are determined directly from the coefficients. These properties include boundedness or unboundedness, periodicity, and valuations at…
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…
Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…