Related papers: The Carath\'eodory-Fej\'er interpolation problem f…
Main goal of this paper is to generalize Hadamard's real part theorem and invariant forms of Borel-Carath\'eodory's theorem from complex analysis to solutions of the Riesz system in the three-dimensional Euclidean space in the framework of…
We establish an existence theory for an elliptic boundary value problem in image analysis known as edge-enhancing diffusion (EED) inpainting. The EED inpainting problem aims at restoring missing data in an image as steady state of a…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
In this article we explain the essence of the interrelation described in [PNAS 118, 15 (2021)] on how to write explicit interpolation formula for solutions of the Klein-Gordon equation by using the recent Fourier pair interpolation formula…
Noether's problem is classical and very important problem in algebra. It is an intrinsically interesting problem in invariant theory, but with far reaching applications in the sutdy of moduli spaces, PI-algebras, and the Inverse problem of…
Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…
In this paper, we show how to reduce the Penrose conjecture to the known Riemannian Penrose inequality case whenever certain geometrically motivated systems of equations can be solved. Whether or not these special systems of equations have…
We prove sharp version of Riesz-Fej\'er inequality for functions in harmonic Hardy space $h^p(\mathbb{D})$ on the unit disk $\mathbb{D}$, for $p>1,$ thus extending the result from \cite{KPK} and resolving the posed conjecture.
The polynomial Pell equation is \[P^2 - D Q^2 = 1\] where $D$ is a given integer polynomial and the solutions $P, Q$ must be integer polynomials. A classical paper of Nathanson \cite{Nat} solved it when $D(x) = x^2 + d$. We show that the…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
We prove a combination theorem for PD(n)-pairs.
We study the copolynomials of $n$ variables, i.e. $K$-linear mappings from the ring of polynomials $K[x_1,...,x_n]$ into the commutative ring $K$. We prove an existence and uniqueness theorem for a linear differential equation of infinite…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
In this note, we simplify the statements of theorems attributed to Cauchy and Ostrovsky and give proofs of each theorem via combinatorial and nonnegative matrix theory. We also show that each simple sufficient condition in each statement is…
The singular Bj\" orling problem and its solution for timelike minimal surfaces is a well-known result in minimal surface theory. In this article, we give a different proof of this theorem using split-harmonic maps. This is motivated by a…
We give a natural geometric condition that ensures that sequences of Chung-Yao interpolation polynomials (of fixed degree) of sufficiently differentiable functions converge to a Taylor polynomial.
We extend holomorphically polyharmonic functions on a real ball to a complex set being the union of rotated balls. We solve a Dirichlet type problem for complex polyharmonic functions with the boundary condition given on the union of…
Interpolation-based techniques have become popularized in recent years because of their inherently modular and local reasoning, which can scale up existing formal verification techniques like theorem proving, model-checking, abstraction…
We use the probabilistic method to obtain versions of the colorful Carath\'eodory theorem and Tverberg's theorem with tolerance. In particular, we give bounds for the smallest integer $N=N(t,d,r)$ such that for any $N$ points in $R^d$,…
We give an overview of recent progress around a problem introduced by Elekes and R\'onyai. The prototype problem is to show that a polynomial $f\in \mathbb{R}[x,y]$ has a large image on a Cartesian product $A\times B\subset \mathbb{R}^2$,…