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 21 for “"Computational Algebra"”.
-
Functional programming applied to computational algebra
… structures, especially those used in computational algebra.
-
Results in Computational Algebra of Bayesian Networks
This dissertation studies the algebraic varieties arising from the conditional independence statements of Bayesian networks. Reduction techniques are described for relating these varieties to the varieties for smaller Bayesian networks. Particular attention is paid to the issues of primality, …
-
Problems in computational algebra and integer programming
… projects that span the gap between commutative algebra and geometric combinatorics: one in tropical geometry, one in computational algebra, and two in discrete geometry and integer programming. Key tools used in this thesis include the theory of polyhedra, Grobner bases, and computational …
-
Software Specialization as Applied to Computational Algebra
<p>A great variety of algebraic problems can be solved using Groebner bases, and computational commutative algebra is the branch of mathematics that focuses mainly on such problems. In this thesis we employ Buchberger's algorithm for finding Groebner bases by tailoring specialized instances of …
-
Inferring Networks with Gene Knockouts and Computational Algebra
… describe an approach to this problem involving computational algebra. Specifically, given an unknown Boolean function, we can create a square-free monomial or pseudomonomial ideal whose primary decomposition encodes the possible sets of variables that the function can depend on, and whether …
-
An Algebraic Approach to Reverse Engineering with an Application to Biochemical Networks
… a discrete modeling approach, rooted in computational algebra, to reverse-engineer networks from experimental time series data. The algebraic method uses algorithmic tools, including Groebner-basis techniques, to build the set of all discrete models that fit time series data and to select …
-
The word problem and the ideal membership problem
This dissertation concerns two problems from computational algebra, the word problem for semigroups and the ideal membership problem for noncommutative polynomial rings. Historically, the word problem provided one of the first examples of an algorithmically unsolvable problem from outside of logic …
-
Algebraic Geometry Arising from Discrete Models of Gene Regulatory Networks
… regulatory networks have gained popularity in computational systems biology over the last dozen years. However, not all discrete network models reflect the behaviors of real biological systems. In this work, we focus on two model selection methods and algebraic geometry arising from these model …
-
Khovanskii and Gröbner Degenerations in Computational Commutative Algebra
… many areas of sciences. This thesis explores new algebraic and numerical methods for addressing such systems. While Gröbner bases are a powerful classical tool in computational commutative algebra, the use of their counterpart for finitely generated algebras, the Khovanskii bases, has not yet been …
-
Biologically Relevant Classes of Boolean Functions
… data has prompted the development of innovative computational techniques for modeling and reverse engineering biological networks. While finite dynamical systems, in particular Boolean networks, have gained attention as relevant models of network dynamics, not all Boolean functions reflect the …
-
Finding Torsion-free Groups Which Do Not Have the Unique Product Property
… we created code that was implemented in Magma, a computational algebra system, for the purpose of considering each size of A and B and running through each case. Along the way we check for the possibility of torsion elements and for other conditions that lead to contradictions, such as a decrease …
-
Algebraic Methods in Query and Proof Complexity
Algebraic methods have become a powerful tool for analyzing the complexity of various computational models, including low-depth circuits, algebraic proofs, and quantum query algorithms. In particular, the complexity of computing a function in these models is related to whether or not the function …
-
Formulae for symmetric powers and tensor products of modular representations of elementary abelian p-groups
… utilized the Magma calculator within the Magma computational algebra software as our primary methodology. Through the use of Magma’s calculator, we efficiently com-puted the tensor products and symmetric powers of modular representations of elementary abelian p-groups, providing precise outcomes …
-
Factoring Polynomials and Groebner Bases
Factoring polynomials is a central problem in computational algebra and number theory and is a basic routine in most computer algebra systems (e.g. Maple, Mathematica, Magma, etc). It has been extensively studied in the last few decades by many mathematicians and computer scientists. The main …
-
Algorithms for modeling and simulation of biological systems; applications to gene regulatory networks
… method for an exploration of the solution space. Computational algebra tools delimit the search space, enabling also a description of model complexity. The performance and robustness of the algorithm are explored via an artificial network of the segment polarity genes in the D. melanogaster. Once …
-
Dual representations of polynomial modules with applications to partial differential equations
… merging concepts from analysis and nonlinear algebra. We offer a new formulation generalizing Gr\"obner's duality for arbitrary polynomial ideals and modules and connect it to the analysis of PDEs. This framework is amenable to the development of symbolic and numerical algorithms. We also …
-
Infinite Groebner Bases And Noncommutative Polly Cracker Cryptosystems
… ideal membership problem for a noncommutative algebra over a finite field. We show that this system, which is the noncommutative analogue of the Polly Cracker cryptosystem, is more secure than the commutative version. This is due to the fact that there are a number of ideals of noncommutative …
-
On the Complexity of Computing Galois Groups of Differential Equations
… can be solved by integrals, exponentials and algebraic functions if and only if the connected component of its differential Galois group is solvable. Computing the differential Galois groups would help us determine the existence of the solutions expressed in terms of elementary functions …
-
Galois Groups of Differential Equations and Representing Algebraic Sets
The algebraic framework for capturing properties of solution sets of differential equations was formally introduced by Ritt and Kolchin. As a parallel to the classical Galois groups of polynomial equations, they devised the notion of a differential Galois group for a linear differential equation. …
-
Graded algebras: theoretical and computational aspects
In this dissertation we study by a computational approach Hilbert functions and minimal graded free resolutions of finitely generated graded modules over two significant graded K-algebras, K being a field. More precisely, if E is the exterior algebra of a finite dimensional K-vector space and F is …
Page 1 of 2