English
Related papers

Related papers: On approximately monotone and approximately H\"old…

200 papers

Let $\varphi $ be a negative plurisubharmonic function in a pseudoconvex domain $\Omega$ in $\mathbb{C}^{n}$ and $f$ be a bounded holomorphic function belonging to $L^{2}(\Omega, \varphi)$. For all negative plurisubharmonic functions $\psi$…

Complex Variables · Mathematics 2024-09-24 Nguyen Van Phu

Let $n\ge2$ and let $\Phi\colon\mathbb{R}^n\to[0,\infty)$ be a positively $1$-homogeneous and convex function. Given two convex bodies $A\subset B$ in $\mathbb{R}^n$, the monotonicity of anisotropic $\Phi$-perimeters holds, i.e.…

Metric Geometry · Mathematics 2023-09-07 Giorgio Stefani

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

Numerical Analysis · Mathematics 2023-07-25 Yohei M. Koyama

It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…

Information Theory · Computer Science 2017-12-22 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

Number Theory · Mathematics 2021-10-11 Paolo Minelli

We consider Gomory and Johnson's infinite group model with a single row. Valid inequalities for this model are expressed by valid functions and it has been recently shown that any valid function is dominated by some nonnegative valid…

Optimization and Control · Mathematics 2018-02-06 Amitabh Basu , Michele Conforti , Marco Di Summa

For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c…

Classical Analysis and ODEs · Mathematics 2016-08-02 K. Kopotun , D. Leviatan , A. Prymak , I. A. Shevchuk

The well known Boole-Shannon expansion of Boolean functions in several variables (with co-efficients in a Boolean algebra $B$) is also known in more general form in terms of expansion in a set $\Phi$ of orthonormal functions. However,…

Computational Complexity · Computer Science 2013-12-06 Virendra Sule

We prove that almost periodicity in the sense of distributions coincides with almost periodicity with respect to Stepanov's metric for the class of subharmonic functions in a horizontal strip. We also prove that Fourier coefficients of…

Complex Variables · Mathematics 2007-05-23 S. Favorov , A. Rakhnin

According to a celebrated result by L\"owner, a real-valued function $f$ is operator monotone if and only if its L\"owner matrix, which is the matrix of divided differences $L_f=(\frac{f(x_i)-f(x_j)}{x_i-x_j})_{i,j=1}^N$, is positive…

Functional Analysis · Mathematics 2013-04-23 Koenraad M. R. Audenaert

Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…

Computational Complexity · Computer Science 2025-01-22 Sourav Chakraborty , Chandrima Kayal , Rajat Mittal , Manaswi Paraashar , Nitin Saurabh

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…

General Mathematics · Mathematics 2026-03-09 Gergely Kiss

Let $N$ be a finite set of cardinality $n$, and $a\in N$. A submodular function $f$ on $N$ with $f(a)=1$ is defined to be $a$-reduced if, for any decomposition $f=g+h$ into submodular functions where $h$ does not depend on $a$, it follows…

Combinatorics · Mathematics 2026-04-28 Laszlo Csirmaz

Let $P$ be a finite simplicial comple with underlying space (union of simplices in $P$) $|P|$. Let $Q$ be a subcomplex of $P$. Let $a \geq 0$. Then there exists $K < \infty$, \emph{depending only on $a$ and $Q$,} with the following…

General Topology · Mathematics 2015-03-17 Steven P. Ellis

A function $f\colon\mathbb R\to\mathbb R$ is called \emph{$k$-monotone} if it is $(k-2)$-times differentiable and its $(k-2)$nd derivative is convex. A point set $P\subset\mathbb R^2$ is \emph{$k$-monotone interpolable} if it lies on a…

Computational Geometry · Computer Science 2015-09-14 Josef Cibulka , Jiří Matoušek , Pavel Paták

The \emph{Noetherian class} is a wide class of functions defined in terms of polynomial partial differential equations. It includes functions appearing naturally in various branches of mathematics (exponential, elliptic, modular, etc.). A…

Algebraic Geometry · Mathematics 2015-08-13 Gal Binyamini , Dmitry Novikov

We study the properties of two classes of meromorphic functions in the complex plane. The first one is the class of almost elliptic functions in the sense of Sunyer-i-Balaguer. This is the class of meromorphic functions f such that the…

Complex Variables · Mathematics 2009-06-27 S. Ju. Favorov

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose…

Data Structures and Algorithms · Computer Science 2016-05-11 Tasuku Soma , Yuichi Yoshida

The multilinear framework has achieved the breakthrough $1-1/e$ approximation for maximizing a monotone submodular function subject to a matroid constraint. This framework has a continuous optimization part and a rounding part. We extend…

Data Structures and Algorithms · Computer Science 2020-06-03 Mehrdad Ghadiri , Richard Santiago , Bruce Shepherd