English
Related papers

Related papers: Almost Bijective Parametrization of Copositive Uni…

200 papers

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Commutative Algebra · Mathematics 2012-10-25 William Messing , Victor Reiner

This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…

Optimization and Control · Mathematics 2023-03-21 Luis Felipe Vargas , Monique Laurent

We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…

Classical Analysis and ODEs · Mathematics 2008-12-22 Michael R. Hoare , Mizan Rahman

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

Optimization and Control · Mathematics 2016-11-17 James Saunderson , Pablo A. Parrilo

In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.

Number Theory · Mathematics 2023-10-05 Sanjeev Kumar , Jitender Singh

Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…

Optimization and Control · Mathematics 2026-01-05 Haibin Chen , Hong Yan , Guanglu Zhou

It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…

Algebraic Geometry · Mathematics 2014-01-08 Sonia Perez-Diaz , Sonia L. Rueda , Juana Sendra , J. Rafael Sendra

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

Number Theory · Mathematics 2022-03-16 Dragan Stankov

This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.

Representation Theory · Mathematics 2023-10-13 Kate Howell , Rongwei Yang

Projectivizations of pointed polyhedral cones $C$ are positive geometries in the sense of Arkani-Hamed, Bai, and Lam. Their canonical forms look like $$ \Omega_C(x)=\frac{A(x)}{B(x)} dx, $$ with $A,B$ polynomials. The denominator $B(x)$ is…

Combinatorics · Mathematics 2025-04-11 Christian Gaetz

We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner)…

Optimization and Control · Mathematics 2012-01-20 Jean Bernard Lasserre

We define a new family of valuations on polyhedral cones valued in the space of bounded polyhedra.

Metric Geometry · Mathematics 2019-01-24 Hailun Zheng , Michał Zydor

A new modulus of smoothness and its equivalent $K$-function are defined on the conic domains in $\mathbb{R}^d$, and used to characterize the weighted best approximation by polynomials. Both direct and weak inverse theorems of the…

Classical Analysis and ODEs · Mathematics 2025-07-01 Yan Ge , Yuan Xu

This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…

Combinatorics · Mathematics 2025-01-14 Guoce Xin , Xinyu Xu , Zihao Zhang

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

Algebraic Geometry · Mathematics 2012-11-16 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

Let $D$ be an integrally closed domain with quotient field $K$ and $A$ a torsion-free $D$-algebra that is finitely generated as a $D$-module and such that $A\cap K=D$. We give a complete classification of those $D$ and $A$ for which the…

Rings and Algebras · Mathematics 2026-03-10 Giulio Peruginelli , Nicholas J. Werner

In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…

Analysis of PDEs · Mathematics 2019-05-27 Filomena Pacella , Giulio Tralli

We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…

Symbolic Computation · Computer Science 2020-09-01 Pascal Giorgi , Bruno Grenet , Armelle Perret du Cray

We observe algebraic derivations on an affine domain B defined over an algebraically closed field of characteristic 0, which are called locally finite derivations in commutative and non-commutative contexts in other references. We observe…

Algebraic Geometry · Mathematics 2013-03-07 Kayo Masuda , Masayoshi Miyanishi

We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2…

Data Structures and Algorithms · Computer Science 2007-05-23 Michael Nüsken , Martin Ziegler
‹ Prev 1 3 4 5 6 7 10 Next ›