English
Related papers

Related papers: Computing the Elementary Symmetric Polynomials in …

200 papers

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

Computational Complexity · Computer Science 2014-12-09 Mark Bun , Thomas Steinke

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…

Computational Complexity · Computer Science 2026-05-01 Sanyam Agarwal , Markus Bläser , Mridul Gupta

We study the problem of representing multivariate polynomials with rational coefficients, which are nonnegative and strictly positive on finite semialgebraic sets, using rational sums of squares. We focus on the case of finite semialgebraic…

Algebraic Geometry · Mathematics 2025-12-16 Lorenzo Baldi , Teresa Krick , Bernard Mourrain

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

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

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

Algebraic Geometry · Mathematics 2022-06-14 John A. Arredondo , Jesús Muciño-Raymundo

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

Combinatorics · Mathematics 2020-10-27 Leonid G. Fel

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Rings and Algebras · Mathematics 2023-04-27 Luis Verde-Star

We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which…

Algebraic Geometry · Mathematics 2023-06-14 Santiago Laplagne , Marcelo Valdettaro

Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…

Computational Complexity · Computer Science 2026-01-22 Somnath Bhattacharjee , Markus Bläser , Pranjal Dutta , Saswata Mukherjee

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…

History and Overview · Mathematics 2025-10-08 Giovanni Longobardi

While every polyadic algebra ($\PA$) of dimension 2 is representable, we show that not every atomic polyadic algebra of dimension two is completely representable; though the class is elementary. Using higly involved constructions of Hirsch…

Logic · Mathematics 2013-04-11 Tarek Sayed Ahmed

Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…

Classical Analysis and ODEs · Mathematics 2017-08-03 Gal Binyamini

It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…

Commutative Algebra · Mathematics 2022-11-30 Mátyás Domokos , Botond Miklósi

The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…

Classical Analysis and ODEs · Mathematics 2016-04-26 A. Martinez-Finkelshtein , E. A. Rakhmanov

The symmetric subrank of homogeneous polynomial is the largest number of terms in a diagonal form to which it can be specialized by a (typically non-invertible) linear variable substitution. Building on earlier work by Derksen-Makam-Zuiddam…

Algebraic Geometry · Mathematics 2026-04-15 Benjamin Biaggi , Jan Draisma , Koen de Nooij , Immanuel van Santen

Let $P\subset \mathbb R^n$ be a belt polytope, that is a polytope whose normal fan coincides with the fan of some hyperplane arrangement $\mathcal A$. Also, let $G:\mathbb R^n\to\mathbb R^d$ be a linear map of full rank whose kernel is in…

Metric Geometry · Mathematics 2023-03-31 Thomas Godland , Zakhar Kabluchko

The goal of the present paper is to provide a detailed study of irreducible representations of the algebra generated by the symmetries of the generic quantum superintegrable system on the $d$-sphere. Appropriately normalized, the symmetry…

Mathematical Physics · Physics 2018-02-09 Plamen Iliev

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal
‹ Prev 1 8 9 10 Next ›