Related papers: Well-Conditioned Polynomial Representations for Ma…

Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations. The efficiency of symbolic computation is largely constrained by such deep computations…

In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…

In the framework of mapped pseudospectral methods, we introduce a new polynomial-type mapping function in order to describe accurately the dynamics of systems developing almost singular structures. Using error criteria related to the…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…

A key aspect of machine learning models lies in their ability to learn efficient intermediate features. However, the input representation plays a crucial role in this process, and polyphonic musical scores remain a particularly complex type…

We show in this article how orthogonal polynomials appear in certain representations of grid shaped quivers. After a short introduction into the general notion of quivers and their representations by linear operators we define the notion of…

The estimates of the uniform norm of the Chebyshev polynomials associated with a compact set $K$ in the complex plane are established. These estimates are exact (up to a constant factor) in the case where $K$ consists of a finite number of…

We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…

In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

I will attempt to represent a symbol to a ps.d.o., using two bases and a lifting functional. The representation is based upon an invariance principle and conditions on the boundary, defined by first surfaces to the symbol.

In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B\in\mathcal B}\prod_{e \in B} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. According to the Kontsevich…

In this paper we introduce a basic representation for the confluent Cherednik algebras $\mathcal H_{\rm V}$, $\mathcal H_{\rm III}$, $\mathcal H_{\rm III}^{D_7}$ and $\mathcal H_{\rm III}^{D_8}$ defined in arXiv:1307.6140. To prove…