Related papers: On the bit-size of non-radical triangular sets

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

Let a vector-valued sublinear operator satisfy the size condition and be bounded on weighted Lebesgue spaces with variable exponent. Then we obtain its boundedness on weighted grand Herz-Morrey spaces with variable exponents. Next we…

Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7…

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…

We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…

In this paper we prove some lower bounds on the Hausdorff dimension of sets of Furstenberg type. Moreover, we extend these results to sets of generalized Furstenberg type, associated to doubling dimension functions. With some additional…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

We consider the vector space of globally differentiable piecewise polynomial functions defined on a three-dimensional polyhedral domain partitioned into tetrahedra. We prove new lower and upper bounds on the dimension of this space by…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…

We present sharp lower bounds for the A-numerical radius of semi-Hilbertian space operators. We also present an upper bound. Further we compute new upper bounds for the $B$-numerical radius of $2 \times 2$ operator matrices where $B =…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Let A be a finite dimensional algebra over a field of characteristic zero graded by a finite abelian group G. Here we study a growth function related to the graded polynomial identities satisfied by A by computing the exponential rate of…

In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…

Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…

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…

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by…