Related papers: A computational algebraic geometry approach to cla…
Enumerative Geometry is concerned with the number of solutions to a structured system of polynomial equations, when the structure comes from geometry. Enumerative real algebraic geometry studies real solutions to such systems, particularly…
Despite their popularity, many questions about the algebraic constraints imposed by linear structural equation models remain open problems. For causal discovery, two of these problems are especially important: the enumeration of 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…
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
Isomorphisms of separable Hilbert spaces are analogous to isomorphisms of n-dimensional vector spaces. However, while n-dimensional spaces in applications are always realized as the Euclidean space R^n, Hilbert spaces admit various useful…
I discuss a seemingly unlikely confluence of topics in algebra, numerical computation, and computer vision. The motivating problem is that of solving multiples instances of a parametric family of systems of algebraic (polynomial or rational…
Semialgebraic splines are bivariate splines over meshes whose edges are arcs of algebraic curves. They were first considered by Wang, Chui, and Stiller. We compute the dimension of the space of semialgebraic splines in two extreme cases. If…
The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. Actually, the observations show there are two resources to get classification of filiform Leibniz algebras. The first of them…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic…
A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…
We characterize the canonical algebras such that for all dimension vectors of homogeneous modules the corresponding module varieties are complete intersections (respectively, normal). We also investigate the sets of common zeros of…
Tropical geometry is a piecewise linear "shadow" of algebraic geometry. It allows for the computation of several cohomological invariants of an algebraic variety. In particular, its application to enumerative algebraic geometry led to…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
In this paper we compute the set of point modules of finitely semi-graded rings. In particular, from the parametrization of the point modules for the quantum affine n-space, the set of point modules for some important examples of non…
As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium--large (about a thousand digits) input data in a reasonably time cost on an ordinary computer.…
We introduce a module-theoretic approach and a linear-programming method to compute the matricial dimension of numerical semigroups. We use these to compute the matricial dimension of every numerical semigroup with Frobenius number at most…
Symmetries of a partial Latin square are determined by its autotopism group. Analogously to the case of Latin squares, given an isotopism $\Theta$, the cardinality of the set $\mathcal{PLS}_{\Theta}$ of partial Latin squares which are…
Despite the fact that latin cubes have been studied since in the 1940's, there are only a few results on embedding partial latin cubes, and all these results are far from being optimal with respect to the size of the containing cube. For…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…