Related papers: Monic integer Chebyshev problem
Mahler's problem asks for the largest possible value of the Mahler measure, normalized by the $L_2$ norm, of a polynomial with $\pm1$ coefficients and large degree. We establish a new record value in this problem exceeding $0.95$ by…
We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to minimize (resp. maximize) the expectation of the minimum value…
We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…
Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper we study this problem in a dynamic environment with…
Let $f(x)$ be a non-zero polynomial with complex coefficients, and $M_p = \int_{0}^1 f(x)^p dx$ for $p$ a positive integer. In a recent paper, M\"uger and Tuset showed that $\limsup_{p \to \infty} |M_p|^{1/p} > 0$, and conjectured that this…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.
We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…
We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…
The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there…
A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…
Minimax and maximin problems are investigated for a special class of functions on the interval $[0,1]$. These functions are sums of translates of positive multiples of one kernel function and a very general external field function. Due to…
We study generating functions for the number of permutations in $S_n$ subject to set of restrictions. One of the restrictions belongs to $S_3$, while the others to $S_k$. It turns out that in a large variety of cases the answer can be…
We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…
The Cheeger constant of an open set of the Euclidean space is defined by minimizing the ratio "perimeter over volume", among all its smooth compactly contained subsets. We consider a natural variant of this problem, where the volume of…
This paper is focused on performing a new method for solving linear and nonlinear higher-order boundary value problems (HBVPs). This direct numerical method based on spectral method. The trial function of this method is the Monic Chebyshev…