Related papers: Hyperations, Veblen progressions and transfinite i…
We consider the Frobenius algebra of functions on the critical set of the master function of a weighted arrangement of hyperplanes in $\C^k$ with normal crossings. We construct two potential functions (of first and second kind) of variables…
In this paper we introduce and prove some properties of $(\alpha;\beta)$-normal operators according to semi-Hilbertian space structures. Furthermore we s,ate various inequalities between the A-operator norm and A-numerical radius of…
Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…
Sequence transformations accomplish an acceleration of convergence or a summation in the case of divergence by detecting and utilizing regularities of the elements of the sequence to be transformed. For sufficiently large indices, certain…
Extending earlier work by Rogers, Wiener-Hopf factorisation is studied for a class of functions closely related to Nevanlinna-Pick functions and complete Bernstein functions. The name 'Rogers functions' is proposed for this class. Under…
The functional linear model extends the notion of linear regression to the case where the response and covariates are iid elements of an infinite dimensional Hilbert space. The unknown to be estimated is a Hilbert-Schmidt operator, whose…
We construct bisymmetric, strictly increasing binary operations on real intervals which are not continuous. This answers a natural question in the theory of bisymmetric and mean-type operations by showing that continuity may fail for…
We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…
Motivated mainly by certain interesting recent extensions of the Gamma, Beta and hypergeometric functions, we introduce here new extensions of the Beta function, hypergeometric and confluent hypergeometric functions. We systematically…
Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…
The hypergeometric zeta function is defined in terms of the zeros of the Kummer function M(a, a + b; z). It is established that this function is an entire function of order 1. The classical factorization theorem of Hadamard gives an…
This article presents a natural extension of the tensor algebra. In addition to "left multiplications" by vectors, we can consider "derivations" by covectors as basic operators on this extended algebra. These two types of operators satisfy…
We introduce a renormalization procedure which allows us to study in a unified and concise way different properties of the irrational rotations on the unit circle $\beta \mapsto \set{\alpha+\beta}$, $\alpha \in \R\setminus \Q$. In…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
Generating functions for a fixed genus map and hypermap enumeration become rational after a simple explicit change of variables. Their numerators are polynomials with integer coefficients that obey a differential recursion, and denominators…
A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…
It has been observed that linearizability, the prevalent consistency condition for implementing concurrent objects, does not preserve some probability distributions. A stronger condition, called strong linearizability has been proposed, but…
The aim of this paper is to present a new simple recurrence for Appell and Sheffer sequences in terms of the linear functional that defines them, and to explain how this is equivalent to several well-known characterizations appearing in the…