English
Related papers

Related papers: Homogeneous formulas and symmetric polynomials

200 papers

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

Combinatorics · Mathematics 2022-08-16 Yulin Chang , Huifen Ge , Jie Han , Guanghui Wang

We determine the explicit formulas for the sum of products of homogeneous multiple harmonic sums $\sum_{k=1}^n \prod_{j=1}^r H_k(\{1\}^{\lambda_j})$ when $\sum_{j=1}^r \lambda_j\leq 5$. We apply these identities to the study of two…

Number Theory · Mathematics 2009-12-15 Roberto Tauraso

In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…

Combinatorics · Mathematics 2015-05-14 Volker Kaibel , Kanstantsin Pashkovich , Dirk Oliver Theis

Let $X$ be a complex quasi-projective algebraic variety. In this paper we study the mixed Hodge structures of the symmetric products $Sym^{n}X$ when the cohomology of $X$ is given by exterior products of cohomology classes with odd degree.…

Algebraic Geometry · Mathematics 2019-12-09 Jaime A. M. Silva

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

Group Theory · Mathematics 2024-07-24 Sheehan Olver

We investigate the structure and properties of an Artinian monomial complete intersection quotient $A(n,d)=\mathbf{k} [x_{1}, \ldots, x_{n}] \big / (x_{1}^{d}, \ldots, x_{n}^d)$. We construct explicit homogeneous bases of $A(n,d)$ that are…

Representation Theory · Mathematics 2019-12-13 Seok-Jin Kang , Young-Rock Kim , Yong-Su Shin

Given a set of inequalities determined by homogeneous forms, the following intertwined results are established: (1) the volume of the real semi-algebraic domain determined by these inequalities is explicitly determined; it is shown to be…

Number Theory · Mathematics 2023-06-01 Faustin Adiceam , Oscar Marmon

We show that for every homogeneous polynomial of degree $d$, if it has determinantal complexity at most $s$, then it can be computed by a homogeneous algebraic branching program (ABP) of size at most $O(d^5s)$. Moreover, we show that for…

Computational Complexity · Computer Science 2023-08-10 Abhranil Chatterjee , Mrinal Kumar , Ben Lee Volk

Inequalities among symmetric polynomial functions are fundamental questions in mathematics and have various applications in science and engineering. This paper investigates a beautiful and inspiring conjecture, proposed by Cuttler, Greene…

Combinatorics · Mathematics 2025-05-14 Jia Xu , Yong Yao

Let $H_n(t)$ denote the classical Rogers-Szeg\"o polynomial, and let $\tH_n(t_1, \ldots, t_l)$ denote the homogeneous Rogers-Szeg\"o polynomial in $l$ variables, with indeterminate $q$. There is a classical product formula for…

Combinatorics · Mathematics 2013-05-13 Stephen Cameron , C. Ryan Vinroot

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

The two subjects in the title are related via the specialization of symmetric polynomials at roots of unity. Let $f(z_1,\ldots,z_n)\in\mathbb{Z}[z_1,\ldots,z_n]$ be a symmetric polynomial with integer coefficients and let $\omega$ be a…

Combinatorics · Mathematics 2025-04-25 Drew Armstrong

We give several new lower bounds on size of homogeneous non-commutative circuits. We present an explicit homogeneous bivariate polynomial of degree $d$ which requires homogeneous non-commutative circuit of size $\Omega(d/\log d)$. For an…

Computational Complexity · Computer Science 2023-01-05 Prerona Chatterjee , Pavel Hrubeš

We extend the well known theory of $s$-numbers of linear operators to homogeneous polynomials defined between Banach spaces. Approximation, Kolmogorov and Gelfand numbers of polynomials are introduced and some well-known results of the…

Functional Analysis · Mathematics 2015-01-06 Erhan Caliskan , Pilar Rueda

We consider the asymptotics of $k$-dimensional spherical integrals when $k = o(N)$. We prove that the $o(N)$-dimensional spherical integrals are approximately the products of $1$-dimensional spherical integrals. Our formulas extend the…

Probability · Mathematics 2023-02-21 Jonathan Husson , Justin Ko

It is an open problem to determine the dimension of the space of homogeneous polynomials of a fixed degree vanishing at finitely many points in the projective plane to certain multiplicities. We present various aspects of this problem and a…

Algebraic Geometry · Mathematics 2007-05-23 J. Kuttler , N. R. Wallach

It is known that the elementary symmetric polynomials $e_k(x)$ have the property that if $ x, y \in [0,\infty)^n$ and $e_k(x) \leq e_k(y)$ for all $k$, then $||x||_p \leq ||y||_p$ for all real $0\leq p \leq 1$, and moreover $||x||_p \geq…

Classical Analysis and ODEs · Mathematics 2013-02-20 Ivo Klemes

There is considered the problem of describing up to linear conformal equivalence those harmonic cubic homogeneous polynomials for which the squared-norm of the Hessian is a nonzero multiple of the quadratic form defining the Euclidean…

Rings and Algebras · Mathematics 2023-05-15 Daniel J. F. Fox

Given a multi-variable polynomial, there is an associated divided symmetrization (in particular turning it into a symmetric function). Postinkov has found the volume of a permutohedron as a divided symmetrization (DS) of the power of a…

Combinatorics · Mathematics 2014-06-03 Tewodros Amdeberhan

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

Algebraic Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Ludwig Bröcker