English
Related papers

Related papers: A lower bound for the minimum deviation of the Che…

200 papers

When solving differential equations by a spectral method, it is often convenient to shift from Chebyshev polynomials $T_{n}(x)$ with coefficients $a_{n}$ to modified basis functions that incorporate the boundary conditions. For homogeneous…

Numerical Analysis · Mathematics 2022-05-31 Xiaolong Zhang , John P. Boyd

For an arrangement of $n$ pseudolines in the real projective plane let us denote by $t_i$ the number of vertices incident to $i$ lines. We obtain a linear on $t_i$ inequality similar to the Hirzebruch one, but with an elementary proof. We…

Combinatorics · Mathematics 2012-03-07 Igor Shnurnikov

A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…

Classical Analysis and ODEs · Mathematics 2017-03-14 Ron Peled

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

Computational Complexity · Computer Science 2022-11-16 Prashanth Amireddy , Ankit Garg , Neeraj Kayal , Chandan Saha , Bhargav Thankey

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

Combinatorics · Mathematics 2019-05-28 Mark Wildon

Results on asymptotic characteristics of classes of functions with mixed smoothness are obtained in the paper. Our main interest is in estimating the Kolmogorov widths of classes with small mixed smoothness. We prove the corresponding…

Numerical Analysis · Mathematics 2020-12-21 V. Temlyakov , T. Ullrich

In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…

Classical Analysis and ODEs · Mathematics 2017-09-12 Vanessa Botta

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Quantum Physics · Physics 2008-05-12 Andris Ambainis

We give a Schinzel-Zassenhaus-type lower bound for the maximum modulus of roots of a monic integer polynomial with all roots symmetric with respect to the unit circle. Our results extend a recent work of Dimitrov, who proved the general…

Number Theory · Mathematics 2021-01-19 Igor E. Pritsker

We announce some new results on the convergence of Chebyshev--Pad\'e approximations to real-valued algebraic function given on the segment $[-1,1]$. The rate of convergence on the segment and in the corresponding maximal domain of…

Complex Variables · Mathematics 2010-09-27 Andrei A. Gonchar , Evgenii A. Rakhmanov , Sergey P. Suetin

We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and…

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

Optimization and Control · Mathematics 2013-12-16 Mehdi Ghasemi , Jean Bernard Lasserre , Murray Marshall

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

Combinatorics · Mathematics 2017-02-07 Filip Cools , Alexander Lemmens

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini

A variant of the well-known Chebyshev inequality for scalar random variables can be formulated in the case where the mean and variance are estimated from samples. In this paper we present a generalization of this result to multiple…

Methodology · Statistics 2017-09-29 Bartolomeo Stellato , Bart Van Parys , Paul J. Goulart

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

Classical Analysis and ODEs · Mathematics 2007-05-23 Igor Rivin

We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…

Dynamical Systems · Mathematics 2023-08-15 Hans Oeri , David Goluskin

There is a vast theory of Chebyshev and residual polynomials and their asymptotic behavior. The former ones maximize the leading coefficient and the latter ones maximize the point evaluation with respect to an $L^\infty$ norm. We study…

Classical Analysis and ODEs · Mathematics 2021-01-07 Benjamin Eichinger , Milivoje Lukić , Giorgio Young

The paper is devoted to some extremal problems for convex polygons on the Euclidean plane, related to the concept of self Chebyshev radius for the polygon boundary. We consider a general problem of minimization of the perimeter among all…

Metric Geometry · Mathematics 2024-02-28 Evgenii V. Nikitenko , Yurii G. Nikonorov

In this paper, we show exponential lower bounds for the class of homogeneous depth-$5$ circuits over all small finite fields. More formally, we show that there is an explicit family $\{P_d : d \in \mathbb{N}\}$ of polynomials in…

Computational Complexity · Computer Science 2015-07-02 Mrinal Kumar , Ramprasad Saptharishi
‹ Prev 1 3 4 5 6 7 10 Next ›