Related papers: On the complexity of computing Gr\"obner bases for…

It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…

The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gr\"obner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for…

We introduce W-spin structures on a Riemann surface and give a precise definition to the corresponding W-spin equations for any quasi-homogeneous polynomial W. Then, we construct examples of nonzero solutions of spin equations in the…

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

We study quasifinite highest weight modules over the supersymmetric extension of the $W_{1+\infty}$ algebra on the basis of the analysis by Kac and Radul. We find that the quasifiniteness of the modules is again characterized by…

We introduce tools from numerical analysis and high dimensional probability for precision control and complexity analysis of subdivision-based algorithms in computational geometry. We combine these tools with the continuous amortization…

~Let $(g,~[-,-],~\omega)$ be a finite-dimensional complex $\omega$-Lie superalgebra. This paper explores the algbaraic structures of generalized derivation superalgebra ${\rm GDer}(g)$, compatatible generalized derivations algebra ${\rm…

Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

Let $K$ be a field and $R=\oplus_{p\in\mathbb{N}}R_p$ an $\mathbb{N}$-graded $K$-algebra, which has an SM $K$-basis (i.e. a skew multiplicative $K$-basis) such that $R$ holds a Gr\"obner basis theory. It is proved that there is a one-to-one…

In this paper, we establish hardness and approximation results for various $L_p$-ball constrained homogeneous polynomial optimization problems, where $p \in [2,\infty]$. Specifically, we prove that for any given $d \ge 3$ and $p \in…

The objective of this work is to establish an upper bound for the almost sure convergence rate for a class of push-sum algorithms. The current work extends the methods and results of the authors on a similar low-complexity bound on push-sum…

Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…

We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring $R=\mathbb{F}[[\pi]]$. This is achieved by starting from a basis for classical homology of the $n$-th…

For microscale heterogeneous PDEs, this article further develops novel theory and methodology for their macroscale mathematical/asymptotic homogenization. This article specifically encompasses the case of quasi-periodic heterogeneity with…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of the degree of the input equations and exponential in their…

Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…

We consider the significant class of holomorphically nondegenerate CR manifolds of finite type that are represented by some weighted homogeneous polynomials and we derive some useful features which enable us to set up a fast effective…