Related papers: Monotone Linear Relations: Maximality and Fitzpatr…
Recently, the saturation problem of $0$-$1$ matrices gained a lot of attention. This problem can be regarded as a saturation problem of ordered bipartite graphs. Motivated by this, we initiate the study of the saturation problem of ordered…
This work deals with a maximal monotone operator $A$ of type (D) in a Banach space whose dual space is strictly convex. We establish some representations for the value $Ax$ at a given point $x$ via its values at nearby points of $x$. We…
In the article, a notion "logarithmically absolutely monotonic function" is introduced, an inclusion that a logarithmically absolutely monotonic function is also absolutely monotonic is revealed, the logarithmically complete monotonicity…
In the paper, the authors concisely survey and review some functions involving the gamma function and its various ratios, simply state their logarithmically complete monotonicity and related results, and find necessary and sufficient…
The dominant method for defining multivariate operator means is to express them as fix-points under a contraction with respect to the Thompson metric. Although this method is powerful, it crucially depends on monotonicity. We are developing…
This note contains some observations on primary matrix functions and different notions of monotonicity with relevance towards constitutive relations in nonlinear elasticity. Focussing on primary matrix functions on the set of symmetric…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
We show a surprising connexion between a property of the inf convolution of a family of convex lower semicontinuous functions and the fact that the intersection of maximal cyclically monotone graphs is the critical set of a bipotential. We…
By the linearization property of Lipschitz-free spaces, any Lipschitz map $f : M \to N$ between two pointed metric spaces may be extended uniquely to a bounded linear operator $\widehat{f} : \mathcal F(M) \to \mathcal F(N)$ between their…
We investigate conditions for logarithmic complete monotonicity of product ratios of gamma and q-gamma functions whose arguments are linear functions of the variable. We give necessary and sufficient conditions in terms of nonnegativity of…
We show that for group actions on locally connected spaces the maximal equicontinuous factor map is always monotone, that is, the preimages of single points are connected. As an application, we obtain that if the maximal continuous factor…
Let $(X,x)$ be an isolated complete intersection singularity and let $f : (X,x) \to (\CC,0)$ be the germ of an analytic function with an isolated singularity at $x$. An important topological invariant in this situation is the…
The paper is devoted to a systematic study and characterizations of notions of local maximal monotonicity and their strong counterparts for set-valued operators that appear in variational analysis, optimization, and their applications. We…
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of…
In the paper, necessary and sufficient conditions are presented for a function involving a ratio of gamma functions to be logarithmically completely monotonic. This extends and generalizes the main result in [\emph{Inequalities and…
In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…
The Hardy-Littlewood maximal function $\mathcal{M}$ and the trigonometric function $\sin{x}$ are two central objects in harmonic analysis. We prove that $\mathcal{M}$ characterizes $\sin{x}$ in the following way: let $f \in…
Convex regression is the problem of fitting a convex function to a data set consisting of input-output pairs. We present a new approach to this problem called spectrahedral regression, in which we fit a spectrahedral function to the data,…
A piecewise linear function can be described in different forms: as an arbitrarily nested expression of $\min$- and $\max$-functions, as a difference of two convex piecewise linear functions, or as a linear combination of maxima of…
A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a…