中文
相关论文

相关论文: A New Bound on Cofactors of Sparse Polynomials

200 篇论文

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

最优化与控制 · 数学 2024-07-25 Boulos El Hilany , Elias Tsigaridas

Let $p\in\mathbb{Z}[x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^\tau$. In this paper, we answer the open question whether the real roots of $p$ can be computed with a…

数值分析 · 计算机科学 2014-01-24 Michael Sagraloff

Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such…

计算复杂性 · 计算机科学 2015-03-20 Venkatesan Guruswami , Ali Kemal Sinop , Yuan Zhou

Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$ in $d$ freely noncommuting arguments, find a free polynomial $p_n$, of…

泛函分析 · 数学 2022-09-22 Palak Arora , Meric Augat , Michael Jury , Meredith Sargent

We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree…

计算复杂性 · 计算机科学 2023-01-31 Alexander A. Sherstov , Andrey A. Storozhenko , Pei Wu

In this paper we introduce a notion of dimension and codimension for every element of a distributive bounded lattice $L$. These notions prove to have a good behavior when $L$ is a co-Heyting algebra. In this case the codimension gives rise…

逻辑 · 数学 2008-12-12 Luck Darnière , Markus Junker

We propose a novel method for establishing the sparsity of the coefficients of the Laguerre generalized polynomial chaos expansion of solutions to parametric elliptic PDEs with log-gamma inputs on $\mathbb{R}_+^\infty$. The established…

数值分析 · 数学 2026-03-17 Dinh Dũng , Van Kien Nguyen , Viet Ha Hoang

Given a univariate polynomial f(x) over a ring R, we examine when we can write f(x) as g(h(x)) where g and h are polynomials of degree at least 2. We answer two questions of Gusic regarding when the existence of such g and h over an…

交换代数 · 数学 2013-01-23 Brian Wyman , Michael Zieve

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

经典分析与常微分方程 · 数学 2022-04-11 Rahul Sarkar , Theodore J. Yoder

Given a nonnegative polynomial f, we provide an explicit expression for its best $\ell_1$-norm approximation by a sum of squares of given degree.

最优化与控制 · 数学 2010-12-16 Jean Lasserre

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra of rank $\ell$ over an algebraically closed field $\Bbbk$ of characteristic zero, and let $(e,h,f)$ be an $\mathfrak{sl}_2$-triple of g. Denote by $\mathfrak{g}^{e}$ the…

表示论 · 数学 2016-08-11 Jean-Yves Charbonnel , Anne Moreau

Over a decade ago De Loera, Haws and K\"oppe conjectured that Ehrhart polynomials of matroid polytopes have only positive coefficients and that the coefficients of the corresponding $h^*$-polynomials form a unimodal sequence. The first of…

组合数学 · 数学 2022-08-05 Luis Ferroni , Katharina Jochemko , Benjamin Schröter

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

符号计算 · 计算机科学 2015-03-19 Michael Kerber , Michael Sagraloff

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

数论 · 数学 2017-04-03 Bjorn Poonen

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

最优化与控制 · 数学 2016-05-26 Etienne de Klerk , Jean Lasserre , Monique Laurent , Zhao Sun

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…

代数几何 · 数学 2021-01-05 Jose Capco , Claus Scheiderer

Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on…

机器学习 · 计算机科学 2020-12-15 Ilias Diakonikolas , Daniel M. Kane

Elliptic partial differential equations with diffusion coefficients of lognormal form, that is $a=exp(b)$, where $b$ is a Gaussian random field, are considered. We study the $\ell^p$ summability properties of the Hermite polynomial…

数值分析 · 数学 2015-09-24 Markus Bachmayr , Albert Cohen , Ronald DeVore , Giovanni Migliorati

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

数据结构与算法 · 计算机科学 2017-04-25 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

For each irreducible finite dimensional representation of the Lie algebra $\mathfrak{sl}_2(\mathbb{C})$ of $2\times 2$ traceless matrices, an explicit uniform upper bound is given for the multiplicities in the cocharacter sequence of the…

表示论 · 数学 2021-12-14 M. Domokos
‹ 上一页 1 8 9 10 下一页 ›