English
Related papers

Related papers: Generalization of Subadditive, Monotone and Convex…

200 papers

Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…

Number Theory · Mathematics 2015-06-02 Patrick Cégielski , Serge Grigorieff , Irène Guessarian

A set function $f$ on a finite set $V$ is submodular if $f(X) + f(Y) \geq f(X \cup Y) + f(X \cap Y)$ for any pair $X, Y \subseteq V$. The symmetric difference transformation (SD-transformation) of $f$ by a canonical set $S \subseteq V$ is a…

Discrete Mathematics · Computer Science 2019-02-08 Junpei Nakashima , Yukiko Yamauchi , Shuji Kijima , Masafumi Yamashita

Given an undirected unweighted graph $G = (V, E)$ on $n$ vertices and $m$ edges, a subgraph $H\subseteq G$ is a spanner of $G$ with stretch function $f: \mathbb{R}_+ \rightarrow \mathbb{R}_+$, if for every pair $s, t$ of vertices in $V$,…

Data Structures and Algorithms · Computer Science 2024-10-18 Zihan Tan , Tianyi Zhang

By considering a fixed point in unit disk $\Delta$, a new class of univalent convex functions is defined. Coefficient inequalities, integral operator and extreme points of this class are obtained.

Complex Variables · Mathematics 2009-04-23 Sh. Najafzadeh , M. Eshaghi Gordji , A. Ebadian

Let $\mathbb{N}$ be a set of the natural numbers. Symmetric inverse semigroup $R_\infty$ is the semigroup of all infinite 0-1 matrices $\left[ g_{ij}\right]_{i,j\in \mathbb{N}}$ with at most one 1 in each row and each column such that…

Representation Theory · Mathematics 2019-12-06 N. I. Nessonov

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi

Let $\psi:\mathbb R_+\to\mathbb R_+$ be a non-increasing function. A real number $x$ is said to be $\psi$-Dirichlet improvable if the system $$|qx-p|< \, \psi(t) \ \ {\text{and}} \ \ |q|<t$$ has a non-trivial integer solution for all large…

Number Theory · Mathematics 2022-08-22 Philip Bos , Mumtaz Hussain , David Simmons

Let $R$ be a commutative ring $R$ with $1_R$ and with group of units $R^{\times}$. Let $\Phi = \Phi(t_1,\ldots, t_h) = \sum_{i=1}^h \varphi_it_i$ be an $h$-ary linear form with nonzero coefficients $\varphi_1,\ldots, \varphi_h \in R$. Let…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Let $\phi_1,\ldots,\phi_n:[0,1]\to (0,1)$ be Lipschitz contractions. Let $I=[0,1)$, $x_0=0$ and $x_n=1$. We prove that for Lebesgue almost every $(x_1,...,x_{n-1})$ satisfying $0<x_1<\cdots <x_{n-1}<1$, the piecewise contraction $f:I\to I$…

Dynamical Systems · Mathematics 2014-08-08 Arnaldo Nogueira , Benito Pires , Rafael A. Rosales

Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…

Combinatorics · Mathematics 2021-10-01 Richard P. Stanley

For a set $M$ of $m$ elements, we define a decreasing chain of classes of normalized monotone-increasing valuation functions from $2^M$ to $\mathbb{R}_{\geq 0}$, parameterized by an integer $q \in [2,m]$. For a given $q$, we refer to the…

Computer Science and Game Theory · Computer Science 2023-04-05 Kiril Bangachev , S. Matthew Weinberg

We completely characterize the unimodal category for functions $f:\mathbb R\to[0,\infty)$ using a decomposition theorem obtained by generalizing the sweeping algorithm of Baryshnikov and Ghrist. We also give a characterization of the…

Algebraic Topology · Mathematics 2017-09-20 Dejan Govc

We introduce prox-convex for minimizing $F(x)=g(x)+h(C(x))+s(R(x))$, where $g$ and $h$ are convex, $C$ and $s$ are smooth, and each component of $R$ is convex (possibly nonsmooth). Here $g$ captures general convex objectives and indicator…

Optimization and Control · Mathematics 2025-12-24 Samet Uzun , Dayou Luo , Behçet Açıkmeşe , Aleksandr Y. Aravkin

A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…

Optimization and Control · Mathematics 2018-10-16 Marc Lassonde

We revisit and prove some convexity inequalities for trace functions conjectured in the earlier part I. The main functional considered is \Phi_{p,q}(A_1,A_2,...,A_m) = (trace((\sum_{j=1}^m A_j^p)^{q/p}))^{1/q} for m positive definite…

Operator Algebras · Mathematics 2008-02-25 Eric A. Carlen , Elliott H. Lieb

Motivated by a problem on comonotone approximation of $C^n$ functions by entire functions, for increasing functions $f\colon[0,1]\to[0,1]$, we characterize the possible values of $(a,b,c)$, where $a=I(f)(1)$, $b=I^2(f)(1)$, $c=I^3(f)(1)$…

Classical Analysis and ODEs · Mathematics 2025-12-03 Maxim R. Burke , Maleeha Haris , Madhavendra

A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq…

Discrete Mathematics · Computer Science 2012-12-04 Gregory Gutin , Anders Yeo

We develop a Fourier analysis for a generalization of the class of periodic functions, often referred to as $(\theta, T)$-periodic functions, and prove several properties and inequalities related to the Fourier transform, including a type…

Analysis of PDEs · Mathematics 2025-12-19 André Pedroso Kowacs , Marielle Aparecida Silva

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

Number Theory · Mathematics 2020-07-16 Lhoussain El Fadil

In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…

Classical Analysis and ODEs · Mathematics 2023-03-07 Eszter Gselmann , Gergely Kiss
‹ Prev 1 8 9 10 Next ›