Results 81 to 90 of about 908,506 (166)
In this paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A bi-automaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Gröbner basis which ...
Nordbeck, Patrik +3 more
core +1 more source
On sortable intervals of monomials
In 1996, in his study of Gröbner bases of toric ideals, Sturmfels introduced a sorting operator on pairs of monomials of degree d in n variables. This gave rise to the notion of sortable sets, namely sets B of monomials of degree d such that B×B is ...
Bonanzinga Vittoria, Eliahou Shalom
doaj +1 more source
Chinese remainder theorem secret sharing in multivariate polynomials
This paper deals with a generalization of the secret sharing using Chinese remainder theorem over the integers to multivariate polynomials over a finite field. We work with the ideals and their Gröbner bases instead of integer moduli.
Gennadii V. Matveev
doaj +1 more source
Solucionando sistemas polinomiales usando Bases de Gröbner
El Paskín Matemático es una producción del Programa de Matemáticas de la Fundación Universitaria Konrad Lorenz, abierto a todas las personas, que tiene el propósito de acercar al conocimiento matemático de manera amena y rigurosa.Las ecuaciones ...
Martínez Conejo, Juan Sebastián
core
A family of weak keys in HFE and the corresponding practical key-recovery
The HFE (hidden field equations) cryptosystem is one of the most interesting public-key multivariate schemes. It has been proposed more than 10 years ago by Patarin and seems to withstand the attacks that break many other multivariate schemes, since ...
Bouillaguet Charles +3 more
doaj +1 more source
Some Applications of Generalized Char-Sets of Ordinary Differential Polynomial Sets
The notion of characteristic sets, which are a special kind of triangular sets, is introduced by J. F Ritt and W.T. Wu. Wu extended Ritt’s work and developed the characteristic set method not only in theory but in algorithms, efficiency and its numerous ...
Afzal Farkhanda
doaj +1 more source
Characterization and existence of Gröbner bases
Summary. We continue the Mizar formalization of Gröbner bases following [8]. In this article we prove a number of characterizations of Gröbner bases among them that Gröbner bases are convergent rewriting systems. We also show the existence and uniqueness
Christoph Schwarzweller
core
Center conditions and limit cycles for BiLienard systems
In this article we study the center problem for polynomial BiLienard systems of degree n. Computing the focal values and using Grobner bases we find the center conditions for such systems for n=6.
Jaume Gine
doaj
It is well-known that by polynomial elimination methods, in particular by the computation of Gröbner bases, proofs for geometric theorems can be automatically generated.
Koepf, Wolfram
core +1 more source
Comparing complexities of problems of determining of Grebner’s basis of ideal and solving this ideal
A new method of investigation of ideals in the rings of polynomials was proposed by B. Buchberger in 1965. He proposed to use special basis in such rings named “Gröbner Basis” in the honor of his teacher.
A. V. Shokurov
doaj

