English
Related papers

Related papers: Strictly monotone sequences of lower and upper bou…

200 papers

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

Numerical Analysis · Mathematics 2017-04-19 Jianxing Zhao , Caili Sang

Many special functions are solutions of first order linear systems $y_n'(x)=a_n(x)y_n(x)+d_n(x)y_{n-1}(x)$, $y_{n-1}'(x)=b_n(x)y_{n-1}(x)+e_{n}(x)y_n(x)$. We obtain bounds for the ratios $y_n(x)/y_{n-1}(x)$ and the logarithmic derivatives…

Classical Analysis and ODEs · Mathematics 2011-10-06 Javier Segura

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy

In this paper we focus on the study of the monotonicity properties of the residual and the past extropy as well as on some characterization problems. We then apply the derived results to analyze further stochastic aspects of order…

Statistics Theory · Mathematics 2024-06-24 Mohamed Kayid

A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is…

Computational Geometry · Computer Science 2016-01-08 Stefan Felsner , Alexander Igamberdiev , Philipp Kindermann , Boris Klemz , Tamara Mchedlidze , Manfred Scheucher

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

Optimization and Control · Mathematics 2020-03-26 D. Russell Luke , Marc Teboulle , Nguyen H. Thao

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

Combinatorics · Mathematics 2022-11-07 Nathan Fox

In this paper, we study the perturbation of the extreme singular values of a matrix in the particular case where it is obtained after appending an arbitrary column vector. Such results have many applications in bifurcation theory, signal…

Spectral Theory · Mathematics 2014-12-17 Stephane Chretien , Sebastien Darses

The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that…

Combinatorics · Mathematics 2013-07-02 S. Foldes , R. Radeleczki

This paper is devoted to study the existence of solutions and the monotone method of second-order periodic boundary value problems when the lower and upper solutions $\alpha$ and $\beta$ violate the boundary conditions $…

Classical Analysis and ODEs · Mathematics 2016-10-25 Faouzi Haddouchi , Slimane Benaicha

This paper concerns generalized differential characterizations of maximal monotone set-valued mappings. Using advanced tools of variational analysis, we establish coderivative criteria for maximal monotonicity of set-valued mappings, which…

Optimization and Control · Mathematics 2015-01-05 N. H. Chieu , G. M. Lee , B. S. Mordukhovich , T. T. A. Nghia

A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5})…

Computational Geometry · Computer Science 2016-04-26 Philipp Kindermann , André Schulz , Joachim Spoerhase , Alexander Wolff

The notion of Fej\'er monotonicity has proven to be a fruitful concept in fixed point theory and optimization. In this paper, we present new conditions sufficient for convergence of Fej\'er monotone sequences and we also provide…

Functional Analysis · Mathematics 2020-04-14 H. H. Bauschke , M. N. Dao , W. M. Moursi

In this paper we obtain non-uniform exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded. The algorithm Context is a well-known tool to estimate the…

Statistics Theory · Mathematics 2008-05-22 Antonio Galves , Florencia Leonardi

We consider independent long-range percolation models on locally finite vertex-transitive graphs. Using coupling ideas we prove strict monotonicity of the critical points with respect to local perturbations in the connection function,…

Probability · Mathematics 2025-10-31 Stein Andreas Bethuelsen , Christian Mönch

For linear multivariate purely second order highla degenerated parabolic equations with univariate convex data, monotonicity of the coefficent matrices implies monotonicity of the related value functions under usual regularity and growth…

Probability · Mathematics 2017-06-15 Jörg Kampen , Jan Vecer

In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…

Computational Complexity · Computer Science 2018-06-11 Joshua A. Grochow

In this paper, we analyze the monotone space of complexity of directed connectivity for a large class of input graphs $G$ using the switching network model. The upper and lower bounds we obtain are a significant generalization of previous…

Data Structures and Algorithms · Computer Science 2013-12-17 Aaron Potechin

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

Information Theory · Computer Science 2013-12-06 Harald Niederreiter , Chaoping Xing

Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…

Computational Complexity · Computer Science 2026-03-10 Nikolai Chukhin , Alexander S. Kulikov , Ivan Mihajlin , Arina Smirnova
‹ Prev 1 2 3 10 Next ›