English
Related papers

Related papers: Polynomials with Lorentzian Signature, and Computi…

200 papers

The holonomy group of an (n+2)-dimensional simply-connected, indecomposable but non-irreducible Lorentzian manifold (M,h) is contained in the parabolic group $(\mathbb{R} \times SO(n))\ltimes \mathbb{R}^n$. The main ingredient of such a…

Differential Geometry · Mathematics 2012-08-14 Thomas Leistner

Hyperbolic homogeneous polynomials with real coefficients, i.e., hyperbolic real projective hypersurfaces, and their determinantal representations, play a key role in the emerging field of convex algebraic geometry. In this paper we…

Algebraic Geometry · Mathematics 2018-03-12 Eli Shamovich , Victor Vinnikov

In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen…

Algebraic Geometry · Mathematics 2025-10-20 Alexandru Dimca , Piotr Pokora , Gabriel Sticlaru

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas

In 2022, Huh-Matherne-M\'esz\'aros-St. Dizier showed that normalized Schur polynomials are Lorentzian, thereby yielding their continuous (resp. discrete) log-concavity on the positive orthant (resp. on their support, in type $A$ root…

Representation Theory · Mathematics 2025-10-22 Apoorva Khare , Jacob P. Matherne , Avery St. Dizier

Various classical solutions to lower dimensional IKKT-like Lorentzian matrix models are examined in their commutative limit. Poisson manifolds emerge in this limit, and their associated induced and effective metrics are computed. Signature…

High Energy Physics - Theory · Physics 2018-10-22 A. Stern , Chuang Xu

In this paper, we study a class of sequences of polynomials linked to the sequence of Bell polynomials. Some sequences of this class have applications on the theory of hyperbolic differential equations and other sequences generalize…

Combinatorics · Mathematics 2023-11-20 Miloud Mihoubi , Madjid Sahari

The existence of closed hypersurfaces of prescribed curvature in globally hyperbolic Lorentzian manifolds is proved provided there are barriers.

Differential Geometry · Mathematics 2007-05-23 Claus Gerhardt

We consider the problem of realizing hyperbolicity cones as spectrahedra, i.e. as linear slices of cones of positive semidefinite matrices. The generalized Lax conjecture states that this is always possible. We use generalized Clifford…

Algebraic Geometry · Mathematics 2012-07-16 Tim Netzer , Andreas Thom

A hyperbolic polynomial (HP) is a real univariate polynomial with all roots real. By Descartes' rule of signs a HP with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with multiplicity, where…

Classical Analysis and ODEs · Mathematics 2020-01-30 Vladimir Petrov Kostov

In this paper we explore a class of quadratic polynomials having Siegel disks with unbounded type rotation numbers. We prove that any boundary point of Siegel disks of these polynomials is a Lebesgue density point of their filled-in Julia…

Dynamical Systems · Mathematics 2023-07-21 Hongyu Qu , Jianyong Qiao , Guangyuan Zhang

The finite-degree Zariski (Z-) closure is a classical algebraic object, that has found a key place in several applications of the polynomial method in combinatorics. In this work, we characterize the finite-degree Z-closures of a subclass…

Combinatorics · Mathematics 2021-11-11 Srikanth Srinivasan , S. Venkitesh

The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a…

Quantum Algebra · Mathematics 2012-03-01 Martin Loebl , Iain Moffatt

Given a closed, convex cone $K\subseteq \mathbb{R}^n$, a multivariate polynomial $f\in\mathbb{C}[\mathbf{z}]$ is called $K$-stable if the imaginary parts of its roots are not contained in the relative interior of $K$. If $K$ is the…

Combinatorics · Mathematics 2022-11-29 Giulia Codenotti , Stephan Gardoll , Thorsten Theobald

Every symmetric polynomial p(x)=p(x_1,...,x_g) (with real coefficients) in g noncommuting variables x_1, ..., x_g can be written as a sum and difference of squares of noncommutative polynomials. Let s(p), the negative signature of p, denote…

Functional Analysis · Mathematics 2009-03-12 Harry Dym , Jeremy M. Greene , J. William Helton , Scott A. McCullough

We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…

Data Structures and Algorithms · Computer Science 2016-10-04 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava

In this paper, we propose a procedure for constructing an infinite number of families of solutions of given linear differential equations with partial derivatives with constant coefficients. We use monogenic functions that are defined on…

Complex Variables · Mathematics 2018-11-28 Vitalii Shpakivskyi

This paper studies the stability of discrete-time polynomial dynamical systems on hypergraphs by utilizing the Perron-Frobenius theorem for nonnegative tensors with respect to the tensors Z-eigenvalues and Z-eigenvectors. Firstly, for a…

Systems and Control · Electrical Eng. & Systems 2024-06-06 Shaoxuan Cui , Guofeng Zhang , Hildeberto Jardón-Kojakhmetov , Ming Cao

We consider real monic {\em hyperbolic} polynomials in one real variable, i.e. polynomials having only real roots. Call {\em hyperbolicity domain} $\Pi$ of the family of polynomials $P(x,a)=x^n+a_1x^{n-1}+... +a_n$, $a_i,x\in {\bf R}$, the…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Petrov Kostov

We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…

Computational Complexity · Computer Science 2019-08-23 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay
‹ Prev 1 4 5 6 7 8 10 Next ›