Related papers: On the optimal error bound for the first step in t…

We study the minimality of $n\times n$ Hermitian matrices $A$ respect to a $C^*$-subalgebra $\mathcal{B}$ of $M_n(\mathbb{C})$ in the spectral norm, that is \[\|A\|\leq \|A+B\|,\ \text{ for every } B\in \mathcal{B}.\] We generalize the…

We solve a problem posed by A. Bonilla and K.-G. Grosse-Erdmann by constructing an entire function $f$ that is frequently hypercyclic with respect to the differentiation operator, and satisfies $M_f(r)\leq\displaystyle ce^r r^{-1/4}$, where…

In a Hilbert space, we study the strong convergence of alternating projections between two inconsistent affine subspaces with varying relaxation on one side. New convergence results are obtained by seeing the alternating projections as a…

We propose a new practical adaptive refinement strategy for $hp$-finite element approximations of elliptic problems. Following recent theoretical developments in polynomial-degree-robust a posteriori error analysis, we solve two types of…

Let H_c be the rational Cherednik algebra of type A_{n-1} with spherical subalgebra U_c=eH_ce. Then U_c is filtered by order of differential operators with associated graded ring gr U_c=C[h + h*]^W, where W is the n-th symmetric group.…

This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by…

In this paper, we give three different new proofs of the validity of the geometry conjecture about cycles of projections onto nonempty closed, convex subsets of a Hilbert space. The first uses a simple minimax theorem, which depends on the…

We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…

We propose a distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications…

We study two extension problems, and their interconnections: (i) extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; and (ii) (in case of Lie groups $G$) representations of the…

For a continuous function $f$ defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is…

By using the $\mathbb R$-filtration approach of Arakelov geometry, one establishes explicit upper bounds for geometric and arithmetic Hilbert-Samuel function for line bundles on projective varieties and hermitian line bundles on arithmetic…

In his recent research, the author improved the error term in the prime geodesic theorem for compact, even-dimensional, rank one locally symmetric spaces. It turned out that the obtained estimate $O(x^{2\rho-\frac{\rho}{n}}(\log x)^{-1})$…

Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…

We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…

We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…

Let $A$ be a set and $V$ a real Hilbert space. Let $H$ be a real Hilbert space of functions $f:A\to V$ and assume $H$ is continuously embedded in the Banach space of bounded functions. For $i=1,\cdots,n$, let $(x_i,y_i)\in A\times V$…

We revisit the classic 0-1-Knapsack problem, in which we are given $n$ items with their weights and profits as well as a weight budget $W$, and the goal is to find a subset of items of total weight at most $W$ that maximizes the total…

The Arnoldi process provides an efficient framework for approximating functions of a matrix applied to a vector, i.e., of the form $f(M)\bm{b}$, by repeated matrix-vector multiplications. In this paper, we derive error estimates for…

We study the class ${\mathcal C}(\Omega)$ of univalent analytic functions $f$ in the unit disk $\mathbb{D} = \{z \in \mathbb{C} :\,|z|<1 \}$ of the form $f(z)=z+\sum_{n=2}^{\infty}a_n z^n$ satisfying \[ 1+\frac{zf"(z)}{f'(z)} \in \Omega,…