Related papers: On Gr\"obner Basis for certain one-point AG codes
We define a method which produces explicit cellular bases for algebras obtained via a Jones basic construction. For the class of algebras in question, our method gives formulas for generic Murphy--type cellular bases indexed by paths on…
In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…
We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
In this paper, we discuss characteristic polynomials in (Clifford) geometric algebras ${\mathcal {G}}_{p,q}$ of vector space of dimension $n=p+q$. We present basis-free formulas for all characteristic polynomial coefficients in the cases…
In this paper we present a Java implementation of the algorithm that computes Buchbereger's and reduced Groebner's basis step by step. The Java application enables graphical representation of the intersection of two surfaces in…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the…
We give an algorithm which computes a presentation for a subgroup, denoted $\AM_{g,1,p}$, of the automorphism group of a free group. It is known that $\AM_{g,1,p}$ is isomorphic to the mapping-class group of an orientable genus-$g$ surface…
In this paper, we develop the python code for generating unit graph $G(\mathbb{Z}_{n}\oplus\mathbb{Z}_{m})$, for any integers $m\ \& \ n$. For any prime $r$, we construct $r$-ary linear codes from the incidence matrix of the unit graph…
The algebraic method provides useful techniques to identify models in designs and to understand aliasing of polynomial models. The present note surveys the topic of Gr\"obner bases in experimental design and then describes the notion of…
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
Given $G$ an algebraic reductive group over an algebraically closed field of characteristic zero and $\Gamma$ a finitely generated group, we provide a stratification of the $G$-character variety of $\Gamma$ in terms of conjugacy classes of…
Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…
In this paper we give an explicit solution to Zariski's moduli problem for plane branches. We compute (in an algorithmic way) the set of K\"{a}hler differentials of an irreducible germ of holomorphic plane curve. We show that there is a…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
We introduce methods for obtaining pretrained Geometric Neural Operators (GNPs) that can serve as basal foundation models for use in obtaining geometric features. These can be used within data processing pipelines for machine learning tasks…