相关论文: Special functions associated with root systems: re…

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

The two linearly independent solutions of the three-term recurrence relation of the associated Askey-Wilson polynomials, found by Ismail and Rahman in [22], are slightly modified so as to make it transparent that these functions satisfy a…

In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone in this area. We reduce certain…

This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…

The class of SHD spaces was recently introduced in [12]. The first part of this paper focuses on answering most of the questions presented in that article. For instance, we exhibit an example of a non-SHD Tychonoff space $X$ such that…

By introducing a novel integration kernel for Mellin transform, we uncover many previously unknown and intriguing properties of the Witten zeta functions of rank two and three. Detailed results concerning their pole locations, residues, and…

This work is dedicated to the promotion of the results Hadamard, Landau E., Walvis A., Estarmann T and Paul R. Chernoff for pseudo zeta functions. The properties of zeta functions are studied, these properties can lead to new regularities…

This review article was first published in 2008 as chapter 11 in the book "Fast Fourier Transforms," edited by C. S. Burrus, for the Connexions project at Rice University, which is sadly no longer online. It gives a high-level overview of…

In this article, we further explore convex functions by revealing new bounds, resulting from stronger convexity behavior. In particular, we define the so called radical convex functions and study their properties. We will see that such…

These notes contain part of the lectures of an introductory course on orthogonal polynomials and special functions that I gave in the joint PhD Program in Mathematics UC|UP in the academic years 2015-2016 (at University of Porto) and…

The AAA algorithm, introduced in 2018, computes best or near-best rational approximations to functions or data on subsets of the real line or the complex plane. It is much faster and more robust than previous algorithms for such problems…

Mathematical functions, which often appear in mathematical analysis, are referred to as special functions and have been studied over hundreds of years. Many books and dictionaries are available that describe their properties and serve as a…

Starting from special near-bent functions in dimension 2t-1 we construct bent functions in dimension 2t having a specific derivative. We deduce new famillies of bent functions

In this work the interplay between matrix biorthogonal polynomials with respect to a matrix of linear functionals, the $k$-th associated matrix polynomials and the second kind matrix functions, is studied in terms of quasideterminants. A…

Set-functions appear in many areas of computer science and applied mathematics, such as machine learning, computer vision, operations research or electrical networks. Among these set-functions, submodular functions play an important role,…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

In this paper, we continue studying the properties of $\gamma$-semi-continuous and $\gamma$-semi-open functions introduced in [5].

Expansion of higher transcendental functions in a small parameter are needed in many areas of science. For certain classes of functions this can be achieved by algebraic means. These algebraic tools are based on nested sums and can be…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

We develop explicit formulas and algorithms for arithmetic in radical function fields K/k(x) over finite constant fields. First, we classify which places of k(x) whose local integral bases have an easy monogenic form, and give explicit…