Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 38 for “"Gröbner basis"”.
-
Unrestricted dynamic Gröbner Basis algorithms
Gröbner bases are a necessary tool to solve many problems involving polynomial ideals, including applications such as nonlinear polynomial system solving, integer programming and cryptography. Traditional Gröbner Basis algorithms are static, in the sense that they receive a monomial order as input …
-
MULTIVARIATE LIST DECODING OF EVALUATION CODES WITH A GRÖBNER BASIS PERSPECTIVE
Please download dissertation to view abstract.
-
Gröbner basis theory and its applications for regular and biregular functions
This paper covers basic theory of Grobner Bases and an algebraic analysis of the linear constant coefficient partial differential operators, specifically the Cauchy-Fueter operator. We will review examples and theory of regular and biregular functions in several quaternionic variables.
-
Gröbner basis techniques for certain problems in coding and systems theory
… theory. Fitzpatrick has shown that a Göbner basis approach leads to efficient algorithms in the decoding of Reed-Solomon codes and in scalar interpolation and partial realization. This thesis simultaneously generalizes and simplifies that approach and presents applications to discrete-time …
-
Integer programming with Gröbner bases and applications to multiobjective integer programming
… the literature is the algebraic approach using Gröbner basis methods, a traditional tool in the field of computational commutative algebra. The first part of this thesis improves on previous Gröbner basis algorithms for integer programming by introducing a new truncation criterion for integer …
-
An F4-Style Involutive Basis Algorithm
… then give us the solution. Similarly, Gröbner Basis is the “nice form” of nonlinear equation systems that can span all the polynomials in the given ideal [4]. So we can use Gröbner Basis to analyze the solution of a nonlinear equation system.</p> <p>But how to compute a Gröbner Basis? …
-
New Results on Triangulation, Polynomial Equation Solving and Their Application in Global Localization
… a significant improvement in the numerics when Gröbner basis methods are applied. Such methods are often plagued by numerical problems, but by using the fact that the complete Gröbner basis is not needed, the numerics can be improved. In the final part of the thesis we present several new …
-
Accelerating Parameter Identifiability of Differential Models with Applications to Parameter Estimation
… for globally identifiability analysis based on Gröbner basis of polynomial ideals that arise in identifiability studies. Our aim is to improve the computation of the basis and thus significantly accelerate global identifiability analysis for more advanced differential models. In this work, we …
-
Algorithms and Orders for Finding Noncummutative Gröbner Bases
… and good admissible orders for computing Gröbner bases in noncommutative algebras is considered. Gröbner bases are an important tool that make many problems in polynomial algebra computationally tractable. However, the computation of Gröbner bases is expensive, and in noncommutative …
-
Gröbner Bases and Syzygy Modules
The theory of Gröbner bases has become a useful tool in computational commutative algebra. In this paper, we outline some basic results, as they are found in [1], including the concepts of terms ordering, multivariable polynomial division, Gröbner bases, Buchberger's algorithm, and syzygy modules. …
-
On the Complexity of Computing Galois Groups of Differential Equations
… complexity, in the worst case, of computing a Gröbner basis is doubly exponential in the number of variables. Feng chose to represent the radical of the ideal generated by the defining equations of a proto-Galois group by its Gröbner basis. Hence, a double-exponential degree bound for computing …
-
Computational Methods for OI-Modules
… Central to the theory is the notion of a Gröbner basis, which may be thought of as a nonlinear generalization of Gaussian elimination. In 2019, Nagel and Römer introduced FI- and OI-modules over FI- and OI-algebras, which provide a framework for studying sequences of related modules …
-
Reinforcement Learning in Buchberger's Algorithm
… is the classical algorithm for computing a Gröbner basis, and optimized implementations are crucial for many computer algebra systems. In this thesis we introduce a new approach to Buchberger’s algorithm that uses deep reinforcement learning agents to perform S-pair selection, a key choice …
-
HILBERT BASES, DESCENT STATISTICS, AND COMBINATORIAL SEMIGROUP ALGEBRAS
… structure of unit cube semigroup algebra using Gröbner basis methods to acquire these identities. Moreover, this serves as a bridge between previous methods involving polyhedral geometry and triangulations with descent bases methods arising in representation theory. In Chapter 3, the aim is to …
-
Geometric Properties of Over-Determined Systems of Linear Partial Difference Equations
… the role of the kernel representation's Gröbner basis in the Cauchy problem, we extend notions of controllability from the classical behavioral setting to accommodate this generalization. We then address the question as to when an autonomous behavior admits a Livšic-system state-space …
-
Algebraic Geometry Arising from Discrete Models of Gene Regulatory Networks
… computing minimal polynomial models using Gröbner bases. We built up the connection between staircases and Gröbner bases. We pro-vided a necessary and sufficient condition for the ideal I(V ) to have a unique reduced Gröbner basis, using the concept of a basic staircase. We also provide a …
Page 1 of 2