Related papers: Very badly approximable matrix functions
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
This note establishes smooth approximation from above for J-plurisubharmonic functions on an almost complex manifold (X,J). The following theorem is proved. Suppose X is J-pseudoconvex, i.e., X admits a smooth strictly J-plurisubharmonic…
Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…
In this paper we consider class of continuous functions, called quasiaharmonic functions, admitting best approximations by harmonic polynomials. In this class we prove a uniqueness theorem by analogy with the analytic functions.
Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…
A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…
The main result of the paper is the following generalization of Forelli's theorem: Suppose F is a holomorphic vector field with singular point at p, such that F is linearizable at p and the matrix is diagonalizable with the eigenvalues…
We review and extend the description of ultradifferentiable functions by their almost analytic extensions, i.e., extensions to the complex domain with specific vanishing rate of the $\bar \partial$-derivative near the real domain. We work…
Let $p\in(0,1]$ and $W$ be an $A_p$-matrix weight, which in scalar case is exactly a Muckenhoupt $A_1$ weight. In this article, we introduce matrix-weighted Hardy spaces $H^p_W$ via the matrix-weighted grand non-tangential maximal function…
Let $k$ be a $d$-local field of characteristic 0, and let $K$ be the function field of a nice curve over $k$. We give a defect to weak approximation for reductive groups over $K$ using arithmetic dualities.
It is a natural question to ask which plurisubharmonic functions admit a 'nice' approximation in the sense of a decreasing equisingular approximation with analytic singularities. For arbitrary toric plurisubharmonic functions, we give a…
We present here a new method for approximating functions defined on superreflexive Banach spaces by differentiable functions with $\alpha$-H\"older derivatives (for some $0<\alpha\leq 1$). The smooth approximation is given by means of an…
Let $P$ be a finite simplicial comple with underlying space (union of simplices in $P$) $|P|$. Let $Q$ be a subcomplex of $P$. Let $a \geq 0$. Then there exists $K < \infty$, \emph{depending only on $a$ and $Q$,} with the following…
In this paper, we introduce and provide a short overview of nonnegative matrix factorization (NMF). Several aspects of NMF are discussed, namely, the application in hyperspectral imaging, geometry and uniqueness of NMF solutions,…
We extend a recent result of Avelin, Hed, and Persson about approximation of functions $u$ that are plurisubharmonic on a domain $\Omega$ and continuous on $\bar\Omega$, with functions that are plurisubharmonic on (shrinking) neighborhoods…
Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient…
Vector Fitting (VF) is a popular method of constructing rational approximants that provides a least squares fit to frequency response measurements. In an earlier work, we provided an analysis of VF for scalar-valued rational functions and…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…
Maximum nonlinear functions on finite fields are widely used in cryptography because the coordinate functions have large distance to linear functions. More precisely, the Hamming distance to the characteristic functions of hyperplanes is…
The article is devoted to approximate, global and along curves differentiability of functions over non-archimedean infinite fields with non-trivial valuations. Fields with zero and non-zero characteristics are considered. Spaces of…