English
Related papers

Related papers: Non-commutative polynomials with convex level slic…

200 papers

We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric. We determine dimensions of these polytopes and classify their…

Combinatorics · Mathematics 2017-12-11 Richard R. Brualdi , Lei Cao

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Combinatorics · Mathematics 2022-03-23 Konrad Aguilar , Ángel Chávez , Stephan Ramon Garcia , Jurij Volčič

This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of $\Gamma$-convexity. Here $\Gamma$ is a tuple of free symmetric polynomials determining the geometry of a…

Operator Algebras · Mathematics 2024-12-19 Igor Klep , Scott McCullough , Tea Štrekelj

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

Classical Analysis and ODEs · Mathematics 2026-05-28 K. Castillo

For each positive integer n, we define a polynomial in the variables z_1,...,z_n with coefficients in the ring $\mathbb{Q}[q,t,r]$ of polynomial functions of three parameters q, t, r. These polynomials naturally arise in the context of…

Combinatorics · Mathematics 2010-08-13 Kyungyong Lee

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

Representation Theory · Mathematics 2024-08-09 Vitaliy Bondarenko , Anatoliy Petravchuk , Maryna Styopochkina

In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…

General Mathematics · Mathematics 2017-12-29 Dharm Prakash Singh , Amit Ujlayan

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

We prove that there does not exist a non-square quadratic polynomial with integer coefficients and an axis of symmetry which takes square values for N consecutive integers for N=7 or N >= 9. At the opposite, if N <= 6 or N=8 there are…

Number Theory · Mathematics 2014-11-12 Enrique Gonzalez-Jimenez , Xavier Xarles

A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization and tensor complementarity…

Combinatorics · Mathematics 2016-03-08 Haibin Chen , Zhenghai Huang , Liqun Qi

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

Combinatorics · Mathematics 2021-03-09 Anshul Adve , Colleen Robichaux , Alexander Yong

In this paper we show that a polynomial equation admits infinitely many prime-tuple solutions assuming only that the equation satisfies suitable local conditions and the polynomial is sufficiently non-degenerate algebraically. Our notion of…

Number Theory · Mathematics 2019-11-13 Stanley Yao Xiao , Shuntaro Yamagishi

We prove the existence of complex polynomials $p(z)$ of degree $n$ and $q(z)$ of degree $m<n$ such that the harmonic polynomial $ p(z) + \overline{q(z)}$ has at least $\lceil n \sqrt{m} \rceil$ many zeros. This provides an array of new…

Complex Variables · Mathematics 2023-09-01 Erik Lundberg

We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…

Combinatorics · Mathematics 2013-01-22 Brendan D. McKay , Jeanette C. McLeod

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

Representation Theory · Mathematics 2021-05-06 Jiuzhao Hua

In a paper published by this author in www.academia.edu(see reference[3]), it was established that there exist no three positive integers which are consecutive terms of an arithmetic progression; and whose sum of squares is a perfect or…

General Mathematics · Mathematics 2013-11-27 Konstantine Zelator

Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear matrix inequalities (LMI) in the coefficients. As an…

Optimization and Control · Mathematics 2010-07-01 Mustapha Ait Rami , Didier Henrion

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia
‹ Prev 1 8 9 10 Next ›