No description available.

Tropical geometry is an area of mathematics that interfaces algebraic geometry and combinatorics. The main object of study in tropical geometry is the tropical variety, which is the combinatorial counterpart of a classical variety. A classical variety is converted into a tropical variety by a process called tropicalization, thus reducing the problems of algebraic geometry to problems of combinatorics. This new tropical variety encodes several useful information about the original variety, for example an algebraic variety and its tropical counterpart have the same dimension. In this thesis, we look at the some of the computational aspects of tropical algebraic geometry. We study a generalization of Grobner basis theory of modules which unlike the standard Grobner basis also takes the valuation of coefficients into account. This was rst introduced in (Maclagan & Sturmfels, 2009) in the settings of polynomial rings and its computational aspects were first studied in (Chan & Maclagan, 2013) for the polynomial ring case. The motivation for this comes from tropical geometry as it can be used to compute tropicalization of varieties. We further generalize this to the case of modules. But apart from that it has many other computational advantages. For example, in the standard case the size of the initial submodule generally grows with the increase in degree of the generators. But in this case, we give an example of a family of submodules where the size of the initial submodule remains constant. We also develop an algorithm for computation of Grobner basis of submodules of modules over Z=p`Z[x1; : : : ; xn] that works for any weight vector. We also look at some of the important applications of this new theory. We show how this can be useful in efficiently solving the submodule membership problem. We also study the computation of Hilbert polynomials, syzygies and free resolutions.

Integer Programming problems are difficult to solve. The goal is to find an optimal solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The Algorithms are The Conti-Traverso Algorithm and the Original Conti-Traverso Algorithm. Examples are given as well as proofs that correspond to the algorithms. The latter algorithm is more efficient as well as user friendly. The algorithms are not necessarily the best way to solve and integer programming problem, but they do find the optimal solution if it exists.

Structural equation models are systems of simultaneous linear equations that are generalizations of linear regression, and have many applications in the social, behavioural and biological sciences. A serious barrier to applications is that it is easy to specify models for which the parameter vector is not identifiable from the distribution of the observable data, and it is often difficult to tell whether a model is identified or not. In this thesis, we study the most straightforward method to check for identification – solving a system of simultaneous equations. However, the calculations can easily get very complex. Grobner basis is introduced to simplify the process. The main idea of checking identification is to solve a set of finitely many simultaneous equations, called identifying equations, which can be transformed into polynomials. If a unique solution is found, the model is identified. Grobner basis reduces the polynomials into simpler forms making them easier to solve. Also, it allows us to investigate the model-induced constraints on the covariances, even when the model is not identified. With the explicit solution to the identifying equations, including the constraints on the covariances, we can (1) locate points in the parameter space where the model is not identified, (2) find the maximum likelihood estimators, (3) study the effects of mis-specified models, (4) obtain a set of method of moments estimators, and (5) build customized parametric and distribution free tests, including inference for non-identified models.

Structural equation models are systems of simultaneous linear equations that are generalizations of linear regression, and have many applications in the social, behavioural and biological sciences. A serious barrier to applications is that it is easy to specify models for which the parameter vector is not identifiable from the distribution of the observable data, and it is often difficult to tell whether a model is identified or not. In this thesis, we study the most straightforward method to check for identification – solving a system of simultaneous equations. However, the calculations can easily get very complex. Grobner basis is introduced to simplify the process. The main idea of checking identification is to solve a set of finitely many simultaneous equations, called identifying equations, which can be transformed into polynomials. If a unique solution is found, the model is identified. Grobner basis reduces the polynomials into simpler forms making them easier to solve. Also, it allows us to investigate the model-induced constraints on the covariances, even when the model is not identified. With the explicit solution to the identifying equations, including the constraints on the covariances, we can (1) locate points in the parameter space where the model is not identified, (2) find the maximum likelihood estimators, (3) study the effects of mis-specified models, (4) obtain a set of method of moments estimators, and (5) build customized parametric and distribution free tests, including inference for non-identified models.

Let e > 3 and mo,... ,me_i be positive integers with gcd(m0,... ,me_i) = 1, which form an almost arithmetic sequence, i.e., some e - 1 of these form an arithmetic progression. We further assume that m0,... ,mc_1 generate F := Σ e-1 I=0 Nmi minimally. Note that any three integers and also any arithmetic progression form an almost arithmetic sequence. We assume that 0 < m0 < • • • < me-2 form an arithmetic progression and n := mc-i is arbitrary Put p := e - 2. Let K be a field and XQ) ... ,Xj>, Y,T be indeterminates. Let p denote the kernel of the if-algebra homomorphism η: K[XQ, ..., XV) Y) -* K^T], defined by r){Xi) = Tm\.. .η{Xp) = Tmp, η](Y) = Tn. Then, p is the defining ideal for the affine monomial curve C in A^, defined parametrically by Xo = Trr^)...)Xv = T^}Y = T*. Furthermore, p is a homogeneous ideal with respect to the gradation on K[X0)... ,XP,F], given by wt(Z0) = mo, • • •, wt(Xp) = mp, wt(Y) = n. Let 4 := K[XQ> ...,XP) Y)/p denote the coordinate ring of C. With the assumption ch(K) = 0, in Chapter 1 we have derived an explicit formula for μ(DerK(A)), the minimal number of generators for the A-module DerK(A), the derivation module of A. Furthermore, since type(A) = μ(DerK(A)) — 1 and the last Betti number of A is equal to type(A), we therefore obtain an explicit formula for the last Betti number of A as well A minimal set of binomial generatorsG for the ideal p had been explicitly constructed by PatiL In Chapter 2, we show that the set G is a Grobner basis with respect to grevlex monomial ordering on K[X0)..., Xp, Y]. As an application of this observation, in Chapter 3 we obtain an explicit minimal free resolution for affine monomial curves in A4K defined by four coprime positive integers mo,.. m3, which form a minimal arithmetic progression. (Please refer the pdf file forformulas)

Orientador: Fernando Eduardo Torres Orihuela / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-11T03:53:44Z (GMT). No. of bitstreams: 1 Tizziotti_GuilhermeChaud_D.pdf: 891044 bytes, checksum: 4e90b377185548b051c39ead60bdf183 (MD5) Previous issue date: 2008 / Resumo: Estendemos resultados de Heegard, Little e Saints relacionados a bases de Gröbner para códigos Hermitianos pontuais. Trabalhamos com códigos Hermitianos bipontuais e n-pontuais, e com códigos sobre a curva Norma-Traço. Além disso, determinamos o semigrupo de Weierstrass de um certo par de pontos racionais sobre a curva Norma-Traço e com esse semigrupo conseguimos melhorar a cota da distância mínima de códigos construídos sobre tais curvas / Abstract: We extend results of Heegard, Little and Saints concerning the Gröbner basis algorithm for one-point Hermitian codes. We work with two-point and n-point Hermitian codes and codes arising from the Norm-Trace curve. We also determine the Weierstrass semigroup at a certain pair of rational points in such curves and uses these computations to improve the lower bound on the minimum distance of two-point algebraic geometry codes arising from them / Doutorado / Algebra, Geometria Algebrica / Doutor em Matemática

Symmetric functions arise in many areas of mathematics including combinatorics, topology and algebraic geometry. Using ideals of symmetric functions, we tie these three branches together. This thesis generalizes work of Garsia and Procesi in 1992 that gave a quotient ring presentation for the cohomology ring of Springer varieties. Let R be the polynomial ring Ζ[x1,…,xn]. We present two different ideals in R. Both are parametrized by a Hessenberg function h, namely a nondecreasing function that satisfies h(i) ≥ i for all i. The first ideal, which we call Ih, is generated by modified elementary symmetric functions. The ideal I_h generalizes the work of Tanisaki who gave a combinatorial description of the ideal used in Garsia and Procesi's quotient ring. Like the Tanisaki ideal, the generating set for Ih is redundant. We give a minimal generating set for this ideal. The second ideal, which we call Jh, is generated by modified complete symmetric functions. The generators of this ideal form a Gröbner basis, which is a useful property. Using the Gröbner basis for Jh, we identify a basis for the quotient R/Jh. We introduce a partial ordering on the Hessenberg functions, and in turn we discover nice nesting properties in both families of ideals. When h>h', we have Ih ⊂ Ih' and Jh ⊂ Jh'. We prove that Ih equals Jh when h is maximal. Since Ih is the ideal generated by the elementary symmetric functions when h is maximal, the generating set for Jh forms a Gröbner basis for the elementary symmetric functions. Moreover, the quotient R/Jh gives another description of the cohomology ring of the full flag variety. The generators of the ring R/Jh are in bijective correspondence with the Betti numbers of certain Hessenberg varieties. These varieties are a two-parameter generalization of Springer varieties, parametrized by a nilpotent operator X and a Hessenberg function h. These varieties were introduced in 1992 by De Mari, Procesi and Shayman. We provide evidence that as h varies, the quotient R/Jh may be a presentation for the cohomology ring of a subclass of Hessenberg varieties called regular nilpotent varieties.

A sign pattern(matrix) is a matrix whose entries are from the set {+,-,0}. An n x n sign pattern matrix is a spectrally arbitrary pattern(SAP) if for every monic real polynomial p(x) of degree n, there exists a real matrix B whose entries agree in sign with A such that the characteristic polynomial of B is p(x). An n x n pattern A is an inertialy arbitrary pattern(IAP) if (r,s,t) belongs to the inertia set of A for every nonnegative triple (r,s,t) with r+s+t=n. Some elementary results on these two classes of patterns are first exhibited. Tree sign patterns are then investigated, with a special emphasis on 4 x 4 tridiagonal sign patterns. Connections between the SAP(IAP) classes and the classes of potentially nilpotent and potentially stable patterns are explored. Some interesting open questions are also provided.

Táto diplomová práca sa zaoberá matematickými aparátmi popisujúcimi doprednú a inverznú kinematiku robotického ramena. Pre popis polohy koncového efektoru, teda doprednej kinematiky, je potrebné zaviesť špeciálnu Euklidovskú grupu zobrazení. Táto grupa môže byť reprezentovaná pomocou matíc alebo pomocou duálnych kvaterniónov. Problém inverznej kinematiky, kedy je potrebné z určenej polohy koncového efektoru dopočítať kĺbové parametre robotického ramena, je v tejto práci riešený pomocou exponenciálnych zobrazení a Grobnerovej bázy. Všetky spomenuté popisy doprednej a inverznej kinematiky sú aplikované na robotické rameno s troma rotačnými kĺbami. Odvodené postupy sú následne implementované a vizualizované v prostredí programu Mathematica.