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 18 of 18 for “"computational algebraic geometry"”.
-
Computational Algebraic Geometry Applied to Invariant Theory
… of invariance under a group action of GLn(C). Computational difficulties are also discussed in reference to Groebner bases and Invariant theory.The straitening law is presented from a Groebner basis point of view and is motivated as being a key piece of machinery in proving First Fundamental …
-
Classical and Computational Algebraic Geometry in Computer Vision
… image reconstruction algorithm for two-view geometry, using $7$ paired points $(x_i,y_i)\in\PP^2\times\PP^2$ in two images to reconstruct the original cameras which produced them. This is done by constructing the $7\times9$ matrix $Z$ with rows $(x_i^\top\otimes y_i^\top)$ and producing the …
-
Groebner Bases
… Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. We then provide a geometric proof of this lemma, in the case of two variables, using our own ideas. We use Buchberger's Algorithm to produce a Groebner basis given any set of generators for …
-
Algebraic and Combinatorial Applications in Systems and Evolutionary Biology
… these problems are addressed using tools from (computational) algebraic geometry, commutative algebra, and combinatorics. Inspired by questions in systems and evolutionary biology, three algebraic problems are addressed in this thesis: steady-state analysis of mass-action ordinary differential …
-
High-dimensional polytopes defined by oracles: algorithms, computations and applications
… research area of this thesis is discrete and computational geometry and its connections to branches of computer science and applied mathematics. The contribution of this thesis is threefold. First, the design and analysis of geometric algorithms for problems concerning high-dimensional, convex …
-
Quantitative Aspects of Sums of Squares and Sparse Polynomial Systems
Computational algebraic geometry is the study of roots of polynomials and polynomial systems. We are familiar with the notion of degree, but there are other ways to consider a polynomial: How many variables does it have? How many terms does it have? Considering the sparsity of a polynomial means we …
-
Control Systems: New Approaches to Analysis and Design
… for any given plant. The method makes use of computational algebraic geometry techniques and sign-definite decomposition method. Although designing a stabilizing controller of a fixed structure is important, in many practical applications it is also desirable to control the transient response …
-
Voronoi diagrams of semi-algebraic sets
… denned as the set of solutions of a system of algebraic equations and inequalities (semialgebraic sets). Many problems from different fields involve proximity queries like finding the (nearest) neighbours or quantifying the neighbourliness of two objects. The Voronoi diagram of a set of sites …
-
New techniques for digital filter design
… is revisited, and the use of Grobner bases from computational algebraic geometry for this problem is described.
-
Computational Aspects of Galois Groups in Enumerative Geometry
… and then describe tools from numerical and computational algebraic geometry used to compute and exploit Galois groups. We then give the algebraic definition of the Galois group originally used by Jordan, as well as a geometric definition. We prove these definitions are equivalent and explore …
-
Sparse polynomial systems in optimization
… Solving these systems is at the heart of computational algebraic geometry, a field which is often associated with symbolic computations based on Gr¨obner bases. Over the last thirty years, increasing performance and versatility made numerical algebraic geometry emerge as an alternative. It …
-
On the complexity of feasibility, connectivity, and $2^a$-isogeny computation
Algebraic geometry has several real-world applications, including automation and robot motion planning, control theory, as well as in the foundations of certain post-quantum cryptosystems. For example, isogeny-based cryptography is built on the computational difficulty of finding isogenies between …
-
Lattice vs. continuum: Landau gauge fixing and ’t Hooft-Polyakov monopoles.
… equations. They can then be solved exactly by computational Algebraic Geometry, the Groebner basis technique in particular, and numerically by the Polynomial Homotopy Continuation method. ’t Hooft-Polyakov monopoles play an important role in high energy physics due to their presence in grand …
-
Real Algebraic Geometry of the Sextic Curves
… part of this thesis revolves around the real algebraic geometry of curves, especially curves of degree six. We use the topological and rigid isotopy classifications of plane sextics to explore the reality of several features associated to each class, such as the bitangents, inflection points, …
-
Certified Approximation Algorithms of Algebraic Curves
… set of solutions to a system of equations. In algebraic geometry, the equations studied are polynomials, and the solution set is called an algebraic variety. For single variable polynomials of degree less than five, the roots can be determined exactly using algebraic methods, but for …
-
Divisor Class Group Arithmetic on C3,4 Curves
Computing in the divisor class group of an algebraic curve is a non-trivial component in computing L-series. L-series in turn are at the heart of the Sato-Tate conjecture and related conjectures. The Sato-Tate conjecture has been proven for elliptic curves with complex multiplication, but remains …
-
Reality and Computation in Schubert Calculus
… We also improve the state of the art of computationally solving Schubert problems, allowing us to more effectively study ill-understood phenomena in Schubert calculus. We use supercomputers to methodically solve real osculating instances of Schubert problems. By studying over 300 million …
-
Newton Polytopes and Numerical Algebraic Geometry
… algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile. Additionally, we construct a numerical tropical membership …