Results 31 to 40 of about 4,148,143 (214)
Oracle-supported drawing of the Gröbner escalier
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2020 The aim of this note is to discuss the following quite queer problem: to compute the Gröbner basis of an ideal I w.r.t. a term-ordering ≺ without knowing neither the ideal nor the term-ordering but only a degree bound of the required Gröbner basis, being
Maria Emilia Alonso +2 more
doaj +1 more source
Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case [PDF]
International Symposium on Symbolic and Algebraic Computation, 2018 One of the biggest open problems in computational algebra is the design of efficient algorithms for Gröbner basis computations that take into account the sparsity of the input polynomials.
M. Bender +2 more
semanticscholar +1 more source
Complexity bounds on Semaev’s naive index calculus method for ECDLP
Journal of Mathematical Cryptology, 2020 Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as ...
Yokoyama Kazuhiro +3 more
doaj +1 more source
Computer Assisted Methods in Engineering and Science, 2023 Solving systems of algebraic equations is presented using the Gröbner Basis Package of the computer algebra system MAPLE V. The Grobner basis computations allow exact conclusions on the solutions of sets of polynomial equations, such as to decide if the
György Popper
doaj
Semi-inverted linear spaces and an analogue of the broken circuit complex [PDF]
, 2019 The image of a linear space under inversion of some coordinates is an affine variety whose structure is governed by an underlying hyperplane arrangement.
Scholten, Georgy, Vinzant, Cynthia
core +3 more sources
List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes [PDF]
, 2016 We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amor\'os and O'Sullivan (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm
Adams +55 more
core +3 more sources
, 2020 A system of polynomial ordinary differential equations (ODEs) is specified via a vector of multivariate polynomials, or vector field, $F$. A safety assertion $\psi\rightarrow[F]\phi$ means that the trajectory of the system will lie in a subset $\phi ...
Boreale, Michele
core +1 more source
Toric ideals associated with gap-free graphs [PDF]
, 2014 In this article we prove that every toric ideal associated with a gap-free graph $G$ has a squarefree lexicographic initial ideal. Moreover, in the particular case when the complementary graph of $G$ is chordal (i.e.
D'Alì, Alessio
core +1 more source
Lower bounds on the number of realizations of rigid graphs [PDF]
, 2018 Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available ...
Grasegger, Georg +2 more
core +2 more sources
Computing periods of rational integrals [PDF]
, 2014 A period of a rational integral is the result of integrating, with respect to one or several variables, a rational function over a closed path.
Lairez, Pierre
core +7 more sources