Related papers: On Fekete Points for a Real Simplex
Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions and hypothesized on the relative number of partitions with and without a fixed point. We resolve their open question by working fixed points into a…
The main purpose of this paper is to introduce a new comprehensive subclass of analytic close-to-convex functions and derive Fekete-Szeg\"o inequalities for functions belonging to this new class by using a different way. Various known…
Motivated by problems where the response is needed at select localized regions in a large computational domain, we devise a novel finite element discretization that results in exponential convergence at pre-selected points. The two key…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
The notion of Fej\'er monotonicity has proven to be a fruitful concept in fixed point theory and optimization. In this paper, we present new conditions sufficient for convergence of Fej\'er monotone sequences and we also provide…
The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific…
The paper is concerned with classic kernel interpolation methods, in addition to approximation methods that are augmented by gradient measurements. To apply kernel interpolation using radial basis functions (RBFs) in a stable way, we…
We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\it Approximate…
Let $K$ be a number field or a function field in one variable over a finite field, and let $K^{sep}$ be a separable closure of $K$. Let $C/K$ be a smooth, complete, connected curve. We prove a strong theorem of Fekete-Szego type for adelic…
Fekete polynomials associated to quadratic Dirichlet characters have interesting arithmetic properties, and have been studied in many works. In this paper, we study a seemingly simpler yet rich variant: the Fekete polynomial $F_n(x) =…
We shall generalize the concept of $z=(1-t)x\oplus ty$ to $n$ times which contains to verifying some their properties and inequalities in CAT(0) spaces. In the sequel with introducing of $\alpha$-nonexpansive mappings, we obtain some fixed…
The matrix Fej\'er-Riesz theorem characterizes positive semidefinite matrix polynomials on the real line. In the previous work of the second-named author this was extended to the characterization on arbitrary closed semialgebraic sets $K$…
Fekete polynomials associate with each prime number $p$ a polynomial with coefficients $-1$ or $1$ except the constant term, which is 0. These coefficients reflect the distribution of quadratic residues modulo $p$. These polynomials were…
We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given $t$, what is the maximum number of points that can be placed in the plane to…
In this work, a family of symmetric interpolation points are generated on the four-dimensional simplex (i.e. the pentatope). These points are optimized in order to minimize the Lebesgue constant. The process of generating these points…
In this paper, superconvergence points are located for the approximation of the Riesz derivative of order $\alpha$ using classical Lobatto-type polynomials when $\alpha \in (0,1)$ and generalized Jacobi functions (GJF) for arbitrary $\alpha…
We introduce a concept that generalizes several different notions of a "centerpoint" in the literature. We develop an oracle-based algorithm for convex mixed-integer optimization based on centerpoints. Further, we show that algorithms based…
We consider again a classical theorem relating capacities and algebraic integers and the question of the simultaneous approximation of $ n-1$ different complex numbers by conjugate algebraic integers of degree $n$.