Related papers: On the Monotonicity of Work Function in k-Server C…
In this paper, we present some monotonicity rules for the ratio of two power series $x\mapsto \sum_{k=0}^\infty a_k x^k / \sum_{k=0}^\infty b_k x^k$ under the assumption that the monotonicity of the sequence ${a_k/b_k}$ changes twice.…
We prove in this paper that the expected value of the objective function of the $k$-means++ algorithm for samples converges to population expected value. As $k$-means++, for samples, provides with constant factor approximation for $k$-means…
Top monotonicity is a relaxation of various well-known domain restrictions such as single-peaked and single-crossing for which negative impossibility results are circumvented and for which the median-voter theorem still holds. We examine…
Motivated by open questions in the papers " Refinements and sharpenings of some double inequalities for bounding the gamma function" and "Complete monotonicity and monotonicity of two functions defined by two derivatives of a function…
This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…
A cornerstone in convex analysis is the crucial relationship between functions and their convex conjugate via the Fenchel-Young inequality. In this dual variable setting, the maximal monotonicity of the contact set $ \big\{(x,y) \ \big| \…
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…
Standardness is a popular assumption in the literature on set estimation. It also appears in statistical approaches to topological data analysis, where it is common to assume that the data were sampled from a probability measure that…
The $k$-means++ algorithm by Arthur and Vassilvitskii [SODA 2007] is a classical and time-tested algorithm for the $k$-means problem. While being very practical, the algorithm also has good theoretical guarantees: its solution is $O(\log…
In the work, we focus on a conjecture due to Z.X. Chen and H.X. Yi[1] which is concerning the uniqueness problem of meromorphic functions share three distinct values with their difference operators. We prove that the conjecture is right for…
Based on a sequence of numerical computations, a conjecture is presented regarding the class of functions $H(x;a)=\exp(a)-(1+a/x)^x$, and the open problem of determining the values of $a$ for which the functions are completely monotonic…
We mainly establish a monotonicity property between some special Riemann sums of a convex function $f$ on $[a,b]$, which in particular yields that $\frac{b-a}{n+1}\sum_{i=0}^n f\left(a+i\frac{b-a}{n}\right)$ is decreasing while…
We investigate properties of a bootstrap-based methodology for testing hypotheses about equality of certain characteristics of the distributions between different populations in the context of functional data. The suggested testing…
Distributed data collection is a fundamental task in open systems. In such networks, data is aggregated across a network to produce a single aggregated result at a source device. Though self-stabilizing, algorithms performing data…
Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…
Coding theory revolves around the incorporation of redundancy into transmitted symbols, computation tasks, and stored data to guard against adversarial manipulation. However, error correction in coding theory is contingent upon a strict…
Operator monotone functions, introduced by Lowner in 1934, are an important class of real-valued functions. They arise naturally in matrix and operator theory and have various applications in other branches of mathematics and related…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
We prove two conjectures on correlation inequalities for functions that are linear combinations of unimodal Boolean monotone nondecreasing functions
We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…