Searcharxiv⌕ Search

arXiv subjects

Angshuman R. Goswami

Publications and source records attributed to Angshuman R. Goswami.

13 recordsLinked to original sources

On Weighted Convex Graphs

The main objective of this paper is to develop Krein-Milman-type theorems and Ulam-type stability results for graphs. To establish these results, we introduce several meaningful definitions of vertex-weighted convex graphs inspired by the concept of sequential convexity. We also present a close relationship between the two discrete structures, namely sequential convexity and perfect binary trees. We show that if a graph satisfies a certain convexity property approximately, then this property can be made exact by minimally perturbing the weights assigned to its vertices. Furthermore, we study several structural characterisations, formulate convex minorants for weighted graphs, and derive sandwich-type results. Special emphasis is placed on trees, and an investigation of extremal value problems is also carried out

math.GM↗

On characterizations, Decompositions, and Stability of Convex Sequences

This paper introduces new characterizations, decomposition theorems, and stability results for convex sequences. We show that a sequence is convex precisely when its epigraph satisfies a midpoint convexity condition, thereby connecting discrete and geometric notions of convexity. A decomposition result proves that any sequence can be written as the difference of two convex sequences, with generalizations to higher-order convexity. We construct nontrivial convex minorants for bounded-below sequences and establish a Hyers-Ulam-type stability theorem showing that any approximately convex sequence can be uniformly approximated by a genuine convex sequence without significantly altering its values. Finally, for a concave sequence, we characterize those subsequences that are convex in it by providing slope inequalities and monotone auxiliary sequences. We explore the interplay among convexity, subadditivity, and periodically indexed subsequences.

math.GM↗

Approximate monotonicity, subadditivity, and convexity in weighted topologies

The central question of this paper is the following: "If a topological space equipped with a weight function satisfies a certain property only approximately, can we recover the original structure without significantly altering the weights?'' To each open set of a topological space, we assign a non-negative weight and study approximate versions of three natural properties: monotonicity, subadditivity, and convexity. Through this study, we develop Hyers--Ulam-type stability results in general topology. In addition, we investigate several topology-specific cases, as well as present minorant and sandwich-type results.

math.GM↗

On Weighted Star--Convex Graphs

The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these two branches of mathematics. A simple connected vertex-weighted graph $G(V,E)$ with a non-empty set of leaf vertices is said to be star-convex if there exists at least one node $u\in V(G)$ such that, for every chosen leaf vertex $v$, there is a monotone path (either increasing or decreasing) connecting $v$ to $u$. One of the main results states that a graph $G$ is star-convex if and only if there exists a tree $T\subseteq G$ that contains all leaf vertices and is itself star-convex. On the other hand, a sequence $\big(u_n\big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_{i}\leq u_{i-1}+u_{i+1}\qquad \mbox{for all}\quad i\in \mathbb{N}. $$ We demonstrate that, under minimal assumptions, a class of convex sequences can be embedded into a spider graph so as to make it star-convex.

math.GM↗

Some Stability Results on Graphs

The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a corresponding graph with the same vertex and edge sets bearing the exact ideal structural property. We prove that the weight difference on the two graphs depends on the associated error and does not vary significantly.

math.GM↗

Revisiting Ostrowski's Inequality

The main objective of this paper is to present Ostrowski's inequality for a broader class of functions and to propose a refinement to the classical version of it. The original Ostrowski's inequality can be stated as follows "If $f:[a,b]\to\mathbb{R}$ is differentiable and $f'\in L^{\infty}[a, b]$, then for any $p\in\,]a,b[\,$, the following functional inequality holds: \begin{equation*} \Bigg|f(p)-\dfrac{1}{b-a}\int_{a}^{b}f(t)\,dt\Bigg|\leq \dfrac{(p-a)^2+(b-p)^2}{2(b-a)}\Big\| f'\Big\|_a^b\,.\,^{^{^{^{^"}}}} \end{equation*} We relax the condition of differentiability and show that even if $f\in C[a,b]$ is non-differentiable at the points $p_{_{1}},\cdots,p_{_{n}}$, then for any $p\in\,]a,b[\,\setminus\overset{n}{\underset{i=1}{\cup}}\{p_{_{i}}\}$, the following Ostrowski-type inequality holds: \begin{align*} \left| f(p) - \frac{1}{b-a} \int_{a}^{b} f(t)\,dt \right| \leq \frac{1}{2} \max \Bigg\{ & \left\| f' \right\|_a^{p_1}(p_1 - a),\,\ldots,\, \left\| f' \right\|_{p_{i-1}}^p (p - p_{i-1}),\, \left\| f' \right\|_p^{p_i} (p_i - p),\, \\ & \ldots,\, \left\| f' \right\|_{p_n}^{b} (b - p_n) \Bigg\} + \max \left\{ f(a) + \sum_{i=1}^n f(p_i),\, -\sum_{i=1}^n f(p_i) - f(b) \right\}. \end{align*} Also, we investigate the possibility of proposing a refinement for Ostrowski inequality. We prove that if $f'\in L^{\infty}[a, b]$, then for any $p\in\,]a,b[$, we can restructure the inequality as follows: \begin{align*} \left| f(p) - \frac{1}{b-a} \int_{a}^{b} f(t)\,dt \right| \leq \min \Bigg\{ & \left[ \frac{1}{4} + \left( \frac{p - \frac{a + b}{2}}{b - a} \right)^2 \right](b - a) \left\| f' \right\|_{a}^{b}, \\ &\quad + \frac{1}{2} \max \left\{ (p - a) \left\| f' \right\|_{a}^{p},\, (b - p) \left\| f' \right\|_{p}^{b} \right\} \Bigg\}. \end{align*}

math.GM↗

Revisiting Fekete's Lemma, Subadditive and Periodic Sequences

In this paper, we present an alternative proof of Fekete's Lemma. We demonstrate that for any subadditive sequence, it is possible to construct a subadditive function that exactly interpolates the sequence. Using this result, along with Hille's theorem on subadditive functions, we naturally arrive at Fekete's Lemma. Additionally, we provide an explicit formula for determining the largest subadditive minorant of a given sequence. We explore a sandwich-type result and derive a discrete version of the Hyers-Ulam type stability theorem. For approximately periodic sequences, we offer a decomposition result. In the final section, we propose two characterization theorems for ordinary periodic sequences.

math.CA↗

Hermite-Hadamard type inequalities by using Newton-Cotes quadrature formulas

A convex function $f:[a,b]\to\mathbb{R}$ satisfies the so-called Hermite-Hadamard inequality $$ f\left(\frac{a+b}{2}\right)\leq \frac{1}{b-a}\int_a^{b}f(t)dt\leq \frac{f(a)+f(b)}{2}. $$ Motivated by the above estimates, in this paper we consider approximately monotone and convex functions, and give upper and lower bounds to the numerical integral mean, i.e., to $\frac1{b-a}\mathcal{I}_{n}(f)$, where $\mathcal{I}_{n}(f)$ denotes some of the most popular Newton-Cotes quadrature formulas.

math.GM↗

Generalization of Subadditive, Monotone and Convex Functions

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $Φ: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$, it satisfies the following inequality $$Φ(x+y)\leq Φ(x)+Φ(y).$$ In this paper, we consider this ordinary notion of subadditivity is of order $1$ and generalized the concept for any order $n$, where $n\in{\mathbb{N}}$. We establish that $n^{th}$ square root of a $n^{th}$ order subadditive function possesses ordinary subadditivity. We also introduce the notion of approximately subadditive function and showed that it can be decomposed as the algebraic summation of a subadditive and a bounded function. Another important newly introduced concept is Periodical monotonicity. A function $f:I\to{\mathbb{R}}$ is said to be periodically monotone with a period $d>0$ if the following holds $$ f(x)\leq f(y)\qquad\mbox{for all}\quad x,y\in I\qquad{with}\quad y-x\geq d. $$ One of the obtained results is that under a minimal assumption on $f$; this type of function can be decomposed as the sum of a monotone and a periodic function whose period is $d$. Towards the end of the paper, we discuss about star convexity. A function $f: I\to{\mathbb{R}}$ is said to be star-convex if there exists a point $p\in I$ such that for any $x\in I$ and for all $t\in [0,1]$; it satisfies either one of the following conditions. $$ t(x,f(x)) +(1-t)(p,f(p))\in epi(f) \quad \mbox{or} \quad hypo(f). $$ We studied the structural properties and showed relationship of it with star convex bodies.

math.GM↗

Generalizing the Concept of Bounded Variation

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots 1$, under minimal assumptions such functions can be treated as approximately monotone function which can be closely approximated by a nondecreasing majorant. We also proved that for $0<r_1<r_2$; the function class of $r_1$-bounded variation is contained in the class of functions satisfying $r_2$-bounded variations. We go through approximately monotone functions and present a possible decomposition for $f:I(\subseteq \mathbb{R_+})\to\mathbb{R}$ satisfying the functional inequality $$f(x)\leq f(x)+(y-x)^{p}\quad (x,y\in I\mbox{ with $x<y$ and $ p\in]0,1[ $}).$$ A generalized structural study has also be done in that specific section. On the other hand for $\ell[a,b]\geq d$; a function satisfying the following monotonic condition under the given assumption will be termed as $d$-periodically increasing $$f(x)\leq f(y)\quad \mbox{for all}\quad x,y\in I\quad\mbox{with}\quad y-x\geq d.$$ we establish that in a compact interval any bounded function can be decomposed as the difference of a monotone and a $d$-periodically increasing function.

math.GM↗

On approximately convex and affine functions

A real valued function $f$ defined on a real open interval $I$ is called $Φ$-convex if, for all $x,y\in I$, $t\in[0,1]$ it satisfies $$ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)+tΦ\big((1-t)|x-y|\big)+(1-t)Φ\big(t|x-y|\big), $$ where $Φ:\mathbb{R}_+\to\mathbb{R}_+$ is a nonnegative error function. If $f$ and $-f$ are simultaneously $Φ$-convex, then $f$ is said to be a $Φ$-affine function. In the main results of the paper, we describe the structural and inclusion properties of these two classes. We characterize these two classes of functions and investigate their relationship with approximately monotone and approximately-Hölder functions. We also introduce a subclass of error functions which enjoy the so-called $Γ$ property and we show that the error function which is the most optimal for a $Φ$-convex function has to belong to this subclass. The properties of this subclass of error function are investigated as well. Then we offer two formulas for the lower $Φ$-convex envelop. Besides, a sandwich type theorem is also added.

math.CA↗

Characterization of approximately monotone and approximately Hölder functions

A real valued function $f$ defined on a real open interval $I$ is called $Φ$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+Φ(y-x), $$ where $Φ:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative error function, where $\ell(I)$ denotes the length of the interval $I$. If $f$ and $-f$ are simultaneously $Φ$-monotone, then $f$ is said to be a $Φ$-Hölder function. In the main results of the paper, using the notions of upper and lower interpolations, we establish a characterization for both classes of functions. This allows one to construct $Φ$-monotone and $Φ$-Hölder functions from elementary ones, which could be termed the building blocks for those classes. In the second part, we deduce Ostrowski- and Hermite--Hadamard-type inequalities from the $Φ$-monotonicity and $Φ$-Hölder properties, and then we verify the sharpness of these implications. We also establish implications in the reversed direction.

math.CA↗

On approximately monotone and approximately Hölder functions

A real valued function $f$ defined on a real open interval $I$ is called $Φ$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+Φ(y-x), $$ where $Φ:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative error function, where $\ell(I)$ denotes the length of the interval $I$. If $f$ and $-f$ are simultaneously $Φ$-monotone, then $f$ is said to be a $Φ$-Hölder function. In the main results of the paper, we describe structural properties of these function classes, determine the error function which is the most optimal one. We show that optimal error functions for $Φ$-monotonicity and $Φ$-Hölder property must be subadditive and absolutely subadditive, respectively. Then we offer a precise formula for the lower and upper $Φ$-monotone and $Φ$-Hölder envelopes. We also introduce a generalization of the classical notion of total variation and we prove an extension of the Jordan Decomposition Theorem known for functions of bounded total variations.

math.CA↗