Related papers: Algebraic algorithms for vector bundles over curve…
This paper presents the theory of holomorphic vector valued modular forms from a geometric perspective. More precisely, we define certain holomorphic vector bundles on the modular orbifold of generalized elliptic curves whose sections are…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
We develop a framework to compute characteristic classes and their forms in the computer algebra system SageMath using symbolic calculus. In order to do this, we make use of the Chern-Weil approach in which characteristic classes of vector…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behavior of an experiment? How many of the…
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…
A new type of algorithms is presented that combine the advantages of quantum and classical ones. Those combined advantages along with aspects of Geometric Algebra that open possibilities unavailable to both of these computations are…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We discuss issues of problem formulation for algorithms in real algebraic geometry, focussing on quantifier elimination by cylindrical algebraic decomposition. We recall how the variable ordering used can have a profound effect on both…
This work has the purpose of applying the concept of Geometric Calculus (Clifford Algebras) to the Fibre Bundle description of Quantum Mechanics. Thus, it is intended to generalize that formulation to curved spacetimes [the base space of…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…
In this article, we investigate Hecke modifications of vector bundles on a smooth projective curve $X$ defined over an arbitrary field. We obtain structural results that allow us to reduce the classification problem of Hecke modifications…