Related papers: A uniqueness problem concerning entire functions a…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function $f$ in $m$…
In this paper we introduce elementary and completely explicit formulas for the derivative of any order of any function of the type 1/p, where p is a polynomial with known zeros.
We establish a set of relations between several quite diverse types of weighted inequalities involving various integral operators and fairly general quasinorm-like functionals which we call sub-monotone. The main result enables one to solve…
We introduce a new fractional derivative which obeys classical properties including: linearity, product rule, quotient rule, power rule, chain rule, vanishing derivatives for constant functions, the Rolle's Theorem and the Mean Value…
This paper concerns the question to what extent it can be efficiently determined whether an arbitrary program correctly solves a given problem. This question is investigated with programs of a very simple form, namely instruction sequences,…
We prove, under certain conditions on $(\alpha,\beta)$, that each Schwartz function $f$ such that $f(\pm n^{\alpha}) = \hat{f}(\pm n^{\beta}) = 0, \forall n \ge 0$ must vanish identically, complementing a series of recent results involving…
For a real constant $b,$ we give sharp estimates of $\log|f(z)/z|+b\arg[f(z)/z]$ for subclasses of normalized univalent functions $f$ on the unit disk.
In this paper we give simple extension and uniqueness theorems for restricted additive and logarithmic functional equations.
Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…
Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…
Let $A$ be a separable, unital and exact $C^*$-algebra satisfying the universal coefficient theorem. We prove uniqueness theorems up to unitary conjugacy for unital, full and nuclear maps from $A$ into ultraproducts of finite von Neumann…
We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…
We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
This paper demonstrates some connections between the coefficients of a Taylor series $f(z)=\ds\sum_{n=0}^\infty a_n z^n$ and singularities of the function. There are many known results of this type, for example, counting the number of poles…
Monotonicity properties of the ratio $$ \log \frac{f(x+a_1)\cdots f(x+a_n)}{f(x+b_1)\cdots f(x+b_n)}, $$ where $f$ is an entire function are investigated. Earlier results for Euler's gamma function and other entire functions of genus 1 are…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
Let $A_p(\C)$ be the space of entire functions such that $| f(z)|\le Ae^{Bp(z)}$ for some $A,B>0$ and let $V$ be a discrete sequence of complex numbers which is not a uniqueness set for $A_p(\C)$. We use $L^2$ estimates for the…