Related papers: Lecture on the combinatorial algebraic method for …
Solving polynomial eigenvalue problems with eigenvector nonlinearities (PEPv) is an interesting computational challenge, outside the reach of the well-developed methods for nonlinear eigenvalue problems. We present a natural generalization…
We study the commutative algebra of three bihomogeneous polynomials p_0,p_1,p_2 of degree (2,1) in variables x,y;z,w, assuming that they never vanish simultaneously on P^1 x P^1. Unlike the situation for P^2, the Koszul complex of the p_i…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
A non-standard quantum deformation of the Poincar\'e algebra is presented in a null-plane framework for 1+1, 2+1 and 3+1 dimensions. Their corresponding universal $R$-matrices are obtained in a factorized form by choosing suitable bases…
Long before we learn to construct the field of rational numbers (out of the ring of integers) at university, we learn how to calculate with fractions at school. When it comes to "numbers", we are used to a commutative multiplication, for…
Algebraic curve interpolation is described by specifying the location of N points in the plane and constructing an algebraic curve of a function f that should pass through them. In this paper, we propose a novel approach to construct the…
We propose an algebraic geometry framework for the Kakeya problem. We conjecture that for any polynomials $f,g\in\F_{q_0}[x,y]$ and any $\F_q/\F_{q_0}$, the image of the map $\F_q^3\to\F_q^3$ given by $(s,x,y)\mapsto…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of…
Given a parametrization of a rational plane algebraic curve C, some explicit adjoint pencils on C are described in terms of determinants. Moreover, some generators of the Rees algebra associated to this parametrization are presented. The…
Existing structural analysis methods may fail to find all hidden constraints for a system of differential-algebraic equations with parameters if the system is structurally unamenable for certain values of the parameters. In this paper, for…
Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for…
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…
Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…
We apply the Lie algebraic method to reflecting optical systems with plane-symmetric freeform mirrors. Using analytical ray-tracing equations we construct an optical map. The expansion of this map gives us the aberration coefficients in…
Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…
A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…
Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
Earlier, there was computed the Poincar\'e series of a valuation or of a collection of valuations on the ring of germs of holomorphic functions in two variables. For a collection of several plane curve valuations it appeared to coincide…