Related papers: Combinatorial inequalities
Some additive reverses of the generalised triangle inequality in normed linear spaces are given. Applications for complex numbers are provided as well.
The main purpose of this short note, on the one hand, to is rigorize some part of the proof of Theorem 1.3 in [11] in a simple way, and on the other hand, to give an alternative argument from local inequalities to global ones.
This report addresses the challenge of limited labeled datasets for developing legal recommender systems, particularly in specialized domains like labor disputes. We propose a new approach leveraging the co-citation of legal articles within…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…
This document is written in order to establish a common base ground on which the majority of the relevant research about linear fountain codes can be analyzed and compared. As far as I am concerned, there is no unified approach that…
This is a short expository article on alternating knots and is to appear in the Concise Encyclopedia of Knot Theory.
In this paper we prove several inequalities by means of diagrammatic expansions, a technique already used in [BG13]. This time we show that iterations of the folding of a probability leads to the proof of some in- equalities by means of a…
We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.
This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of…
Azuma's inequality is a tool for proving concentration bounds on random variables. The inequality can be thought of as a natural generalization of additive Chernoff bounds. On the other hand, the analogous generalization of multiplicative…
We consider combinatorial properties of the Mills' ratio, and explore the interplay between a continued fraction expansion for the Mills' ratio, the Laplace polynomials and a new family of combinatorial identities.
We propose a coreference annotation scheme as a layer on top of the Universal Conceptual Cognitive Annotation foundational layer, treating units in predicate-argument structure as a basis for entity and event mentions. We argue that this…
In this article, we explore the celebrated Gr\"{u}ss inequality, where we present a new approach using the Gr\"{u}ss inequality to obtain new refinements of operator means inequalities. We also present several operator Gr\"{u}ss-type…
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Due to the recent renewal in the interest for embedded surfaces we provide a list of commented references of interest.
In this paper, we establish various inequalities for some differentiable mappings that are linked with the illustrious Hermite-Hadamard integral inequality for mappings whose derivatives are $s$-$(\alpha,m)$-convex.The generalised integral…
This is a supplement to the article "Markov Chain Monte Carlo Based on Deterministic Transformations" available at http://arxiv.org/abs/1106.5850
This paper constitutes an extension to the report on DISA-MU team participation in the ImageCLEF 2014 Scalable Concept Image Annotation Task as published in [3]. Specifically, we introduce a new similarity search component that was…
These notes are a summary of the problem session discussions at various CANT (Combinatorial and Additive Number Theory Conferences). Currently they include all years from 2009 through 2019 (inclusive); the goal is to supplement this file…