Related papers: Maximal monotone operators with non-maximal graphi…

We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…

Maximally monotone operators and firmly nonexpansive mappings play key roles in modern optimization and nonlinear analysis. Five years ago, it was shown that if finitely many firmly nonexpansive operators are all asymptotically regular…

Given a simple graph $G$, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a…

In this paper, we introduce a criterion for maximal operators associated with Fourier multipliers to be bounded on $L^p(\mathbb{R}^d)$. Noteworthy examples satisfying the criterion are multipliers of the Mikhlin type or limited decay which…

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

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…

Let $\Omega $ be any set of directions (unit vectors) on the plane. We study maximal operators defined by \md0 M_\Omega f(x)=\sup_{\delta >0, \omega \in \Omega} \frac{1}{2\delta}\int_{-\delta}^\delta |f(x+t\omega)|dt. \emd for the…

Let $G$ be a graph on $n$ vertices and $m$ edges and $D(G,x)$ the domination polynomial of $G$. In this paper we completely characterize the values of $n$ and $m$ for which optimal graphs exist for domination polynomials. We also show that…

We consider entropy-optimal graphons associated with extreme and near-extreme constraints on the densities of edges and triangles. We prove that the optimizers for near-extreme constraints are unique and multipodal and are perturbations of…

We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions. The results obtained partially extend work on linear and at most…

We examine the harmonic and geometric maximal operators defined for a general basis of open sets in $\R^n$. We prove two weight norm inequalities for the harmonic maximal operator assuming testing conditions over characteristic functions of…

For a fixed graph G, a maximal independent set is an independent set that is not a proper subset of any other independent set. P. Erd\"os, and independently, J. W. Moon and L. Moser, and R. E. Miller and D. E. Muller, determined the maximum…

In optimal control problems, there exist different kinds of extremals, that is, curves candidates to be solution: abnormal, normal and strictly abnormal. The key point for this classification is how those extremals depend on the cost…

A maximal independent set in a graph $G$ is an independent set that cannot be extended to a larger independent set by adding any vertex from $G$. This paper investigates the problem of determining the maximum number of maximal independent…

In this paper we study some questions about the continuity of classical and fractional maximal operators in the Sobolev space $W^{1,1}$, in both continuous and discrete setting, giving a positive answer to two questions posed recently, one…

Let $X$ be a real reflexive Banach space and $X^*$ be its dual space. Let $G_1$ and $G_2$ be open subsets of $X$ such that $\bar G_2\subset G_1$, $0\in G_2$, and $G_1$ is bounded. Let $L: X\supset D(L)\to X^*$ be a densely defined linear…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…

We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

In this note, a Wegner estimate for random divergence-type operators that are monotone in the randomness is proven. The proof is based on a recently shown unique continuation estimate for the gradient and the ensuing eigenvalue liftings.…