English
Related papers

Related papers: Quasi-Convex Free Polynomials

200 papers

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Optimization and Control · Mathematics 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolutions. These convolutions preserve real-rootedness and…

Rings and Algebras · Mathematics 2018-12-04 Amnon Rosenmann , Franz Lehner , Aljosa Peperko

In this article, we carry out the investigation for regular sequences of symmetric polynomials in the polynomial ring in three and four variable. Any two power sum element in $\mathbb{C}[x_1,x_2,...,x_n]$ for $n \geq 3$ always form a…

Commutative Algebra · Mathematics 2013-03-26 Neeraj Kumar , Ivan Martino

Let $\mathbf{X}_p=(\mathbf{s}_1,...,\mathbf{s}_n)=(X_{ij})_{p \times n}$ where $X_{ij}$'s are independent and identically distributed (i.i.d.) random variables with $EX_{11}=0,EX_{11}^2=1$ and $EX_{11}^4<\infty$. It is showed that the…

Statistics Theory · Mathematics 2012-11-26 B. B. Chen , G. M. Pan

We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…

q-alg · Mathematics 2008-02-03 Friedrich Knop

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

Number Theory · Mathematics 2015-12-18 Joachim von zur Gathen , Guillermo Matera

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…

Functional Analysis · Mathematics 2014-07-01 J. E. Pascoe

We prove that the subset of quasisymmetric polynomials conjectured by Bergeron and Reutenauer to be a basis for the coinvariant space of quasisymmetric polynomials is indeed a basis. This provides the first constructive proof of the…

Combinatorics · Mathematics 2010-03-11 Aaron Lauve , Sarah Mason

We consider the class of non-negative rank-one convex isotropic integrands on $\mathbb{R}^{n\times n}$ which are also positively $p$-homogeneous. If $p \leq n = 2$ we prove, conditional on the quasiconvexity of the Burkholder integrand,…

Analysis of PDEs · Mathematics 2022-06-08 André Guerra , Jan Kristensen

We study properties of the realizations of groups as the combinatorial automorphism group of a convex polytope. We show that for any non-abelian group $G$ with a central involution there is a centrally symmetric polytope with $G$ as its…

Metric Geometry · Mathematics 2020-04-27 Alexandru Chirvasitu , Frieder Ladisch , Pablo Soberón

Let $\{P_n \}_{n\ge0}$ be a sequence of monic orthogonal polynomials with respect to a quasi--definite linear functional $u$ and $\{Q_n \}_{n\ge0}$ a sequence of polynomials defined by $$Q_n(x)=P_n(x)+s_n P_{n-1}(x)+t_n P_{n-2}(x),\quad…

Classical Analysis and ODEs · Mathematics 2009-09-04 M. Alfaro , F. Marcellan , A. Pena , M. L. Rezola

This article is devoted to the study of several algebras which are related to symmetric functions, and which admit linear bases labelled by various combinatorial objects: permutations (free quasi-symmetric functions), standard Young…

Combinatorics · Mathematics 2013-02-12 G. Duchamp , F. Hivert , J. -Y. Thibon

The $\sigma$-polynomial is given by $\sigma(G,x) = \sum_{i=\chi(G)}^{n} a_{i}(G)\, x^{i}$, where $a_{i}(G)$ is the number of partitions of the vertices of $G$ into $i$ nonempty independent sets. These polynomials are closely related to…

Combinatorics · Mathematics 2016-11-30 Jason Brown , Aysel Erey

Let S=K[x_1,...,x_n] be a polynomial ring. Denote by $p_a$ the power sum symmetric polynomial x_1^a+...+x_n^a. We consider the following two questions: Describe the subsets $A \subset \mathbb{N}$ such that the set of polynomials $p_a$ with…

Commutative Algebra · Mathematics 2013-09-05 Neeraj Kumar

Let $p$ and $q$ be polynomials with degree $2$ over an arbitrary field $\mathbb{F}$. In the first part of this article, we characterize the matrices that can be decomposed as $A+B$ for some pair $(A,B)$ of square matrices such that $p(A)=0$…

Rings and Algebras · Mathematics 2017-07-06 Clément de Seguins Pazzis

Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…

Statistical Mechanics · Physics 2009-11-10 Giovanni M. Cicuta

This article resides in the realm of the noncommutative (free) analog of real algebraic geometry - the study of polynomial inequalities and equations over the real numbers - with a focus on matrix convex sets $C$ and their projections $\hat…

Functional Analysis · Mathematics 2018-04-27 J. William Helton , Igor Klep , Scott McCullough

Let $s_{ij}$ represent a tranposition in $S_n$. A polynomial $P$ in $\mathbb{Q}[X_n]$ is said to be $m$-quasiinvariant with respect to $S_n$ if $(x_i-x_j)^{2m+1}$ divides $(1-s_{ij})P$ for all $1 \leq i, j \leq n$. We call the ring…

Combinatorics · Mathematics 2007-05-23 Jason Bandlow , Gregg Musiker

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

Computational Complexity · Computer Science 2018-10-30 Manuel Bodirsky , Marcello Mamino
‹ Prev 1 8 9 10 Next ›