English
Related papers

Related papers: Complete monotonicity of log-functions

200 papers

We characterize the complete monotonicity of the Kilbas-Saigo function on the negative half-line. We also provide the exact asymptotics at $-\infty$, and uniform hyperbolic bounds are derived. The same questions are addressed for the…

Classical Analysis and ODEs · Mathematics 2020-12-11 Lotfi Boudabsa , Thomas Simon

A wedge (i.e., a closed nonempty set in the Euclidean space stable under addition and multiplication with non-negative scalars) induces by a standard way a semi-order (a reflexive and transitive binary relation) in the space. The wedges…

Optimization and Control · Mathematics 2012-01-24 A. B. Németh , S. Z. Németh

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

Classical Analysis and ODEs · Mathematics 2026-01-01 Maxim R. Burke

We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…

Numerical Analysis · Mathematics 2021-12-03 Giovanni Barbarino , Davide Bianchi , Carlo Garoni

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din

We study families $u_s$ of functions satisfying the equations $(-\Delta)^s u_s=0$, $s \in (0,1)$ in a smooth bounded open set $\Omega \subset \mathbb{R}^N$. The main purpose of this paper is twofold. First, we provide a detailed analysis of…

Analysis of PDEs · Mathematics 2026-05-08 Sven Jarohs , Abhrojyoti Sen , Tobias Weth

In the paper, by establishing the monotonicity of some functions involving the sine and cosine functions, the authors provide concise proofs of some known inequalities and find some new sharp inequalities involving the Seiffert,…

Classical Analysis and ODEs · Mathematics 2013-01-29 Wei-Dong Jiang , Feng Qi

We introduce and study a cone which consists of a class of generalized polynomial functions and which provides a common framework for recent non-negativity certificates of polynomials in sparse settings. Specifically, this…

Algebraic Geometry · Mathematics 2020-09-22 Lukas Katthän , Helen Naumann , Thorsten Theobald

We study the relations between some geometric properties of maximal monotone operators and generic geometric and analytical properties of the functions on the associate Fitzpatrick family of convex representations. We also investigate under…

Functional Analysis · Mathematics 2012-07-13 B. F. Svaiter

We investigate conditions for logarithmic complete monotonicity of a quotient of two products of gamma functions, where the argument of each gamma function has different scaling factor. We give necessary and sufficient conditions in terms…

Classical Analysis and ODEs · Mathematics 2015-04-20 Dmitrii Karp , Elena Prilepkina

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…

Group Theory · Mathematics 2020-11-30 Gioacchino Antonelli , Enrico Le Donne

In this paper, we study the Hamiltonian differential systems with homogeneous nonlinearity parts on $\mathbb{C}^2$. Firstly, we present a series of topological properties of polynomial Hamiltonian functions, with a particular focus on the…

Dynamical Systems · Mathematics 2024-08-23 Guangfeng Dong , Jiazhong Yang

We study entire functions whose zeros and one-points lie on distinct finite systems of rays. General restrictions on these rays are obtained. Non-trivial examples of entire functions with zeros and one-points on different rays are…

Complex Variables · Mathematics 2018-09-14 Walter Bergweiler , Alexandre Eremenko , Aimo Hinkkanen

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…

Computational Complexity · Computer Science 2017-10-24 Paweł M. Idziak , Jacek Krzaczkowski

The aim of this paper is to develop analytic techniques to deal with certain monotonicity of combinatorial sequences. (1) A criterion for the monotonicity of the function $\sqrt[x]{f(x)}$ is given, which is a continuous analog for one…

Combinatorics · Mathematics 2015-04-29 Bao-Xuan Zhu

We investigate uniqueness problems for an entire function that shares two small functions of finite order with their difference operators. In particular, we give a generalization of a result in $[2]$.

Complex Variables · Mathematics 2015-05-11 Zinelâabidine Latreuch , Abdallah El Farissi , Benharrat Belaidi

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$ and study the distribution of zeros of Dirichlet polynomials $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ corresponding to these functions. We prove that the…

Number Theory · Mathematics 2019-12-10 Arindam Roy , Akshaa Vatwani

In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…

Complex Variables · Mathematics 2019-07-02 Jorge Mozo Fernández

We study the logarithmic syntomic cohomology of fine and saturated log schemes and its realization in the logarithmic motivic stable homotopy category $\mathrm{logSH}(\mathrm{pt}_\mathbb{N})$ of a log point. We prove that logarithmic…

Algebraic Geometry · Mathematics 2025-12-03 Doosung Park , Paul Arne Østvær

We study the problem of learning a binary classifier on the vertices of a graph. In particular, we consider classifiers given by monophonic halfspaces, partitions of the vertices that are convex in a certain abstract sense. Monophonic…

Machine Learning · Computer Science 2024-06-19 Marco Bressan , Emmanuel Esposito , Maximilian Thiessen