Related papers: Symmetry Adapted Gram Spectrahedra
Shifted partial derivative (SPD) methods are a central algebraic tool for circuit lower bounds, measuring the dimension of spaces of shifted derivatives of a polynomial. We develop the Shifted Partial Derivative Polynomial (SPDP) framework,…
Subtracted geometries are black hole solutions of the four dimensional STU model with rather interesting ties to asymptotically flat black holes. A peculiar feature is that the solutions to the Klein-Gordon equation on this subtracted…
Ternary sextics and quaternary quartics are the smallest cases where there exist nonnegative polynomials that are not sums of squares (SOS). A complete classification of the difference between these cones was given by G. Blekherman via…
The study of symmetries of partial differential equations (PDEs) has been traditionally treated as a geometrical problem. Although geometrical methods have been proven effective with regard to finding infinitesimal symmetry transformations,…
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…
We obtain a minimal supersymmetric extension of the Snyder algebra and study its representations. The construction differs from the general approach given in Hatsuda and Siegel ({\tt hep-th/0311002}), and does not utilize super-de Sitter…
Noncommutative geometry has seen remarkable applications for high energy physics, viz. the geometrical interpretation of the Standard Model. The question whether it also allows for supersymmetric theories has so far not been answered in a…
The maximal contact symmetry dimensions for scalar ODEs of order $\ge 4$ and vector ODEs of order $\ge 3$ are well known. Using a Cartan-geometric approach, we determine for these ODEs the next largest realizable (submaximal) symmetry…
We prove that symmetry group of the pfaffian polynomial of a symmetric matrix is a dihedral group. We calculate pfaffians of symmetric matrices with components $(x_i-x_j)^2$ and $\cos(x_i-x_j)$ for $i<j.$
We investigate the use of conformal maps for the acceleration of convergence of the trapezoidal rule and Sinc numerical methods. The conformal map is a polynomial adjustment to the $\sinh$ map, and allows the treatment of a finite number of…
We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in…
Positive geometries provide a modern approach for computing scattering amplitudes in a variety of physical models. In order to facilitate the exploration of these new geometric methods, we introduce a Mathematica package called…
We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial…
We describe symmetry structure of a general singular theory (theory with constraints in the Hamiltonian formulation), and, in particular, we relate the structure of gauge transformations with the constraint structure. We show that any…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
Geometrical form of the one-loop divergences induced by conical singularities of background manifolds is studied. To this aim the heat kernel asymptotic expansion on spaces having the structure $C_{\alpha}\times \Sigma$ near singular…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are…