中文
相关论文

相关论文: Combinatorial and algorithmic aspects of hyperboli…

200 篇论文

This paper solves the open problem on the sharp bound for the number of isolated solutions in $\mathbf{R}_*^n$ to the real system of $n$ polynomial equations in $n$ variables, i.e., the real $n$ by $n$ fewnomial system. For an unmixed…

代数几何 · 数学 2010-10-06 Sheng-Ming Ma

We introduce and motivate a notion of pseudo-arithmeticity, which possibly applies to all lattices in $\mathrm{PO}(n,1)$ with $n>3$. We further show that under an additional assumption (satisfied in all known cases), the covolumes of these…

几何拓扑 · 数学 2018-10-31 Vincent Emery , Olivier Mila

Polar weighted homogeneous polynomials are the class of special polynomials of real variables $x_i,y_i, i=1,..., n$ with $z_i=x_i+\sqrt{-1} y_i$, which enjoys a "polar action". In many aspects, their behavior looks like that of complex…

代数几何 · 数学 2008-01-25 Mutsuo Oka

We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…

符号计算 · 计算机科学 2017-12-18 Ruben Becker , Michael Sagraloff

We study the Ramsey properties of equations $a_1P(x_1) + \cdots + a_sP(x_s) = b$, where $a_1,\ldots,a_s,b$ are integers, and $P$ is an integer polynomial of degree $d$. Provided there are at least $(1+o(1))d^2$ variables, we show that…

数论 · 数学 2022-10-11 Jonathan Chapman , Sam Chow

Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…

代数几何 · 数学 2007-05-23 B. Bank , M. Giusti , J. Heintz , G. M. Mbakop

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

交换代数 · 数学 2007-05-23 Matthias Aschenbrenner

We investigate the behavior of the solutions of a class of certain strictly hyperbolic equations defined on $[0,T]\times \R^n$ in relation to a class of metrics on the phase space. In particular, we study the global regularity and decay…

偏微分方程分析 · 数学 2021-03-04 Rahul Raju Pattar , N. Uday Kiran

This paper presents a simple, self-contained account of Garding's theory of hyperbolic polynomials, including a recent convexity result of Bauschke-Guler-Lewis-Sendov and an inequality of Gurvits. This account also contains new results,…

偏微分方程分析 · 数学 2010-03-22 F. Reese Harvey , H. Blaine Lawson

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

经典分析与常微分方程 · 数学 2014-05-16 Vladimir Bolotnikov

Addressing a problem posed by W. Li and A. Wei (2009), we investigate the average number of (complex) zeros of a random harmonic polynomial $p(z) + \overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients are independent…

复变函数 · 数学 2023-08-22 Erik Lundberg , Andrew Thomack

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

组合数学 · 数学 2007-05-23 Victor Batyrev

The polynomial hierarchy is a grading of problems by difficulty, including P, NP and coNP as the best known classes. The promise polynomial hierarchy is similar, but extended to include promise problems. It turns out that the promise…

计算复杂性 · 计算机科学 2013-07-31 Adam Chalcraft , Samuel Kutin , David Petrie Moulton

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

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

最优化与控制 · 数学 2022-04-15 Daniel Bienstock , Alberto del Pia , Robert Hildebrand

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

经典分析与常微分方程 · 数学 2015-01-20 Arno B. J. Kuijlaars

An abstract, Hales-Jewett type extension of the polynomial van der Waerden Theorem [J. Amer. Math. Soc. 9 (1996),725-753] is established: Theorem. Let r,d,q \in \N. There exists N \in \N such that for any r-coloring of the set of subsets of…

组合数学 · 数学 2016-09-07 Vitaly Bergelson , Alexander Leibman

An $n$-ary integral quadratic form is a formal expression $Q(x_1,..,x_n)=\sum_{1\leq i,j\leq n}a_{ij}x_ix_j$ in $n$-variables $x_1,...,x_n$, where $a_{ij}=a_{ji} \in \mathbb{Z}$. We present a randomized polynomial time algorithm that given…

数据结构与算法 · 计算机科学 2014-09-23 Chandan Dubey , Thomas Holenstein

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

数论 · 数学 2018-09-05 Fusun Akman

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

组合数学 · 数学 2013-09-23 Victor Batyrev , Johannes Hofscheier