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

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Let ${\mathbb Z}_p$ denote the ring of all $p$-adic integers and call $${\mathcal U}=\{(x_1,\ldots,x_n):\,a_1x_1+\ldots+a_nx_n+b=0\}$$ a hyperplane over ${\mathbb Z}_p^n$, where at least one of $a_1,\ldots,a_n$ is not divisible by $p$. We…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

The Hessian Topology is a subject with interesting relations with some classical problems of analysis and geometry. In this article we prove a conjecture on this subject stated by V.I. Arnold concerning the number of connected components of…

The exact solutions of the Schrodinger equation with the hyperbolic Scarf potential reported in the literature so far rely upon Jacobi polynomials with imaginary arguments and parameters. We here show that upon a suitable factorization…

This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…

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…

Let $A_{p,r}^m(n)$ be the best constant that fulfills the following inequality: for every $m$-homogeneous polynomial $P(z) = \sum_{|\alpha|=m} a_{\alpha} z^{\alpha}$ in $n$ complex variables, $$\big( \sum_{|\alpha|=m} |a_{\alpha}|^{r}…

The paper introduces a notion of the Laplace operator of a polynomial p in noncommutative variables x=(x_1,...,x_g). The Laplacian Lap[p,h] of p is a polynomial in x and in a noncommuting variable h. When all variables commute we have…

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…

Hyperbolic polynomials are real multivariate polynomials with only real roots along a fixed pencil of lines. Testing whether a given polynomial is hyperbolic is a difficult task in general. We examine different ways of translating…

It is noted that using complex Hessian equations and the concavity inequalities for elementary symmetric polynomials implies a generalized form of Hodge index inequality. Inspired by this result, using G{\aa}rding's theory for hyperbolic…

For a given real polynomial $p$ we study the possible number of real roots of a differential polynomial $H_{\varkappa}[p](x) = \varkappa\left(p'(x)\right)^2-p(x)p''(x), \varkappa \in \mathbb{R}.$ In the special case when all real zeros of…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

Let $P$ be an $m$-homogeneous polynomial in $n$-complex variables $x_1, \dotsc, x_n$. Clearly, $P$ has a unique representation in the form \begin{equation*} P(x)= \sum_{1 \leq j_1 \leq \dotsc \leq j_m \leq n} c_{(j_1, \dotsc, j_m)} \,…

We consider polynomials of the form $\operatorname{h}_m(y_1^{[\varkappa_1]},\ldots,y_n^{[\varkappa_n]})$, where $\operatorname{h}_m$ is the complete homogeneous polynomial of degree $m$ and $y_j^{[\varkappa_j]}$ denotes $y_j$ repeated…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…