English
Related papers

Related papers: A moment ratio bound for polynomials and some extr…

200 papers

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

Computational Complexity · Computer Science 2022-12-22 Vladimir Podolskii , Nikolay V. Proskurin

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

Classical Analysis and ODEs · Mathematics 2020-05-20 Gökalp Alpan , Maxim Zinchenko

We give a hypergeometric proof involving a family of 2-variable Krawtchouk polynomials that were obtained earlier by Hoare and Rahman [SIGMA 4 (2008), 089, 18 pages] as a limit of the 9-j symbols of quantum angular momentum theory, and…

Classical Analysis and ODEs · Mathematics 2010-12-08 F. Alberto Grünbaum , Mizan Rahman

We shall establish two-side explicit inequalities, which are asymptotically sharp up to a constant factor, on the maximum value of $|H_k(x)| e^{-x^2/2},$ on the real axis, where $H_k$ are the Hermite polynomials.

Classical Analysis and ODEs · Mathematics 2007-05-23 Ilia Krasikov

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Data Structures and Algorithms · Computer Science 2016-11-18 Josh Alman , Ryan Williams

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

Computational Geometry · Computer Science 2014-04-25 Quentin Mérigot

Consider the linear space of functions on the binary hypercube and the linear operator $S_\delta$ acting by averaging a function over a Hamming sphere of radius $\delta n$ around every point. It is shown that this operator has a…

Probability · Mathematics 2018-08-31 Yury Polyanskiy

Consider two sequences of $n$ independent and identically distributed fair coin tosses, $X=(X_1,\ldots,X_n)$ and $Y=(Y_1,\ldots,Y_n)$, which are $\rho$-correlated for each $j$, i.e. $\mathbb{P}[X_j=Y_j] = {1+\rho\over 2}$. We study the…

Information Theory · Computer Science 2020-08-19 Or Ordentlich , Yury Polyanskiy , Ofer Shayevitz

In complex dynamics, the boundaries of higher dimensional hyperbolic components in holomorphic families of polynomials or rational maps are mysterious objects, whose topological and analytic properties are fundamental problems. In this…

Dynamical Systems · Mathematics 2022-06-16 Jie Cao , Xiaoguang Wang , Yongcheng Yin

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Combinatorics · Mathematics 2020-02-26 Simone Costa , Marco Dalai

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…

Combinatorics · Mathematics 2018-12-17 Hao Huang , Oleksiy Klurman , Cosmin Pohoata

Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most $L$. For odd $L\ge 3$ an asymptotic upper bound on the rate…

Information Theory · Computer Science 2015-12-29 Yury Polyanskiy

We revisit the convergence analysis of two approximation hierarchies for polynomial optimization on the unit sphere. The first one is based on the moment-sos approach and gives semidefinite bounds for which Fang and Fawzi (2021) showed an…

Optimization and Control · Mathematics 2026-02-23 Alexander Taveira Blomenhofer , Monique Laurent

We derive bounds for the ball $L_p$-discrepancies in the Hamming space for $0<p<\infty$ and $p=\infty$. Sharp estimates of discrepancies have been obtained for many spaces such as the Euclidean spheres and more general compact Riemannian…

Metric Geometry · Mathematics 2020-08-31 Alexander Barg , Maxim Skriganov

For the Hahn and Krawtchouk polynomials orthogonal on the set $\{0, \ldots,N\}$ new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These…

Classical Analysis and ODEs · Mathematics 2009-09-25 Holger Dette

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Number Theory · Mathematics 2023-11-23 Jacques Benatar , Alon Nishry , Brad Rodgers

We study approximation and localized polynomial frames on a bounded double hyperbolic or conic surface and the domain bounded by such a surface and hyperplanes. The main work follows the framework developed recently in \cite{X21} for…

Classical Analysis and ODEs · Mathematics 2021-05-25 Yuan Xu

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$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

In this paper, we establish hardness and approximation results for various $L_p$-ball constrained homogeneous polynomial optimization problems, where $p \in [2,\infty]$. Specifically, we prove that for any given $d \ge 3$ and $p \in…

Optimization and Control · Mathematics 2012-11-01 Ke Hou , Anthony Man-Cho So

The Renyi, Shannon and Fisher spreading lengths of the classical or hypergeometric orthogonal polynomials, which are quantifiers of their distribution all over the orthogonality interval, are defined and investigated. These…

Mathematical Physics · Physics 2009-11-11 P. Sánchez-Moreno , J. S. Dehesa , D. Manzano , R. Yáñez
‹ Prev 1 2 3 10 Next ›