Related papers: Computational Complexity of Polynomial Subalgebras

We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…

Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are…

The problem of solving a system of polynomial equations is one of the most fundamental problems in applied mathematics. Among them, the problem of solving a system of binomial equations form a important subclass for which specialized…

The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…

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…

We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…

High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…

In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…

Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

Let $k$ be a field of characteristic $p>0$ and $R$ be a subalgebra of $k[X]=k[x_1,...,x_n]$. Let $J(R)$ be the ideal in $k[X]$ defined by $J(R)\Omega_{k[X]/k}^n=k[X]\Omega_{R/k}^n$. It is shown that if it is a principal ideal then $J(R)^q$…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Let M be a maximal subalgebra of the Lie algebra L. A subalgebra C of L is said to be a completion for M if C is not contained in M but every proper subalgebra of C that is an ideal of L is contained in M. The set I(M) of all completions of…

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…