English
Related papers

Related papers: Non reality and non connectivity of complex polyno…

200 papers

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

Mathematical Physics · Physics 2024-08-08 Gemma De las Cuevas , Andreas Klingler , Tim Netzer

We consider the problem of solving a linear system of equations which involves complex variables and their conjugates. We characterize when it reduces to a complex linear system, that is, a system involving only complex variables (and not…

Rings and Algebras · Mathematics 2017-06-02 Cédric Josz

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…

Computational Complexity · Computer Science 2007-05-23 Lance Fortnow , John D. Rogers

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

Algebraic Geometry · Mathematics 2007-05-23 Alexey Glutsyuk

We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…

Geometric Topology · Mathematics 2009-09-25 John L. Bryant , Steven C. Ferry , Washington Mio , Shmuel Weinberger

We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…

Number Theory · Mathematics 2017-10-16 Aart Blokhuis , Andries Brouwer , Benne de Weger

In this paper, we generalize an elementary real-analysis result to a class of topological vector spaces. We also give an example of a topological vector space to which the result cannot be generalized.

Functional Analysis · Mathematics 2018-03-20 Leonard T. Huang

In this work, we give some criteria that allow us to decide when two sequences of matrix-valued orthogonal polynomials are related via a Darboux transformation and to build explicitly such transformation. In particular, they allow us to see…

Classical Analysis and ODEs · Mathematics 2025-12-09 Ignacio Bono Parisi , Inés Pacharoni , Ignacio Zurrián

We raise a question on the existence of continuous roots of families of monic polynomials (by the root of a family of polynomials we mean a function of the coefficients of polynomials of a given family that maps each tuple of coefficients…

Classical Analysis and ODEs · Mathematics 2017-10-03 Evgeny E. Bukzhalev

We show that in every codimension greater than one there exists a mod 2 homology class in some closed manifold (of sufficiently high dimension) which cannot be realized by an immersion of closed manifolds. The proof gives explicit…

Algebraic Topology · Mathematics 2014-02-26 Mark Grant , Andras Szucs

Given a real polynomial $p$ with only real zeroes, we find upper and lower bounds for the number of non-real zeroes of the differential polynomial $$ F_{\varkappa}[p](z):= p(z)p''(z)-\varkappa[p'(z)]^2,$$ where $\varkappa$ is a real number.…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov , Mohamed J. Atia

We consider the set of the power non-negative polynomials of several variables and its subset that consists of polynomials which can be represented as a sum of squares. It is shown in the classic work by D.Hilbert that it is a proper…

Classical Analysis and ODEs · Mathematics 2014-10-01 L. A. Sakhnovich

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

Algebraic Geometry · Mathematics 2008-04-02 Hani Shaker

All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…

Algebraic Geometry · Mathematics 2022-04-25 V. A. Vassiliev

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

Optimization and Control · Mathematics 2011-04-08 Tim Netzer , Andreas Thom

The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial…

Computational Complexity · Computer Science 2016-07-01 Shawn X. Cui , Michael H. Freedman , Zhenghan Wang

In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…

Dynamical Systems · Mathematics 2007-06-29 Carlos Cabrera , Tomoki Kawahira

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

Quantum Physics · Physics 2007-05-23 J. Maurice Rojas

It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…

Optimization and Control · Mathematics 2024-06-18 Dorothee Henke , Henri Lefebvre , Martin Schmidt , Johannes Thürauf