Related papers: Homogeneous formulas and symmetric polynomials

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

In this paper we consider a large class of fully nonlinear integro-differential equations. The class of our nonlocal operators we consider is not spatial homogeneous and we put mild assumptions on its kernel near zero. We prove the H\"older…

Assume $n\geq 2$. Consider the elementary symmetric polynomials $e_k(y_1,y_2,\ldots, y_n)$ and denote by $E_0,E_1,\ldots,E_{n-1}$ the elementary symmetric polynomials in reverse order \begin{align*}…

Let $\mathbb{A}$ and $\mathbb{S}$ denote the double arrow of Alexandroff and the Sorgenfrey line, respectively. We show that for any $n\geq 1$, the space of all unions of at most $n$ closed intervals of $\mathbb{A}$ is not homogeneous. We…

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

We show that any differential operator of the form $L(y)=\sum_{k=0}^{k=N} a_{k}(x) y^{(k)}$, where $a_k$ is a real polynomial of degree $\leq k$, has all real eigenvalues in the space of polynomials of degree at most n, for all n. The…

We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…

We investigate the box dimensions of inhomogeneous self-similar sets. Firstly, we extend some results of Olsen and Snigireva by computing the upper box dimensions assuming some mild separation conditions. Secondly, we investigate the more…

Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…

Symmetric Jack polynomials arise naturally in several contexts, including statistics, physics, combinatorics, and representation theory. They are pairwise orthogonal with repsect to two different inner products, the first defined by…

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…

Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

Given an arbitrary integer $d>0$, we construct a homogeneous ideal $I$ of the polynomial ring $S = K[x_1, \ldots, x_{3d}]$ in $3d$ variables over a filed $K$ for which $S/I$ is a Cohen--Macaulay ring of dimension $d$ with the property that,…

For all natural numbers $N$ and prime numbers $p$, we find a knot $K$ whose skein polynomial $P_K(a,z)$ evaluated at $z=N$ has trivial reduction modulo $p$. An interesting consequence of our construction is that all polynomials $P_K(a,N)$…

Let $S_n$ denote the symmetric group of order $n$. Say that two subsets $x, y\subseteq S_n$ are \emph{equivalent} if there exist permutations $g_1, g_2\in S_n$ such that $g_1xg_2=y$, where multiplication is understood elementwise. Recently,…

We study the extent of independence needed to approximate the product of bounded random variables in expectation, a natural question that has applications in pseudorandomness and min-wise independent hashing. For random variables whose…

We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…