Related papers: A note on the maximal numerical range

We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…

For a graph $G$ of order $n$ a maximal edge coloring is a proper edge coloring with $\chi'(K_n)$ colors such that adding any edge to $G$ in any color makes it improper. Meszka and Tyniec proved that for some values of the number of edges…

Consider $n$ sensors whose positions are represented by $n$ uniform, independent and identically distributed random variables assuming values in the open unit interval $(0,1)$. A natural way to guarantee connectivity in the resulting sensor…

We introduce a numerical radius operator space $(X, \mathcal{W}_n)$. The conditions to be a numerical radius operator space are weaker than the Ruan's axiom for an operator space $(X, \mathcal{O}_n)$. Let $w(\cdot)$ be the numerical radius…

We consider the magnetic Schrodinger operator in a two-dimensional strip. On the boundary of the strip the Dirichlet boundary condition is imposed except for a fixed segment (window), where it switches to magnetic Neumann boundary condition…

We study a control problem where the state equation is a nonlinear partial differential equation of the calculus of variation in a bounded domain, perturbed by noise. We allow the control to act on the boundary and set stochastic boundary…

We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the size of their intersection. We provide a comprehensive…

In this paper we examine boundedness of fractional maximal operator. The main focus is on commutators and maximal commutators on generalized Orlicz spaces for fractional maximal functions and Riesz potentials. We prove their boundedness…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free…

The expectation values of operators drawn from a single quantum state cannot be outside of a particular region, called their allowed region or the joint numerical range of the operators. Basically, the allowed region is an image of the…

We present upper and lower bounds for the numerical radius of $2 \times 2$ operator matrices which improves on the existing bound for the same. As an application of the results obtained we give a better estimation for the zeros of a…

In this paper we study the $L^p$ boundedness of the centred and the uncentred Hardy--Littlewood maximal operators on the class $\Upsilon_{a,b}$, $2\leq a\leq b$, of trees with $(a,b)$-bounded geometry. We find the sharp range of $p$,…

We examine a purely geometric property of a point in the boundary of the numerical range of a (Hilbert space) operator that implies that such a point is a reducing essential eigenvalue of the given operator. Roughly speaking, such a…

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…

We identify Fock-type spaces $\mathcal{F}_{(m,p)}$ on which the differentiation operator $D$ has closed range. We prove that $D$ has closed range only if it is surjective, and this happens if and only if $m=1$. Moreover, since the operator…

Here, we focus on Anderson type operators over infinite graphs where the randomness acts through higher rank perturbations. We show that for special family of graphs, the operator has non-trivial multiplicity for its pure point spectrum.…

Maximum throughput requires path diversity enabled by bifurcating traffic at different network nodes. In this work, we consider a network where traffic bifurcation is allowed only at a subset of nodes called \emph{routers}, while the rest…

We present several sharp upper bounds and some extension for product operators. Among other inequalities, it is shown that if , , are non-negative continuous functions on such that , , then for all non-negative operator monotone decreasing…

We characterize the space $BV(I)$ of functions of bounded variation on an arbitrary interval $I\subset \mathbb{R}$, in terms of a uniform boundedness condition satisfied by the local uncentered maximal operator $M_R$ from $BV(I)$ into the…