University of Kentucky |
Department of Mathematics University of Kentucky |
||||
C.F. Gauss | E. Noether | D. Hilbert | F.J. MacWilliams |
Sep 13, 2017 |
Fernando Shao (University of Kentucky)
Value sets of polynomials modulo primes Let f be a polynomial with integer coefficients. For each prime p, we can reduce f modulo p and consider the (relative) size of the value set of f mod p. There is much to be desired concerning how small the relative sizes can be on average over p. In this talk I will discuss some results and some open problems. |
Sep 6, 2017 |
Chris Manon (University of Kentucky)
An Introduction to Khovanskii Bases Khovanskii bases are subsets of algebras which have nice computational properties. They are a generalization of so-called SAGBI bases or canonical bases in an algebra, and in this sense they are meant to do for algebras what Groebner bases do for ideals. I'll give an introduction to Khovanskii bases, describe a few theorems about their structure and their existence, and describe their relationship to other interesting topics in combinatorial algebraic geometry, like tropical geometry and toric geometry. |
Aug 30, 2017 |
Nathan Fieldsteel (University of Kentucky)
Ideals of Geometrically Characterized Point Sets and Simplicial Complexes Let X be a finite set of points in an affine space. A Lagrange polynomial for X is a polynomial which vanishes at all but one of the points of X. In a way which can be made precise, not every point set admits Lagrange polynomials, but the existence of Lagrange polynomials for X guarantees that a polynomial function is completely determined by its values on X. If in addition, these Lagrange polynomials fully factor into products of linear polynomials, the set X is called geometrically characterized. In this talk, we will discuss the geometry of geometrically characterized sets, the ideals of such point sets, and will make some connections to simplicial complexes. |
Aug 25, 2017 |
Jared Antrobus (University of Kentucky)
Ferrers Diagram Rank-Metric Codes Our codes of interest are subspaces of F_q^{m\times n} in which every nonzero matrix has rank at least \delta, and conforms to the shape of a given Ferrers diagram. In 2009, Etzion and Silberstein proved an upper bound for the dimension of such codes, and conjectured that it is achievable for any given parameters. In particular, the case for unrestricted matrices was solved in 1985 by Gabidulin, predating the complications brought on by nontrivial Ferrers diagram shapes. In this talk, we will prove the bound and discuss several known cases of the conjecture, including two new cases. |
Jul 26, 2017 |
Aida Maraj (University of Kentucky)
Some Algebraic Properties of Hierarchical Models We are going to introduce certain toric ideals that correspond to structures of Hierarchical Models in Algebraic Statistics and explore the properties of these ideals. One challenge will be to describe ideals that have infinitely many generators in a finite way, which we do using the symmetry group action on the set of indices. We will also show a formula for calculating the dimension of the variety defined by these ideals, and make progress in calculating the corresponding Hilbert function. |
May 11, 2017 |
Jay White (University of Kentucky)
Upper Bounds for Betti numbers The Hilbert function/polynomial and the Betti numbers each give fruitful information about an ideal, so relationships between the two are interesting. We will discuss the question of whether the Betti numbers have maximums for certain families of ideals. |
Apr 27, 2017 |
Rachel Petrik (University of Kentucky)
The Chevalley-Warning Theorems The Chevalley-Warning Theorems are a collection of results that give different lower bounds for the number of solutions to systems of equations over finite fields. In particular, for a system of equations over a finite field, F_q, if the number of variables (n) is strictly greater than the total degree of the system (d), then the number of solutions is greater than or equal to q^{n-d}. In 2011, D. R. Heath-Brown improved some of these results. In this talk, I will briefly state the Chevalley-Warning Theorems and then discuss Heath-Brown's results. |
Apr 26, 2017 |
Ben Bakker (University of Georgia)
A global Torelli theorem for singular symplectic varieties The local and global deformation theories of holomorphic symplectic manifolds enjoy many beautiful properties. By work of Namikawa, some of the local results generalize to singular symplectic varieties, but the moduli theory is badly behaved. In joint work with C. Lehn we show that for locally trivial deformations the entire picture is exactly analogous to the smooth case. In particular, we prove a global Torelli theorem and deduce some applications to birational contractions of moduli spaces of vector bundles on K3 surfaces. In place of twistor lines, the crucial global input is Verbitsky's work on ergodic complex structures using Ratner's theorems. |
Apr 20, 2017 |
Isaiah Harney (University of Kentucky)
Colorings of Hamming-Distance Graphs Error-correcting codes can be given a graphical interpretation via the Hamming-distance graphs, allowing for the application of graph theoretical approaches to what has traditionally been an algebra-based field. In a recent paper, El Rouayheb et al. used this graphical interpretation to produce new proofs for, and in some cases actually improve, known bounds on the size of error-correcting codes. In this talk, we study various standard graph properties of the Hamming-distance graphs with special emphasis placed on vertex colorings. In particular, we give a partial answer to an open problem of El Rouayheb et al. concerning the chromatic number of the Hamming-distance graphs. Furthermore, we define a notion of robustness for colorings which allows us to extend a classical result of Greenwell/Lovasz concerning the structure of minimal colorings of certain families of Hamming-distance graphs. |
Apr 19, 2017 |
Kalila Sawyer (University of Kentucky)
Special divisors on marked chains of cycles One area of current research in algebraic geometry is whether it is possible to classify all divisors on an algebraic curve. In general, this is a difficult question, but it turns out that the chain of loops has enough combinatorial structure that some progress can be made. In 2012, Cools, Draisma, Payne, and Robeva classified divisors on a generic chain of loops, and in 2016, Pflueger generalized their techniques to classify divisors on an arbitrary chain of loops. We will discuss Pflueger's techniques and results, focusing on this classification. No prior knowledge of algebraic geometry is assumed. |
Apr 18, 2017 |
Luis Sordo Vieira (University of Kentucky)
Quadratic Forms Over p-adic Fields |
Apr 17, 2017 |
Anupam Kumar (University of Kentucky)
Finite generation of symmetric ideals The Hilbert Basis Theorem says that for a commutative Noetherian ring A and for a finite collection of variables X, every ideal of A[X] is finitely generated over A[X]. This certainly is not true if X is an infinite collection of variables. However, we can say that an ideal invariant under the action of the permutation group S_X is finitely generated over the group ring A[X][S_X]. In this talk, we will discuss a sketch of a proof of this result. It involves introducing a certain well-partial-ordering on monomials of X and developing a theory of Groebner bases and reduction in this setting. |
Apr 5, 2017 |
Bill Trok (University of Kentucky)
Waring's Problem on Forms, Fat Points and the Macaulay Inverse Systems Waring's Problem on forms is the question, given a homogeneous form F of degree d in n variables, what is the smallest integer K, so that there are linear forms L_1,...,L_K such that F = L_1^d + ... + L_K^d. For a given form F this integer is called the Waring rank of F. Ehrenborg and Rota showed that for generic forms this problem is equivalent to computing the Hilbert polynomial of generic double point ideals, a problem solved in 1995 by Alexander and Hirschowitz. In this talk, we discuss the connection between these problems and discuss results on forms whose Waring rank exceeds that of generic forms. |
Mar 29, 2017 |
Alberto Ravagnani (University of Toronto)
An algebraic framework for end-to-end physical-layer network coding In the framework of physical-layer network-coding (PLNC), multiple terminals attempt to exchange sets of messages through intermediate relay nodes. Recently, Feng, Silva and Kschischang developed an algebraic framework to study PLNC schemes, where messages can be represented as modules over a finite principal ideal ring. In this talk, in analogy with random linear network coding, we propose an algebraic framework for module transmission based on module length. We define a submodule code as a collection of submodules of a given ambient space module, and measure the distance between submodules via a function which we call the submodule distance. Both information loss and errors are captured by the submodule distance. Using the row-echelon form of a matrix over a principal ideal ring, we reduce the computation of the distance between submodules to the computation of the length of certain ideals in the base ring. We then present two bounds on the size of a submodule code of given minimum distance and whose codewords have fixed length. For certain classes of rings, we state our bounds explicitly in terms of the ring and code invariants. Finally, we construct classes of submodule codes with maximum error-correction capability. In particular, we construct asymptotically optimal codes over certain rings that are relevant from an applied viewpoint. Joint work with Elisa Gorla. |
Mar 22, 2017 |
Tif Shen (Yale University)
Break divisors and compactified Jacobians Let X be a genus g strictly semistable family of curves over C[[t]]. We show, using break divisors introduced by Mikhalkin and Zharkov, that all degree g Simpson compactified Jacobians of X are identical. As a consequence , we resolve a conjecture of Payne, and show that the unique degree g Simpson compactified Jacobian can be constructed from the break divisor decomposition introduced by An-Baker-Kuperberg-Shokrieh, using Mumford's non-Archimedean uniformization theory. |
Mar 1, 2017 |
Juan Migliore (University of Notre Dame)
Lefschetz properties for ideals of powers of linear forms If R/I is an artinian algebra over an infinite field K, and if L is a general linear form, then the Lefschetz question asks for which k does the multiplication map \times L^k : [R/I]_{j-k} \rightarrow [R/I]_j have maximal rank for all j? If this is true for k=1 then we say R/I has the Weak Lefschetz Property (WLP). If it is true for all k then we say that R/I has the Strong Lefschetz Property (SLP). But it can happen that this holds for some k but not others. At the end of a paper from 2010, Mir’o-Roig, Nagel and I gave some computer evidence suggesting that the question might be an interesting one for ideals generated by powers of general linear forms. This generated a number of papers by ourselves and others. Now the situation is largely understood for WLP and few variables, and largely wide open for more variables or higher k. I’ll give an overview of the current state of affairs and try to indicate some interesting open directions. I’ll also describe some of the methods that have been used in the study of this problem, especially a duality result of Emsalem and Iarrobino to translate the problem to a study of fat points in projective space. |
Feb 22, 2017 |
Ashwin Deopurkar (Columbia University)
Theta characteristics and the Weil pairing on degenerate curves Often degenerate curves play a crucial role in our understanding of a generic smooth curve. The classical theory of limit linear series developed by Griffiths and Harris studies deformation of a line bundle on a smooth curve to a degenerate curve of compact type. They used to this method to prove the Brill-Noether theorem. A totally different proof was given by Cools, Draisma, Payne, and Robeva using degenerate curves of non-compact type. The theory of limit linear series for such curves takes shape of metric graphs and divisors on them. After explaining this interplay of tropical geometry and algebraic geometry, I'd talk about specilizations of theta characteristics and the Weil pairing. |
Feb 15, 2017 |
Martina Juhnke-Kubitzke (Universität Osnabrück, Germany)
Flawlessness of h-vectors of broken circuit complexes One of the major open questions in matroid theory asks whether the h-vector (h_0,h_1,...,h_s) of the broken circuit complex of a matroid is weakly increasing in its first half and also satisfies that h_i is at most h_{s-i} whenever i is between zero and s/2. In this talk, we give an affirmative answer to this question for matroids that are representable over a field of characteristic zero. This is joint work with Din van Le. |
Nov 30, 2016 |
Dave Jensen (University of Kentucky)
Linear Systems on General Curves of Fixed Gonality The geometry of an algebraic curve is governed by the maps it admits to various projective spaces. While many curves exhibit bizarre and pathological maps, the general curve does not. This is a consequence of the Brill-Noether theorem, which says that the space of maps of given degree and rank on a general curve has dimension equal to its expected dimension. In this talk, we will discuss a generalization of this theorem to general curves of fixed gonality. To prove this result, we use tropical and combinatorial methods. This is joint work with Dhruv Ranganathan. |
Nov 16, 2016 |
Sam Payne (Yale University)
Top weight cohomology of moduli spaces of curves The top weight cohomology of the moduli space of algebraic curves is naturally identified (with a degree shift) with the reduced rational homology of a moduli space of stable tropical curves. I will discuss the structure of this tropical moduli space and applications to computing new cohomology classes on M_g, based on recent joint work with M. Chan and S. Galatius. |
Nov 9, 2016 |
Luis Sordo Vieira (University of Kentucky)
On the transfer map Let G be a finite group and let H be a group of finite index. Then there is a nice way of defining a homomorphism from G to H/H'. This map is ubiquitous in group theory. A bit more surprisingly, it shows up in other areas of mathematics such as in Class Field Theory, Algebraic Topology and classical number theory. We will study the transfer map, and get some information on how the Sylow subgroups of a finite group G control the structure of G using transfer theory. We will also talk about a really neat application in number theory. |
Nov 2, 2016 |
Jay White (University of Kentucky)
Maximum Betti Numbers for a Hilbert Function The Hilbert function and the Betti numbers each give fruitful information about an ideal, so relationships between the two are interesting. We will answer the question of whether the Betti numbers have a maximum for a given Hilbert function. To do this, we will discuss strongly stable and lexicographic ideals. |
Oct 19, 2016 |
Bill Trok (University of Kentucky)
Matroids and Regularity of Fat Points Given a scheme of fat points Z in P^n, the regularity index can be defined as the point where the Hilbert function of the quotient ring, R/I(Z), is equal to the degree. We discuss new results which give upper bounds on this regularity index, based on the linear position of the points in space. A key technique is some results in the theory of Matroid Partitions. |
Oct 19, 2016 |
David Zureick-Brown (Emory University)
Canonical rings of stacky curves We give a generalization to stacks of the classical (1920's) theorem of Petri -- we give a presentation for the canonical ring of a stacky curve. This is motivated by the following application: we give an explicit presentation for the ring of modular forms for a Fuchsian group with cofinite area, which depends on the signature of the group. This is joint work with John Voight. |
Oct 12, 2016 |
Anna-Lenna Horlemann-Trautmann (EPF Lausanne, Switzerland)
Network Coding and Schubert Varieties Over Finite Fields Network coding deals with noisy transmission of data over a network, in our case from one sender to several receivers. It turns out that linear vector spaces over a finite field are a good tool for error correction in this setting. In this talk we give a quick introduction to network coding in general and show that many network coding theoretic problems translate into enumerative geometry problems in the Grassmann variety over the finite field. In particular, the Plücker embedding of the Grassmann variety, and Schubert varieties therein, are useful tools for code constructions and decoding algorithms. We show how to set up such an error correcting decoding algorithm and what its advantages and disadvantages are. Moreover, we briefly explain classical Schubert calculus over the complex numbers and show that the classical results do not hold (in general) over finite fields. |
Oct 5, 2016 |
Tefjol Pllaha (University of Kentucky)
Equivalence of stabilizer codes I will start this talk with a short discussion on equivalence of classical codes. Then, I will define stabilizer codes and equivalencies that naturally arise from quantum information theory. Using insights from the classical case, we introduce an equivalence notion for stabilizer codes. We show that this notion coincides with the natural notion of equivalence used widely in quantum information theory. No prior knowledge of coding theory and quantum computation is assumed. |
Sep 28, 2016 |
McCabe Olsen (University of Kentucky)
Euler-Mahonian statistics and descent bases for semigroup algebras We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z} \wr S_n$ -invariant ideals. Using Groebner basis methods, we can show that the resulting graded quotient algebra has a basis with each element indexed by colored permutation and each element encodes descent and major index statistics of the colored permutation. We can use this basis to recover combinatorial identities. This talk is based on joint work with Ben Braun. |
Sep 14, 2016 |
Jared Antrobus (University of Kentucky)
Lexicodes Over Principal Ideal Rings Let R be a finite principal left ideal ring. Place a lexicographic ordering on the vectors in the free left R-module R^n with respect to some basis B. The code produced by searching through this list, greedily collecting vectors satisfying some property P, is called a lexicode. For decades, several iterations of a greedy algorithm have appeared, to produce maximal lexicodes with nice properties. The most recent, in 2014, was generalized to work over finite chain rings. In this talk, I will present a new version of the greedy algorithm, generalized to produce lexicodes over a much larger class of rings. |
Sep 7, 2016 |
Uwe Nagel (University of Kentucky)
Hilbert Series of Monomial Orbits Hilbert functions or Hilbert series contain useful information about ideals. First, we will define and compute these invariants in the classical setting of a polynomial ring in finitely many variables if the ideal is a principal ideal. Then we discuss the analogous result in the spirit of commutative algebra up to symmetry. For this we consider the orbit of a monomial in a polynomial ring in infinitely many variables. The talk is based on joint work with Sema Gunturkun. |
Aug 31, 2016 |
Tim Roemer (Universität Osnabrück, Germany)
Commutative Algebra up to Symmetry Ideal theory over a polynomial ring in infinitely many variables is rather complicated which is (beside other things) due to the fact that this ring is not Noetherian. Since very recently one is interested in ideals in such a ring which are invariant under certain well-behaved monoid actions. We present some new results and open questions on algebraic properties of these ideals and associated objects of interest. The talk is based on joint work with Uwe Nagel. |
Apr 27, 2016 |
Heide Gluesing-Luerssen (University of Kentucky)
Code-Based Cryptography and a Variant of the McEliece Cryptosystem After a brief overview of public-key cryptography I will turn to a specific realization of a cryptosystem that relies on the hardness of decoding a random code. These cryptosystems were introduced by McEliece in 1978, but became popular only recently when it was discovered that RSA and elliptic-curve cryptography won't be secure in the presence of quantum computers. I will discuss the workings, advantages and drawbacks of the McEliece cryptosystem and also present a variant that aims at overcoming some of its drawbacks. No prior knowledge on public-key cryptography and coding theory is assumed. |
Apr 20, 2016 |
Jonathan Constable (University of Kentucky); PhD defense
Kronecker's Theory of Binary Bilinear Forms with Applications to Representations of Integers as Sums of Three Squares In 1883 Leopold Kronecker published a paper containing “a few explanatory remarks” to an earlier paper of his from 1866. His work loosely connected the theory of integral binary bilinear forms to the theory of integral binary quadratic forms. In this defense we shall discover the key statements within Kronecker's paper and offer insight into new, detailed arithmetic proofs. Further, I will present some additional results on the proper and complete class numbers for bilinear forms, before demonstrating their use in rigorously developing the connection between binary bilinear forms and binary quadratic forms. We conclude by giving an application of this material to the number of representations of an integer as a sum of three squares and show the resulting formula is equivalent to the well-known result due to Gauss. |
Apr 20, 2016 |
Rachel Petrik (University of Kentucky)
Constructing the p-adic Integers For a prime p, the p-adic integers Z_p is the valuation ring of the field of p-adic numbers Q_p. In this talk, we will explicitly construct Zp as a ring of coherent sequences and explore its algebraic and topological properties. We will then explore the multiplicative structure of Q_p using Hensel's Lemma. |
Apr 18, 2016 |
Neville Fogarty (University of Kentucky); PhD Defense
On Skew-Constacyclic Codes Cyclic codes are a well-known class of linear block codes with efficient decoding algorithms. In recent years they have been generalized to skew-constacyclic codes; such a generalization has previously been shown to be useful. After a brief introduction of skew-polynomial rings and their quotient modules, which we use to study skew-constacyclic codes algebraically, we motivate and define a notion of idempotent elements in these quotient modules. We are particularly concerned with the existence and uniqueness of idempotents that generate a given submodule; as such, we generalize relevant results from previous work on skew-constacyclic codes by Gao/Shen/Fu in 2013 and well-known results from the classical case. |
Apr 6, 2016 |
Luis Sordo Vieira (University of Kentucky)
Elliptic Curves over finite fields and some of its applications We will introduce elliptic curves and talk about (some) applications of elliptic curves, including factorizations of integers and elliptic curve protocols. |
Mar 30, 2016 |
Bill Trok (University of Kentucky)
The Alexander Hirschowitz Theorem A double point corresponds to the square of an ideal of a point. Geometrically we say a function vanishes at a double point, if its value and all derivatives vanish at the point. Given a collection of double points then, we can ask how many polynomials of a given degree vanish at all of them. This is equivalent to asking what the Hilbert function of the corresponding ideal is. In this talk we present a theorem of Alexander and Hirschowitz which classifies the Hilbert function of generic double points in projective space. |
Mar 29, 2016 |
David Cook II (Eastern Illinois University)
The absence of the weak Lefschetz property Mezetti, Miro-Roig and Ottaviani showed that in some cases the failure of the weak Lefschetz property can be used to produce a variety satisfying (nontrivial) Laplace equation. We define a graded algebra to have a Lefschetz defect of delta in degree d if the rank of the multiplication map of a general linear form between the degree d-1 and degree d components has rank delta less than the expected rank. Mezzetti and Miro-Roig recently explored the minimal and maximal number of generators of ideals that fail to have the weak Lefschetz property, i.e., to have a positive Lefschetz defect. In contrast to this, we will discuss constructions of ideals that have large Lefschetz defects and thus can be used to produce toric varieties satisfying many Laplace equations. |
Mar 23, 2016 |
David Leep (University of Kentucky)
Levels and Pythagoras numbers of commutative rings The level s(R) of a commutative ring R is the smallest integer n such that -1 is a sum of n squares of elements in R. Set s(R) = infinity if no such representation exists. The Pythagoras number p(R) is the smallest integer m such that every sum of squares of elements in R is already a sum of m squares in R. Set p(R) = infinity if no such bound exists. The study of levels and Pythagoras numbers of fields is a classical topic. Many results are known, but many open questions still remain. The study of levels and Pythagoras numbers of arbitrary commutative rings is more recent. I will survey known results and report on recent research with Detlev Hoffmann. |
Feb. 24, 2016 |
Tefjol Pllaha (University of Kentucky)
Quantum error-correcting codes II This talk will be a continuation of the talk from last week. Definitions from quantum computing will be formalized and algebra will finally come into play to translate quantum questions to classical coding theory. Physics background is neither assumed nor required. |
Feb. 17, 2016 |
Tefjol Pllaha (University of Kentucky)
Quantum error-correcting codes Quantum error correction is a necessity for eventual quantum computers and unfortunately much more difficult than the classical one. In this talk, we will explore these difficulties and how to fight them with good quantum codes. The focus will be on stabilizer formalism, as a compact description of almost every known quantum code. We will use this algebraic language to translate questions raising from quantum computation to classical error correction. Physics background is neither assumed nor required. |
Feb. 3, 2016 |
Uwe Nagel (University of Kentucky)
Dimensions of secant varieties A variety is the set of solutions of a polynomial system of equations. Considering the union of all linear subspaces spanned by k points on a variety V, one obtains the k-th secant variety of V. Determining the dimension of a secant variety is an interesting and challenging problem. We illustrate this in two instances. The first one concerns the Waring rank. Any homogeneous polynomial f of degree d can be written as a sum of d-th powers of linear forms. The minimum number of summands in such a decomposition is the Waring rank of f. It admits a geometric interpretation using secant varieties. In the second instance we use linear algebra to solve the problem in some cases. The general problem (of decomposing tensors as sums of pure tensors) is open. |
Jan. 27, 2016 |
Uwe Nagel (University of Kentucky)
The Waldschmidt constant, II Abstract: We discuss the Waldschmidt constant of ideals that are generated by products of two distinct variables. Each such ideal corresponds to a graph. It turns out that the Waldschmidt constant of the ideal is equal to the fractional chromatic number of the graph. This leads to the new bounds and computations of the Waldschmidt constant. No prior knowledge of monomial ideals or graph theory is assumed. All concepts will be explained in the talk. |
Jan. 20, 2016 |
Uwe Nagel (University of Kentucky)
The Waldschmidt constant Abstract: A (projective) variety V is a set of common zeros of the polynomials in an ideal I that is generated by homogenous polynomials. Given the generators of the ideal I, one would like to know the minimum degree of a polynomial F such that each point of V is a root of f of a given multiplicity, say k. As this is often a difficult problem, one studies first the corresponding question for large k. This leads to the Waldschmidt constant, which gives an asymptotic answer to the problem. If I is an ideal that is generated by squarefree monomials, then the Waldschmidt constant can be expressed as the optimal solution to a linear program or as a fractional chromatic number. This leads to the new bounds and computations of the Waldschmidt constant. No prior knowledge of monomial ideals or graph theory is assumed. All concepts will be explained in the talk. |
Dec. 9, 2015 |
Bill Trok (University of Kentucky)
Regularity of Fat Points Abstract: Every point P in K^n, has an associated ideal I, which consists of the polynomials which vanish on it. Given P, we can define the fat point with weight m, as the ideal I^m. This ideal corresponds to polynomials which vanish on it, and whose m-1 partial derivatives vanish on it as well. The Hilbert function of intersections of these ideals is an interesting topic of study, as it has nice geometric meaning. I will discuss some results and conjectures about Hilbert functions of these ideals and there intersections, as well as discussing some work in progress in the area. |
Dec. 2, 2015 |
Luis Vieira (University of Kentucky)
Artin’s Conjecture for Diagonal Forms Abstract: One of Artin’s famous conjectures states that a homogeneous polynomial of the type $a_1x_1^d+\cdots+a_sx_s^d$ over a $p$-adic field $K$ has a nontrivial zero in $K^s$ provided $s>d^2$. The conjecture is known to be true over$\mathbb{Q}_p$ and recently now by collaborative work with David Leep for all unramified extensions of $\mathbb{Q}_p$ with $p>2$. We will talk about the history of Artin’s conjecture and explore some of the known results about Artin’s conjecture on local fields and other fields of interest. |
Nov. 11, 2015 |
Tefjol Pllaha (University of Kentucky)
Isometries of Codes Abstract: A code is endowed with the Hamming distance, which in turn determines its error-correcting capabilities. This suggests the study of isometries between codes. In 1961, MacWilliams with her famous Extension Theorem, classified Hamming isometries of linear codes over finite fields. This result was generalized for different weight functions, different alphabets and recently, for sublinear codes. We discuss the extension theorems for isometries of codes in their full generality and generalize some existing results. |
Nov. 4, 2015 |
Adam Chapman (Michigan State University)
The Word Problem for the Brauer Group Abstract: By the renowned Merkurjev-Suslin Theorem, the Brauer group of a field is generated by symbol algebras. This gives rise to the word problem - given two ``words" (i.e. tensor products of symbol algebras), one should like to determine whether they represent the same element in the group or not. One way to approach this problem is to come up with a way of producing all the equivalent words to one given word. We shall discuss the special case of quaternion algebras and present some new results. |
Oct. 28, 2015 |
Jenn Park (University of Michigan)
A heuristic for boundedness of elliptic curves Abstract: I will discuss a heuristic that predicts that the ranks of all but finitely many elliptic curves defined over Q are bounded above by 21. This is joint work with Bjorn Poonen, John Voight, and Melanie Matchett Wood. |
Oct. 22, 2015 |
Angie Cueto (Ohio State University)
Repairing tropical curves by means of tropical modifications Abstract: Tropical geometry is a piecewise-linear shadow of algebraic geometry that preserves important geometric invariants. Often, we can derive classical statements from these (easier) combinatorial objects. One general difficulty in this approach is that tropicalization strongly depends on the embedding of the algebraic variety. Thus, the task of finding a suitable embedding or of repairing a given "bad" embedding to obtain a nicer tropicalization that better reflects the geometry of the input object becomes essential for many applications. In this talk, I will show how to use linear tropical modifications and Berkovich skeleta to achieve such goal in the curve case. Our motivating examples will be plane elliptic cubics and genus two hyperelliptic curves. Based on joint work with Hannah Markwig (arXiv:1409.7430) and ongoing work in progress with Hannah Markwig and Ralph Morrison. |
Oct. 21, 2015 |
Dhruv Ranganathan (Yale University)
Motivic Hilbert Zeta Functions of Curves Abstract: The Grothendieck ring of varieties is a beautiful and intricate object which bears witness to an interplay between arithmetic, geometry, and topology. I will discuss in particular the behavior of Hilbert schemes of points on singular curves and the associated "motivic zeta function". After surveying work in this area, I will report on joint work in progress with Dori Bejleri and Ravi Vakil, in which we prove that the motivic Hilbert zeta function of an arbitrary curve is rational, in the spirit of the Weil conjectures. |
Oct. 14, 2015 |
Nathan Pflueger (Brown University)
Young tableaux and the geometry of algebraic curves Abstract: A classical computation of Castelnuovo in enumerative geometry (made rigorous in the 1980s) shows that, for certain choices of numerical invariants, the number of linear series on a general curve of genus g is equal to the number of standard Young tableaux on a certain rectangular partition. Later proofs show that this equality becomes a bijection when the algebraic curve degenerates in a particular way. I will discuss joint work with Melody Chan, Alberto Lopez, and Montserrat Teixidor i Bigas, in which we prove that in the case where the variety of linear series is 1-dimensional rather than a finite set of points, then the holomorphic Euler characteristic of this variety can be computed by an analogous enumeration of tableaux. Time permitting, I will explain how similar methods translate other aspects of the geometry of algebraic curves to enumeration of tableaux. |
Sep. 30, 2015 |
Neville Fogarty (University of Kentucky)
A Circulant Approach to Skew-Constacyclic Codes Abstract: We introduce a type of skew-generalized circulant matrices that captures the structure of a skew-polynomial ring F[x;theta] modulo the left ideal generated by a polynomial of the form x^n-a. This allows us to develop an approach to skewconstacyclic codes based on skew-generalized circulants. We show that for the code-relevant case, the transpose of a skew-generalized circulant is also a skew-generalized circulant. This recovers the well-known result that the dual of a skew-constacyclic code is also a skew-constacyclic code. |
Sep. 23, 2015 |
Anna Kazanova (University of Georgia)
Vector bundles on moduli space of stable curves with marked points Abstract: Conformal block vector bundles are vector bundles on the moduli space of stable curves with marked points defined using certain Lie theoretic data. Over smooth curves, these vector bundles can be identified with generalized theta functions. In this talk we discuss extension of this identification over the stable curves. This is joint work with P. Belkale and A. Gibney. |
Sep. 16, 2015 |
Theodoros Kyriopoulos (University of Kentucky)
The Fundamental Theorem of Commutative Algebra (FTOCA) Abstract: The Lecture is about the theorem of right invertibility of matrices over Commutative Rings (FTOCA) A proof of FTOCA in the context of linear systems and various applications of it (like the lemma of Nakayama and vanishing of the tensor product) are being presented in the lecture. |
Sep. 2, 2015 |
Eric Kaper (University of Kentucky)
Annihilators of Homogeneous Symmetric Polynomials Under the Action of Partial Differentiation Abstract: Let E ans S be polynomial rings of degree n over a field k and let S act on E by partial differentiation. Given a homogeneous symmetric polynomial f, what can we say about Ann(f)? For a general polynomial the annihilator turns out to be as 'small' as possible. We will discuss what 'small' means in this context and exhibit a specific polynomial that satisfies these conditions (based on work of M. Boij, J. Migliore, R. Miro-Roig, U. Nagel). |
Sep. 2, 2015 |
Dave Jensen (University of Kentucky)
Matroids in Algebra and Geometry Abstract: Matroids are combinatorial structures that generalize the notion of independence in linear algebra and graph theory. Rota conjectured that certain invariants of a matroid should always form a log concave sequence. We will report on recent work of Adripasato, Huh, and Katz, in which they use techniques from algebra and geometry to prove Rota's Conjecture. |
Apr. 29, 2015 |
Andrew Obus (University of Virginia)
The Oort conjecture and its generalizations Abstract: A common mathematical problem is to be given a mathematical object in characteristic p, and to ask whether it is the reduction, in some sense, of an analogous structure in characteristic zero. If so, the structure in characteristic zero is called a "lift" of the structure in characteristic p. We will consider a power series version of this problem, called the "local lifting problem." Given a characteristic p algebraically closed field k, and an action of a finite group G on k[[t]] by k-automorphisms, is there a DVR R in characteristic zero with residue field k such that the action of G lifts to R[[t]]? Oort conjectured that this is true when G is cyclic, and this conjecture was proven by the speaker, Stefan Wewers, and Florian Pop. We will discuss this conjecture and its generalizations. Examples will be given throughout. We remark that the motivation for studying the local lifting problem comes from understanding lifts of branched covers of curves from characteristic p to characteristic zero. |
Apr. 23, 2015 |
Lars Christensen (Texas Tech University)
Tate homology over associative rings Abstract: Tate homology and cohomology originated in the realm of group algebras and evolved through a series of generalizations to the setting of Iwanaga-Gorenstein rings. The cohomological theory has a more far-reaching generalization to the setting of associative rings; it is now called stable cohomology, and it agrees with Tate homology over Iwanaga-Gorenstein rings. |
Apr. 22, 2015 |
Bill Robinson (University of Kentucky) ; PhD defense
Tableau Ideals Abstract: We study a class of determinantal ideals called skew tableau ideals, which are generated by (t x t) minors in a subset of a symmetric matrix of indeterminates. The initial ideals have been studied in the (2 x 2) case by Corso, Nagel, Petrovic and Yuen. Using liaison techniques, we have extended their results to include the original determinantal ideals in the (2 x 2) case, and obtained some partial results in the (t x t) case. A critical tool we use is an elementary biliaison, and producing these requires some technical determinantal calculations. We have uncovered in error a previous determinantal lemma that was applied in several papers, and have used the straightening law for minors of a matrix to establish a new determinantal relation. This new tool is quite versatile; it fixes the gaps in the previous papers and provides the main computational power in several of our own arguments. This is joint work with Uwe Nagel. |
Apr. 21, 2015 |
Nicholas Armenoff (University of Kentucky); PhD defense
Free Resolutions Associated to Representable Matroids Abstract: As a matroid is naturally a simplicial complex, one can study its combinatorial properties via the associated Stanley-Reisner ideal and its corresponding free resolution. Using results by Johnsen and Verdure, we prove that a matroid is the dual to a perfect matroid design if and only if its corresponding Stanley-Reisner ideal has a pure free resolution, and, motivated by applications to their generalized Hamming weights, characterize free resolutions corresponding to the vector matroids of the parity check matrices of Reed-Solomon codes and certain BCH codes. Furthermore, using an inductive mapping cone argument, we construct a cellular resolution for the matroid duals to finite projective geometries and discuss consequences for finite affine geometries. Finally, we provide algorithms for computing such cellular resolutions explicitly. |
Apr. 17, 2015 |
Carolyn Troha (University of Kentucky); PhD defense
A Linkage Constructions for Subspace Codes Abstract: In this thesis defense, we will begin by giving an overview of random network coding and how subspace codes are used in this context. In this talk I will focus on the linkage construction, which builds a code by linking previously constructed codes. We will explore the properties of codes created by this construction. In particular, we will explore how to utilize the linkage construction to create partial spread codes. Finally we will look at cases in which linkage codes are efficiently decodable. |
Apr. 15, 2015 |
Florian Kohl (University of Kentucky)
Ehrhart from Hilbert Abstract: Many discrete problems in various mathematical areas arise from linear systems, thus they ask about integer points of polytopes in disguise. Ehrhart theory tries to develop tools to encode information about integer points of polytopes. One of the most important objects in Ehrhart theory is the so-called Ehrhart function. We will show that Ehrhart theory is closely related to commutative algebra. In particular, we will show how graded modules and the Hilbert function can be used to prove interesting results about the Ehrhart function of a lattice polytope. |
Apr. 8, 2015 |
Jeff Giansiracusa (Swansea University)
Semirings and schemes in tropical geometry Abstract: The tropicalization of a variety is usually considered as a polyhedral set inside Euclidean space, but people often think of it heuristically as an algebraic set defined over the idempotent semiring of real numbers with the (max,+) structure. I'll explain how to give this heuristic picture teeth: it turns out that the tropicalization trop(X) is actually the solution set to a system of (max,+) polynomial equations canonically associated with X. This leads to tropical Hilbert polynomials and several other interesting things. |
Apr. 1, 2015 |
Ivan Soprunov (Cleveland State University)
On zero dimensional complete intersections in the torus Abstract: Consider an n-variate system of n Laurent polynomials over an algebraically closed field K with prescribed Newton polytopes P_1, ..., P_n. If the coefficients of the system are generic, the solution set Z consists of isolated points in the torus (K^*)^n. ?We concentrate on the following two questions. Given a polytope P, let L(P) be the space of Laurent polynomials spanned by monomials corresponding to the lattice points in P. What is the dimension of the subspace of those h\in L(P) that vanish on Z? If h\in L(P) does not vanish identically on Z, what is the smallest number of points p in Z where h(p)\neq 0? These questions are related to the multigraded Hilbert function of ideals in the homogeneous coordinate ring of a toric variety and the Cayley-Bacharach theorem. Although we cannot answer these questions in full generality, we will see how much can be said in terms of geometry of the polytopes P_1, ..., P_n and P. Both questions have applications to algebraic coding theory. |
Mar. 25, 2015 |
Ralph Morrison (Berkeley)
Moduli of Tropical Plane Curves Abstract: Smooth curves in the tropical plane come from unimodular triangulations of lattice polygons. The skeleton of such a curve is a metric graph whose genus is the number of lattice points in the interior of the polygon. In this talk we report on work concerning the following realizability problem: Characterize all metric graphs that admit a planar representation as a smooth tropical curve. For instance, about 29.5 percent of metric graphs of genus 3 have this property. (Joint work with Sarah Brodsky, Michael Joswig, and Bernd Sturmfels.) |
Mar. 4, 2015 |
Luis Sordo Vieira (University of Kentucky)
A brief introduction to quadratic spaces |
Feb. 25, 2015 |
Liam Solus (University of Kentucky)
Connecting Two Problems with a Spectrahedron Abstract: Spectrahedra are natural generalizations of polyhedra that arise as parameterizations of slices of the cone of positive semidefinite matrices. To a graph G we can associate a spectrahedron known as an elliptope. We will use the elliptope to connect two well-studied problems via their underlying geometry. The first problem is the well-known max-cut problem from linear programming, the feasible region of which is the cut polytope of G. The second problem is the positive semidefinite matrix completion problem whose solution is characterized by extremal rays of the cone of concentration matrices for G. We will begin with a brief introduction to the geometry of positive semidefinite matrices and spectrahedra. Then we will define these two problems and their associated convex bodies. Finally, we will see that for some graphs the facets of the cut polytope correspond to extremal rays of the cone of concentration matrices, and that this correspondence is given by the elliptope and its dual. Moreover, we will see that the shape of the facet decides the rank of the corresponding extremal ray. |
Feb. 18, 2015 |
Carl Lee (University of Kentucky)
Stress and the Stanley-Reisner Ring, Part 2 Abstract: I will discuss some connections between classical stress on bar and joint frameworks, a generalization of stress to simplicial complexes, the Stanley-Reisner ring, and a consequent interpretation of the g-theorem for simplicial polytopes. |
Feb. 4, 2015 |
Alina Jacob (Georgia Southern University)
Gorenstein Projective Precovers Abstract: We consider a right coherent and left n-perfect ring R. We prove that the class of Gorenstein projective complexes is special precovering in the category of unbounded complexes, Ch(R). As a corollary, we show that the class of Gorenstein projective modules is special precovering over such a ring. This is joint work with Sergio Estrada and Sinem Odabasi. |
Dec. 10, 2014 |
Carl Lee (University of Kentucky)
Stress and the Stanley-Reisner Ring Abstract: I will discuss some connections between classical stress on bar and joint frameworks, a generalization of stress to simplicial complexes, the Stanley-Reisner ring, and a consequent interpretation of the g-theorem for simplicial polytopes. |
Dec. 3, 2014 |
Luis Sordo Vieira (University of Kentucky)
On Artin's Conjecture for diagonal forms Abstract: Emil Artin conjectured that any form of degree d in more than d^2 variables with coefficients in a p-adic field K has a nontrivial zero in K. Terjanian provided a counterexample to the conjecture, and many more have been found afterwards. However, in the case of diagonal forms, the result is known to hold for K=Q_p. The conjecture for diagonal forms over arbitrary p-adic fields remains unproved. We investigate partial results. |
Nov. 19, 2014 |
Sonja Petrovic (Illinois Institute of Technology)
Bouquet algebra of toric ideals Abstract: To any integer matrix A one can associate a toric ideal I_A, whose sets of generators are basic objects in discrete linear optimization, statistics, and graph/hypergraph sampling algorithms. The basic algebraic problem is that of implicitization: given the matrix A, find a set of generators with some given property (minimal, Groebner, Graver, etc.). Then there is a related problem of complexity: how complicated can these generators be? In general, it is known that Graver bases are much more complicated than minimal generators. But there are some classical families of toric ideals where these sets actually agree, providing very nice results on complexity and sharp degree bounds. This talk is about combinatorial signatures of generating sets of I_A. For the special case when A is a 0/1 matrix, bicolored hypergraphs give the answer. It turns out that such hypergraphs give an intuition for constructing basic building blocks for the general case too. Namely, we introduce the bouquet graph and bouquet ideal of the toric ideal I_A, whose structure determines the Graver basis. This, in turn, leads to a complete characterization of toric ideas for which the following sets are equal: the Graver basis, the universal Groebner basis, any reduced Groebner basis and any minimal generating set. This generalizes many of the classical examples. |
Nov. 12, 2014 |
Dustin Cartwright (University of Tennessee)
Crossing numbers for tropical curves Abstract: In tropical geometry, curves have both an intrinic side, as metric graphs and an embedded representation in terms of so-called balanced polyhedral complexes. I will discuss the relationship between these two representations. Since most curves can't be embedded in the plane, it is often useful to relax the embedding condition by allowing transverse crossings. A tropical crossing number for a metric graph is defined to be the fewest number of crossings in a planar immersion, and I will give some results on this crossing number. |
Nov. 5, 2014 |
Yoav Len (Yale University)
Tropical Plane Quartics Abstract: I will begin with a brief introduction to tropical geometry, and explain how algebraic curves give rise to tropical curves. I will then show that every tropical plane quartic admits 7 families of bitangent lines. This is analogous to the remarkable fact in classical geometry that a smooth plane quartic has exactly 28 bitangent lines. While the proof is purely combinatorial, I will discuss recent developments which suggest that the classical and tropical results are closely related. This is joint work with Matt Baker, Ralph Morrison, Nathan Pflueger, and Qingchun Ren. |
Oct. 29, 2014 |
Neville Fogarty (University of Kentucky)
Skew θ-Constacyclic Codes Abstract: We generalize cyclic codes to skew θ-constacyclic codes using skew polynomial rings. We provide a useful tool for exploring these codes: the circulant. In addition to presenting some properties of the circulant, we use it to re-examine a theorem giving the dual code of a skew θ-constacyclic code first presented by Boucher/Ulmer (2011). This talk includes work with Dr. Heide Gluesing-Luerssen. |
Oct. 15, 2014 |
Bill Robinson (University of Kentucky)
Introduction to Linkage Abstract: Liaison theory studies ideals by ``linking" them to nicer ideals that are well understood, and so gaining some interesting information about the original ideals. In this talk we will introduce some key ideas in liaison theory and apply them to the study of ideals generated by minors in a symmetric skew tableau. This will include some recent work with Uwe Nagel. |
Oct. 1, 2014 |
Luis Sordo Vieira (University of Kentucky)
A result by Davenport and Lewis on additive equations Abstract: We will present a result by Davenport and Lewis which states that an additive form with coefficients in Q_p of degree d in s>d^2 variables has a non-trivial p-adic solution. |
Sep. 17, 2014 |
Dave Jensen (University of Kentucky)
Chip-Firing and Tropical Independence II Abstract: We continue discussing the basic theory of divisors on graphs, with a primary focus on concrete examples. If time permits, we will describe how these tools are used to provide new proofs of some well-known theorems in algebraic geometry. |
Sep. 10, 2014 |
Dave Jensen (University of Kentucky)
Chip-Firing and Tropical Independence Abstract: We will discuss the basic theory of divisors on graphs, with a primary focus on concrete examples. If time permits, we will describe how these tools are used to provide new proofs of some well-known theorems in algebraic geometry. |
Sep. 3, 2014 |
Dave Jensen (University of Kentucky)
Classical and Tropical Brill-Noether Theory Abstract: Classical Brill-Noether theory studies the existence and behavior of maps from a given algebraic curve to projective space. Recent years have witnessed the development of combinatorial techniques for studying such questions. After briefly surveying some of the major results in classical Brill-Noether theory, we will explain how these and related problems can be reduced to problems about combinatorial properties of graphs. This talk should be accessible to a broad audience - we will assume no familiarity with algebraic geometry. |
April 23, 2014 |
Sema Gunturkun (University of Kentucky); PhD defense
Homogeneous Gorenstein Ideals and Boij Söderberg Decompositions Abstract: This talk consists of two parts. Part one revolves around a construction for homogeneous Gorenstein ideals and properties of these ideals. Part two focuses on the behavior of the Boij-Söderberg decomposition of lex ideals. Gorenstein ideals are known for their nice duality properties. For codimension two and three, the structures of Gorenstein ideals have been established by Hilbert-Burch and Buchsbaum-Eisenbud, respectively. However, although some important results have been found about Gorenstein ideals of higher codimension, there is no structure theorem proven for higher codimension cases. Kustin and Miller showed how to construct a Gorenstein ideals in local Gorenstein rings starting from smaller such ideals. We discuss a modification of their construction in the case of graded rings. In a Noetherian ring, for a given two homogeneous Gorenstein ideals, we construct another homogeneous Gorenstein ideal and so we describe the resulting ideal in terms of the initial homogeneous Gorenstein ideals. Gorenstein liaison theory plays a central role in this construction. For the second part, we talk about Boij- Söderberg theory which is a very recent theory. It arose from two conjectures given by Boij and Söderberg and their proof by Eisenbud and Schreyer. It establishes a unique decomposition for Betti diagram of graded modules over polynomial rings. We focus on Betti diagrams of lex ideals which are the ideals having the largest Betti numbers among the ideals with the same Hilbert function. We describe Boij-Söderberg decomposition of a lex ideal in terms of Boij-Söderberg decomposition of some related lex ideals. |
April 22, 2014 |
Casey Monday (University of Kentucky); PhD defense
A Characterization of Serre Classes of Reflexive Modules Over a Complete Local Noetherian Ring Abstract: Serre classes of modules over a ring R are important because they describe relationships between certain classes of modules and sets of ideals of R. In this talk we characterize the Serre classes of three different types of modules. First we characterize all Serre classes of noetherian modules over a commutative noetherian ring. By relating noetherian modules to artinian modules via Matlis duality, we characterize the Serre classes of artinian modules. When R is complete local and noetherian, define E as the injective envelope of the residue field of R. Then denote M^\nu=Hom_R(M,E) as the dual of M. A module M is reflexive if the natural evaluation map from M to M^{\nu\nu} is an isomorphism. The main result provides a characterization of the Serre classes of reflexive modules over such a ring. This characterization depends on an ability to ``construct'' reflexive modules from noetherian modules and artinian modules. We find that Serre classes of reflexive modules over a complete local noetherian ring are in one-to-one correspondence with pairs of collections of prime ideals which are closed under specialization. |
April 17, 2014 |
Furuzan Ozbek (University of Kentucky); PhD defense
Subfunctors of Extension Functors Abstract: In this talk we examine subfunctors of Ext relative to covering (enveloping) classes and the theory of covering (enevloping) ideals. The notion of covers and envelopes by modules was introduced independently by Auslander-Smalo and Enochs and has proven to be beneficial for module theory as well as for representation theory. First we will focus on subfunctors of Ext and their properties. We show how the class of precoverings give us subfunctors of Ext. Later, we investigate the sunfunctor of Hom called ideals. The definition of cover and envelope carry over to the ideals naturally. Classical conditions for existence theorems for covers led to similar approaches in the ideal case. Even though some theorems such as Salce's Lemma were proven to extend to ideals, most of the theorems do not directly apply to the new case. We show how Eklof-Trlifaj's result can partially be extended to the ideals generated by a set. Moreover by relating the existence theorems for covering ideals of morphisms by identifying the morphisms with objects in A_2 we obtain a sufficient condition for the existence of covering ideals in a more general setting and finish with applying this result to the class of phantom morphisms. |
April 17, 2014 |
Neville Fogarty (University of Kentucky)
Duals of Skew θ-Constacyclic Codes Abstract: We generalize cyclic codes to skew θ-constacyclic codes using skew polynomial rings. We provide a useful tool for exploring these codes: the circulant. In addition to presenting some properties of the circulant, we use it to re-examine a theorem giving the dual code of a θ-constacyclic code first presented by Boucher/Ulmer (2011). |
April 15, 2014 |
Ray Kremer (University of Kentucky); PhD defense
Homological Algebra with Filtered Modules Abstract: Classical homological algebra begins with the study of projective and injective modules. In this talk I will discuss analogous notions of projectivity and injectivity in a category of filtered modules. In particular, projective and injective objects with respect to the restricted class of strict morphisms are defined and characterized. Additionally, an analogue to the injective envelope is discussed with examples showing how this differs from the usual notion of an injective envelope. |
March 26, 2014 |
Alexandra Seceleanu (University of Nebraska)
Constructing ideals with large projective dimension Abstract: Projective dimension is a homological measure of the complexity of algebraic objects. Motivated by computational considerations, M. Stillman asked for upper bounds on the projective dimension of homogeneous ideals in polynomial rings, based solely on invariants of the ideal, not of the ambient ring. In this talk, we discuss several constructions that shed some light on what ideal invariants can or cannot be used to bound projective dimension and we give lower bounds on any possible answer to Stillman's question. The talks is based on joint work with Huneke-Mantero-McCullough and Beder-McCullough-Nunez-Snapp-Stone. |
March 13, 2014 |
Stephen Sturgeon (University of Kentucky); PhD defense
Polar Self-Dual Polytopes and the n-gon Abstract: Given a monomial ideal we can sometimes interpret its free resolution as arising from a labeled cell complex. We seek to explore this connection in the case of some Gorenstein rings. The symmetry in Gorenstein rings can sometimes be modeled by polar self-dual polytopes. We will establish some basic theory concerning polar self-dual polytopes and discuss some motivating questions. In particular we construct the family of Ferrers polytopes and show that, given a proper labeling, they support a minimal free resolution of the Stanley-Reisner ring of the n-gon. Although applied in a particular case we will see that the techniques used are quite general and lead us to hope for results in greater generality. |
January 22, 2014 |
Adam Boocher (University of California at Berkeley)
Closures of a Linear Space Abstract: Let L be an affine linear space. Once we fix coordinates, it makes sense to discuss the closure of L inside a product of projective lines. In this talk I'll present joint work with Federico Ardila concerning the defining ideal of the closure. It turns out that the combinatorics of this ideal are completely determined by a matroid associated to L and we are able to explicitly compute its degree, universal Gr"obner basis, Betti numbers, and initial ideals. I'll include several examples along the way and discuss how this closure operation comes up naturally when one searches for ideals with "nice" behavior upon degeneration. |
January 15, 2014 |
Mohanad Farhan Hamid Al Saidi (University of Kentucky, visiting from University of Mustansiriyah, Bagdad)
Classes of modules relative to torsion theories Abstract: Our purpose is extend known results of some classes of modules to torsion theoretic setting in a way so that the former results are recovered when some torsion theory is chosen. For example we generalize the concept of relative pure injectivity to relative pure \tau-injectivity, where \tau is a given hereditary torsion theory. If \tau is the improper torsion theory then relative pure injectivity and relative pure \tau-injectivity are equivalent. This new concept retains some of the important properties of pure injectives. For instance, we show that the class of pure \tau-injective modules is enveloping. |
November 20, 2013 |
Liam Solus (University of Kentucky)
The Hilbert Series of Algebras of the Veronese Type Abstract: Algebras of the Veronese type are semigroup algebras that have attracted considerable attention from the algebra and algebraic combinatorics communities. In 1996, Sturmfels described Groebner bases for presentations of these algebras, and in 1997 De Negri and Hibi classified those that are Gorenstein. In his 2005 paper "The Hilbert Series of Algebras of the Veronese Type," Mordechai Katzman added to these results by providing an explicit formula for the Hilbert series of these algebras. In this talk, we will describe Katzman's formula and its connections to the combinatorics of a family of polytopes known as hypersimplices. |
November 20, 2013 |
Luis Sordo Viera (University of Kentucky)
Artin's Conjecture on homogeneous forms over Q_p Abstract: A field k is called a C_i field if any homogeneous form of degree i in more than d^i variables has a nontrivial zero in k. It is well known that finite fields are C_1. What about the p-adics? It was conjectured by Emil Artin that Q_p is C_2. The result turned out to be false. We will investigate some positive results. |
November 13, 2013 |
Katherine Morrison (University of Northern Colorado)
Enumerating Equivalence Classes of Rank-Metric and Matrix Codes Abstract: Due to their applications in network coding, public-key cryptography, and space-time coding, both rank-metric codes and matrix codes, also known as array codes and space-time codes over finite fields, have garnered significant attention. We focus on characterizing rank-metric and matrix codes that are both efficient, i.e. have high dimension, and effective at error correction, i.e. have high minimum distance. A number of researchers have contributed to the foundation of duality theory for rank-metric and matrix codes, which has demonstrated that the inherent trade-off between dimension and minimum distance for a code is reversed for its dual code; specifically, if a code has high dimension and low minimum distance, then its dual code will have low dimension and high minimum distance. Thus, with an aim towards finding codes with a perfectly balanced trade-off, we study self-dual matrix codes. In particular, we enumerate the equivalence classes of self-dual matrix codes of short lengths over small finite fields. To perform this classification, we also examine the notion of equivalence for rank-metric and matrix codes and use this to characterize the automorphism groups of these codes. |
November 6, 2013 |
Uwe Nagel (University of Kentucky)
Non-negative polynomials and Gorenstein ideals Abstract: A homogenous polynomial of degree d in n variables is called non-negative if it is at least zero when evaluated at any point with real coordinates. The cone of such non-negative polynomials contains the cone of the homogeneous polynomials that are sums of squares. Hilbert characterized the pairs (n,d) such that the two cones are the same. Recently, Blekherman strengthened Hilbert's results by describing the extremal rays of the cone that is dual to the cone of non-negative polynomials. These rays correspond to certain extremal Gorenstein ideals. We will discuss these results. |
October 30, 2013 |
Mohanad Farhan Hamid Al Saidi (University of Kentucky, visiting from University of Mustansiriyah, Bagdad)
(Flat) modules that are fully invariant in their pure-injective (cotorsion) envelopes Abstract: We introduce two concepts. A module M is said to be purely quasi-injective (resp. quasi-cotorsion) if it is fully invariant in its pure-injective envelope (resp. if it is flat and fully invariant in its cotorsion envelope). Endomorphism rings of both of the above types of modules are proved to be regular and self injective modulo their Jacobson radicals. If M is a purely quasiinjective (resp. quasi-cotorsion) module, then so is any finite direct sum of copies of M. Each of the above concepts is stronger than the well-known concept of quasi-pure-injectivity, but not equivalent. This solves, negatively, a problem of Mao and Ding's of whether every flat quasi pure-injective module is fully invariant in its cotorsion envelope. Certain types of rings are characterized in terms of purely quasi-injective modules. For example, a ring R is regular if and only if every purely quasiinjective R-module is quasi-injective, and is pure-semisimple if and only if every R-module is purely quasi-injective. |
October 16 & 23, 2013 |
Heide Gluesing-Luerssen (University of Kentucky)
Codes over Frobenius rings and an extension theorem Abstract: An important result in algebraic coding theory tells us that every Hamming weight-preserving isomorphism between subspaces in F^n, where F is a finite field, extends to a Hamming weight-preserving isomorphism on the entire F^n. This has led to a variety of generalizations, namely to submodules over certain rings and/or different weight functions. In this talk, I will discuss the extension theorem for Frobenius rings and poset weights. Both notions, Frobenius rings and poset weights, will be introduced. |
October 9, 2013 |
Akihiro Higashitani (Osaka University)
Integer decomposition property of dilated polytopes Abstract: We say that P has the integer decomposition property (IDP, for short) if any integer point in mP can be written as the sum of m integer points in P, where m is an arbitrary positive integer. In this talk, we discuss the problem when an integral convex polytope without IDP has IDP by integral dilation. |
October 2, 2013 |
Augustine O'Keefe (University of Kentucky)
An algebraic study of Cameron-Walker graphs Abstract: Given a finite simple graph G, two commonly studied invariants in graph theory are the matching number, m(G), and the induced matching number of a graph, i(G). These combinatorial invariants provide upper and lower bounds, respectively, for the (Castelnuovo-Mumford) regularity of the quotient of the edge ideal associated to the graph, R/I(G). Cameron and Walker characterize all graphs where the matching number is the same as the induced matching number and therefore the regularity can be explicitly calculated. In this talk we will examine other algebraic and combinatorial properties of R/I(G) where G satisfies m(G)=i(G), such as Cohen-Macaulayness, shellability, and vertex decomposability. |
September 25, 2013 |
Furuzan Ozbek (University of Kentucky)
A sufficient condition for covering ideals Abstract: The concepts of envelope and cover were introduced independently by Enochs and Auslander-Smalo for classes of modules. Since then the definition has been applied to different classes of categories. One of the recent application was introduced by Asensio, Herzog, Fu and Torrecillas where the theory of covers and envelopes is extended to ideals. In this talk, we will show how identifying an ideal I with a certain class of objects in the quiver A_2 can help us to obtain sufficient conditions for I to be a covering ideal. |
September 25, 2013 |
Bill Robinson (University of Kentucky)
On a Class of Determinantal Ideals Abstract: We will discuss a class of ideals determined by taking minors in a subregion of a matrix of indeterminates, called a skew tableau, and also in a reflected version of this considered as a subregion of a symmetric matrix. We will use liaison-theoretic tools to investigate properties of these ideals, and study their liaison classification. |
September 18, 2013 |
Sema Gunturkun (University of Kentucky)
A Construction of Homogeneous Gorenstein Ideals Abstract: A way of constructing Gorenstein ideals from small Gorenstein ideals in local Gorenstein rings is shown by A. Kustin and M. Miller in 1983. In this talk, we show a variant of their construction for graded case and avoid the ring extension. We see that how the liaison theory helps us immensely to modify their construction. |
September 18, 2013 |
Carolyn Troha (University of Kentucky)
Irreducible Cyclic Orbit Codes Abstract: After subspace codes were introduced in 2008 by Koetter and Kschischang most constructions involved the lifting of matrix codes. However, Rosenthal et al. introduced in 2011 a new method of constructing constant dimension subspace codes by using a group action of GL_n(F_q) on the projective geometry PG(q,n), called orbit codes. A specific subset of these codes, which have been studied more in depth, are irreducible cyclic orbit codes. In this talk, I will introduce the construction of an irreducible cyclic orbit code as well as explore a method to find the cardinality and distance of such a code. |
September 4, 2013 |
Stephen Sturgeon (University of Kentucky)
Cellular Resolutions of the Cyclic Polytopes Abstract: Cellular resolutions have been an area of active interest in the study of monomial ideals in the past few years. A cellular resolution is a way of encoding the information of the free resolution of an ideal in a cell complex. We will study the Stanley-Reisner rings arising from the simplicial polytopes known as the cyclic polytopes. These polytopes have the interesting property that they maximize all entries in the f-vector of the set of polytopes with fixed dimension and vertices. I will explain a little of the background theory and then cover the main idea of the construction. |
April 10, 2013 |
Jonathan Constable (University of Kentucky)
The Class Number and Binary Quadratic Forms Abstract: Let F be a positive definite binary quadratic form. One may classify such forms with fixed discriminant Δ, up to equivalence in GL2(Z) or refine this further to proper equivalence in SL2(Z). These are classical results developed by Lagrange and Gauss and lead to well-known statements about the class number h(Δ). In his paper “Über Bilineare Formen Mit Vier Variabeln”, Kronecker introduces the finer notion of complete equivalence, which is used to study the class number of positive definite forms with integer coefficients of the type ax^2+2bxy+cy^2. In this talk we will discuss Kronecker’s development of the class number via complete equivalence and compare it with the classical results of Lagrange and Gauss. |
March 27, 2013 |
Jing Xi (University of Kentucky)
Sequential importance sampling Abstract: Sequential importance sampling (SIS) is a procedure which can be used to sample contingency tables with constraints. It proceeds by simply sampling cell entries of the contingency table sequentially and terminate at the last cell such that the final distribution is approximately uniform. I will first introduce this procedure in both statistical and polyhedral geometry view, and explain its advantages and problems. Then I will introduce the SIS procedure via conditional Poisson (CP) distribution which is used to sample zero-one contingency tables with fixed marginal sums. In this case, the procedure proceeds by sampling one column after another sequentially and terminate at the last column. I will explain both two-way and multi-way cases, and also why it performs better than the general SIS procedure when we have zero-one constraints. |
March 22, 2013 |
Anton Dochtermann (University of Miami)
Laplacian ideals, arrangements, and resolutions Abstract: The classical Laplacian matrix of a graph G describes the combinatorial dynamics of the Abelian Sandpile Model and the more general Riemann-Roch theory of G. The lattice ideal associated to the Laplacian provides a more recently considered algebraic perspective on this (re)emerging field. The Laplacian ideal has a distinguished monomial initial ideal that has also been studied in connection with G-parking functions. We study homological properties and show that a minimal free resolution of the initial ideal is supported on the bounded subcomplex of a section of the graphical arrangement of G. As a corollary we obtain a combinatorial characterization of the Betti numbers in terms of acyclic orientations. This generalizes constructions from Postnikov and Shaprio (for the case of the complete graph) and connects to work of Manjunath and Sturmfels, and Perkinson on the commutative algebra of Sandpiles. This is joint work with Raman Sanyal. |
March 20, 2013 |
Jaimal Thind (University of Toronto)
Quantum McKay Correspondence and Equivariant Sheaves on the Quantum Projective Line Abstract: The McKay correspondence gives a bijection between finite subgroups of SU(2) and affine A,D,E Dynkin diagrams. There is a quantum version of this statement (due to Kirillov Jr and Ostrik) which relates "finite subgroups" of quantum sl(2) and finite A,D,E Dynkin diagrams. We use this correspondence to construct the category of "equivariant" coherent sheaves on the quantum projective line. This is done by defining analogues of the symmetric algebra and the structure sheaf, and using them to define a triangulated category which is a natural analogue of the derived category of equivariant sheaves on the projective line. We then produce natural objects in this triangulated category, and relate our category to the derived category of representations of the corresponding A,D,E quiver. This can be thought of as a quantum analogue of the projective McKay correspondence of Kirillov Jr. We will first review the classical constructions, then discuss the "quantum" analogues. |
Feb. 27 & March 6, 2013 |
Uwe Nagel (University of Kentucky)
The Macaulay-Matlis duality Abstract: The Macaulay-Matlis duality is the basis for many duality results in algebra and geometry. It takes a very specific form for ideals in a polynomial ring by interpreting polynomials as differential operators. It will be discussed how it can be used to produce irreducible decompositions and to derive certain symmetry properties of irreducible ideals aka Gorenstein ideals. All concepts will be explained in the talk. |
Feb. 20, 2013 |
Stephen Sturgeon (University of Kentucky)
Cellular Resolutions of the n-gon Abstract: A cellular resolution is a way of representing the free resolution of a monomial ideal by associating it with a cell complex. In this talk we will discuss a cellular resolution of the Stanley-Reisner ring of the n-gon. This is an interesting example because this ring is Gorenstein (symmetric betti table) and the cellular resolution is a self-dual polytope (symmetric f-vector). The talk will focus on the primary ideas used in the construction of the polytope. |
November 28, 2012 |
Bill Robinson (University of Kentucky)
Liaison Theory and Determinantal Ideals Abstract: The central objects of study in classical algebraic geometry are varieties. Liaison theory is a classification theory of varieties and their defining ideals. This talk will introduce some ideas and results from liaison theory, with a focus on the algebraic side of the story. We will also present the proof of a theorem of Elisa Gorla about the liaison class of ladder determinantal varieties. |
November 7 & 14, 2012 |
Heide Gluesing-Luerssen (University of Kentucky)
About Various MacWilliams Identities for Codes over Finite Commutative Rings Abstract: MacWilliams identities play a prominent role in algebraic coding theory because they tell how certain information about a code, encoded in enumerators, can be used to deduce information about the dual code. We will provide a unified approach to MacWilliams identities for various weight enumerators of linear block codes over Frobenius rings. Such enumerators count the number of codewords having a pre-specified property, and MacWilliams identities yield a transformation between such an enumerator and the corresponding enumerator of the dual code. All identities can be derived from a MacWilliams identity for the full weight enumerator using the concept of an F-partition, as introduced by Zinoviev and Ericson (1996). |
October 31, 2012 |
Nicholas Armenoff (University of Kentucky)
Linear Codes and Commutative Algebra Abstract: One goal of algebraic coding theory is to find linear error-correcting codes with maximum error-correcting capacity. Correlated to the error-correcting capacity of a code C are the generalized Hamming weights of C. Thus, using Hochster's formula and techniques of commutative algebra, we will derive the generalized Hamming weights for one class of BCH codes and partially extend these results to special cases of another class of BCH codes. |
October 10 & 24, 2012 |
Alberto Corso (University of Kentucky)
Integrality of quasi socle ideals Abstract: Given an ideal I of a local ring (R,m) we are interested in determining when the socle I:m, and in more generality the quasi socle ideals I:m^s where s is a positive integer, is integral over the ideal I. In the first part of the talk we will review what integrality of ideals means and what is known about the problem in the special cases when I is a complete intersection, height two perfect, Gorenstein ideal. The focus will be in looking for an explicit way to determine the generators of these quasi-socle ideals in terms of a presentation matrix of the ideal and in a characteristic free fashion. Time permitting, I will describe some of the new result obtained in an ongoing work joint with Shiro Goto, Craig Huneke, Claudia Polini and Bernd Ulrich. |
September 26 and October 3, 2012 |
Augustine O'Keefe (University of Kentucky)
Toric models in Algebraic Statistics Abstract: Algebraic Statistics is a relatively new field in mathematics that aims to use algebraic geometry, commutative algebra and combinatorics to solve statistical problems. This talk will focus on the use of toric ideals - which can be thought of as being generated by homogeneous binomials - in the study of statistical models. No expertise in statistics is required as we will define what we need as we go. There will be many examples, mostly involving conditional independence, graphical and ranking models. |
April 25, 2012 |
Augustine O'Keefe (Tulane University)
Characterizing graphs admitting Cohen-Macaulay toric rings Abstract: Given a finite discrete graph G=(V,E) one can construct a toric ring, denoted K[G], via a monomial map from a polynomial ring over the edge set to a polynomial ring over the vertex set. Hibi and Ohsugi (1999) showed that generators of the defining ideal of this ring, I_G, arise from binomials associated to even closed walks in the graph G. Because of this association we are hopeful that we can also characterize invariants of K[G] via the combinatorial structure of the graph. In particular, we are interested when a graph G admits a Cohen-Macaulay toric ring K[G]. |
April 13, 2012 |
Elizabeth Weaver (University of Kentucky); PhD defense
Minimality and Duality of Tail-biting Trellises for Linear Codes Abstract: Codes can be represented by edge-labeled directed graphs called trellises, which are used in decoding with the Viterbi algorithm. We will first examine the well-known product construction for trellises and present an algorithm for recovering the factors of a given trellis. To maximize efficiency, trellises that are minimal in a certain sense are desired. It was shown by Koetter and Vardy that one can produce all minimal tail-biting trellises for a code by looking at a special set of generators for a code. These generators along with a set of spans comprise what is called a characteristic pair, and we will discuss how to determine the number of these pairs for a given code. Finally, we will look at trellis dualization, in which a trellis for a code is used to produce a trellis representing the dual code. The first method we discuss comes naturally with the known BCJR construction. The second, introduced by Forney, is a very general procedure that works for many different types of graphs and is based on dualizing the edge set in a natural way. We call this construction the local dual, and we show the necessary conditions needed for these two different procedures to result in the same dual trellis. |
April 12, 2012 |
Dennis Moore (University of Kentucky); PhD defense
Hilbert polynomials and strongly stable ideals Abstract: Strongly stable ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers among saturated ideals with a given Hilbert polynomial, three algorithms are presented. Each of these algorithms produces all strongly stable ideals with some prescribed property: the saturated strongly stable ideals with a given Hilbert polynomial, the almost lexsegment ideals with a given Hilbert polynomial, and the saturated strongly stable ideals with a given Hilbert function. Bounds for the complexity of our algorithms are included. Also included are some applications for these algorithms and some estimates for counting strongly stable ideals with a fixed Hilbert polynomial. |
April 10, 2012 |
Aleams Barra (University of Kentucky); PhD defense
Equivalence Theorems and the Local-Global Property Abstract: In this thesis we revisit some classical results about MacWilliams equivalence theorems for codes over fields and rings. These theorems deal with the question whether, for a given weight function, weight preserving isomorphisms between codes can be described explicitly. We will show that a condition, which was already known to be sufficient for the MacWilliams equivalence theorem, is also necessary. Furthermore we will study local-global extensions that naturally generalize the MacWilliams equivalence theorems. Making use of the Fourier-transform and F-partitions we will prove that for various subgroups of the group of invertible matrices the local-global extension principle is valid. |
April 5, 2012 |
David Cook II (University of Kentucky); PhD defense
The Lefschetz properties in positive characteristic Abstract: The Lefschetz properties are algebraic properties that artinian standard graded algebras may enjoy. They are present if certain multiplication maps induce linear maps of maximal rank between the appropriate degree components of the algebra. While the majority of research on the Lefschetz properties has focused on characteristic zero, I consider the presence of the properties in positive characteristic. In particular, I study the Lefschetz properties by considering the prime divisors of determinants of critical maps. In both cases presented, the determinants are seen to be enumerations of combinatorial significance. |
October 13, 2011 |
David Conti (University College Dublin)
Matrix representations of trellises and enumerating trellis pseudocodewords Abstract: The performance of powerful decoding algorithms derived from special graph representations of codes is linked to so-called pseudocodewords and pseudoweights. Trellises are amongst the most notable of such graph representations of codes, for both theoretical and decoding purposes. In this talk, after giving a basic introduction, we will discuss some facets of the problem of enumerating trellis pseudocodewords and their pseudoweights. We will approach this problem by considering a natural matrix representation of trellises. |
September 20, 2011 |
Uwe Nagel (University of Kentucky)
Criteria for componentwise linearity Abstract: Stable monomial ideals are defined by a combinatorial property. They arise surprisingly often in various constructions in algebra and combinatorics. In 1999 Herzog and Hibi proposed the concept of componentwise linear ideals. Since then it turned out that componentwise linear ideals may be viewed as the polynomial ideals that are analogous to the stable ideals among the monomial ideals. This is partially due to a criterion for componentwise linear ideals by Aramonva, Herzog, and Hibi that applies over fields of characteristic zero. In the talk we introduce these concepts and results, and we discuss an extension of the mentioned criterion that is independent of the characteristic of the base field. The latter is joint work with Tim Roemer. |
April 18, 2011 |
Laura Steil (University of Kentucky); PhD defense
Isometry Classes of Quadratic Forms defined over p-adic Rings Abstract: Let f be a quadratic form defined over Z_p, the ring of p-adic integers with p a prime number. Define N_i(f) to be the number of solutions of the congruence f\equiv0\mod p^i. When p is not 2 we derive a formula for N_i(f) for i greater than 1 based on the known formula for N_1(f). This formula then gives a sequence (N_i(f))_{i=1}^{\infty} for the quadratic form f. We then find when the dimension of f and the sequence (N_i(f))_{i=1}^{\infty} determine the isometry class of f. When p is not 2, we show that the Jordan splitting gives information to determine exactly in which cases the isometry class is thus determined. We also demonstrate a case in which two non-isometric forms give the same sequence (N_i(f))_{i=1}^{\infty}. When p=2 and if the form f is regular when reduced mod 2 we can extend most of these results to forms defined over Z_2. |
April 11, 2011 |
Jinjia Li (University of Louisville)
Asymptotic behavior of socle under Frobenius iterations Abstract: Let (R,m) be a standard-graded local algebra over a field of positive characteristic p. Suppose I is an m-primary ideal of R. We study how the top socle degree and the socle length of R/J behave asymptotically, where J is a (varying) Frobenius power of I. We will also discuss their relations with Hilbert-Kunz multiplicity/function and asymptotic behaviors (with respect to Frobenius iteration) of some other homological invariants. |
March 21, 2011 |
Elizabeth Weaver (University of Kentucky)
Counting and Dualizing Characteristic Pairs Abstract: Trellis representations for linear block codes are widely used in decoding algorithms. To maximize efficiency, trellises that are minimal in a certain sense are desired. It was shown by Koetter and Vardy that one can produce all minimal tail-biting trellises for a code by looking at a special set of generators contained in characteristic pairs for a code. We will discuss how to determine the number of these pairs for a given code and examine a process for dualizing these pairs to produce pairs for the dual code. |
March 10, 2011 |
David Conti (University College Dublin, Ireland)
Codes on graphs, pseudocodewords, and pseudoweights Abstract: Algebraic codes are mathematical objects designed to reliably transmit data under presence of noise. A prominent approach in modern coding theory focuses on efficient iterative decoding algorithms based on graphical representations of codes. Therein it has been shown that decoding failure is determined by so-called pseudocodewords (particularly those with small pseudoweight) arising from the graph representation. In this talk we take a mathematical stroll on this topic, introducing the main questions along with a motivating conjecture on the Golay code. We will focus on the two paramount cases of Tanner Graph and Tail-Biting Trellis representations, and we will show in particular how an algebraic formalization can be developed for the latter. We will hint as well at how invariant theory and semi-algebraic geometry can play a role. |
March 7, 2011 |
Heide Gluesing-Luerssen (University of Kentucky)
Tail-biting trellises for linear block codes Abstract: Graphical models for linear block codes have proven to be a powerful tool for decoding. The most common of these models are trellises. These are graphs where the vertices are layered along a (potentially circular) time axis, and edges may only connect vertices at consecutive times. We will show how to construct minimal trellises for a given code. Thereafter, we will address the question of how to dualize a trellis in order to obtain a trellis for the dual code. |
February 28, 2011 |
Ines B. Henriques (University of California at Riverside)
Ascent and descent modulo exact zero divisor Abstract: An element a in a commutative ring R is said to be an exact zero divisor if it satisfies that R/a R is non-trivial, proper and isomorphic to (0 :_R a). It will be proved that homological and structural properties pass both ways between R and R/aR. This is a joint work with Luchezar Avramov and Liana Sega. |
February 21, 2011 |
David Leep (University of Kentucky)
Sums of squares in quadratic number rings Abstract: Studying number theory in quadratic extensions of the rational numbers has a long history. Many of the famous questions and theorems concerning sums of squares in the integers can be posed and often solved in the integers of a quadratic number field. This talk will deal with the problem of identifying which integers in a quadratic number field can be written as a sum of squares of integers. A necessary condition for such a representation is that the integer be totally positive. The condition is not sufficient however and several criteria are developed to guarantee a representation as a sum of squares. The results are based on theorems of I. Niven, C. Siegel from the 1940's, and R. Scharlau from 1980. |
February 14, 2011 |
David Cook II (University of Kentucky)
Stability of the syzygy module of a monomial ideal Abstract: Stability and semi-stability are desirable properties which a vector bundle may enjoy. In this talk we will explore the stability and semi-stability of the first syzygy module of a monomial ideal. In particular, we will see Brenner's combinatorial criterion and related results. |
February 7, 2011 |
Stephen Sturgeon (University of Kentucky)
Cellular resolutions Abstract: The free resolution of an ideal is a way of deriving information about an ideal. For some ideals we can find certain geometric objects that store the information for the free resolution of an ideal (i.e. Cellular Resolutions). I will cover these basic definitions and explain a cellular resolution of the class of Ferrers ideals. With this basis I will explain a method for obtaining a cellular resolution for the edge ideal of the complement of the n-gon which is a recent result by Bierman. |
January 31, 2011 |
Uwe Nagel (University of Kentucky)
Hyperplane sections and the Socle Lemma Abstract: It is a natural and classical idea to study a geometric object by slicing it with a (general) hyperplane and then trying to infer properties of the original object from properties of the slice. In 1993 Huneke and Ulrich found a new technique for using this approach. It is based on a linear algebra result. We will discuss Huneke's and Ulrich's ideas. |
December 13, 2010 |
Laura Steil and Elizabeth Weaver (University of Kentucky)
Points in Uniform Position and Maximum Distance Separable Codes Abstract: We will be looking at evaluation codes in projective space as defined in a paper by Johan P. Hansen. We will examine the relationship between the parameters of the code and the Hilbert function. Further, we will consider how the geometric position of the scheme affects the distance of the resulting code. |
November 15, 2010 |
Enrico Carlini (Politecnico di Torino, Italy)
Non-negative rank of matrices Abstract: Given a matrix P, its rank has many interesting interpretations. Among these, we know that P can be written as the sum of rk(P) matrices of rank one and no fewer. If P is a non-negative matrix, we can consider the non-negative rank of P, namely rk+(P). The non-negative rank measures the number of non-negative rank one matrices we need to write P as a non-negative linear combination of them. The non-negative rank is of particular interest to statisticians and to people working in optimization theory. But there is no good way to compute rk+(P). Clearly rk+(P)>=rk(P), but how big can the non-negative rank be? How is the non-negative rank affected by perturbation of P? In this talk, we will try to address these questions and many other issues about the non-negative rank. In particular, we will introduce a graphical approach to try and get some insight on rk+(P). The graphical approach can be found in a paper by Chu and Moody. The original results of this talk are obtained in collaboration with Bocci and Rapallo. |
November 8, 2010 |
David W. Cook II (University of Kentucky)
Punctured hexagons and almost complete intersections Abstract: We establish a connection between Artinian monomial almost complete intersections in three variables and hexagons with triangular punctures. It turns out that the prime factors of the number of certain tilings of the punctured hexagon are exactly the field characteristics in which the algebra fails to have the weak Lefschetz property. We use this to prove several new cases, with combinatorial explanations, of a conjecture by Migliore, Miró-Roig, and Nagel pertaining to characteristic zero. |
October 18, 2010 |
Ed Enochs (University of Kentucky)
Variations of the Euclidean Algorithm Abstract: Given an Euclidean domain, we have the associated division algorithm and Euclidean algorithm. The integer matrix version of the Euclidean algorithm is called Smith's theorem. Smith's theorem gives a quick proof of the fundamental theorem of abelian groups. The polynomial matrix version of Smith's theorem gives the Jordan canonical forms for matrices. We will prove a version of Smith's theorem for matrices with Laurent polynomials as entries that implies Grothendieck's theorem about locally free coherent sheaves on the projective line. Then we will indicate a relation with sheaves on Grassmannian varieties of the form G(n,2n). |
October 11, 2010 |
Manoj Kumini (Purdue University)
Dependence of Betti tables on characteristic Abstract: We will look at some examples of monomial ideals whose Betti tables depend on the characteristic of the base field. We will prove that if an ideal has componentwise linear resolution in all characteristics, then its Betti table is independent of the characteristic. This is joint work with K. Dalili. |
October 4, 2010 |
Ben Nill (University of Georgia)
Cellular resolutions of ideals defined by simplicial homomorphisms Abstract: In this talk I will give a survey on Gorenstein polytopes. These are lattice polytopes that exhibit a natural duality. They can also be characterized purely algebraically or via Ehrhart theory. I will start by introducing a big class of important examples: reflexive polytopes - and possibly some new generalizations. The arguably most-studied Gorenstein polytope is the Birkhoff polytope: the polytope of doubly stochastic matrices. I will give a brief view on how a long-standing conjecture by Stanley on the unimodality of its so-called h*-polynomial has been proved by Athanasiadis and generalized to Gorenstein polytopes by Bruns and Roemer. Finally, I would like to talk about recent results and open questions on Gorenstein polytopes as combinatorial models of topologically mirror-symmetric Calabi-Yau manifolds. |
September 27, 2010 |
Ben Braun (University of Kentucky)
Cellular resolutions of ideals defined by simplicial homomorphisms Abstract: In a recent preprint, Dochtermann and Engstrom applied the homomorphism complex construction to construct cellular resolutions of hyper-edge ideals of a class of hyper-graphs they called cointerval. In this talk I will introduce cellular resolutions and homomorphism complexes, and discuss a generalization of their results. If time permits, I will also discuss some topological and combinatorial properties of cointerval simplicial complexes, a generalization of cointerval hypergraphs. This work is joint with Jonathan Browder of University of Washington and Steve Klee of University of California, Davis. |
September 20, 2010 |
Uwe Nagel (University of Kentucky)
Identifying certain Rees algebras Abstract: Last week we have seen that the Max-Flow Min-Cut property of a clutter is related to the Rees algebra of the clutter. Rees algebras are rather abstractly defined. In the talk we will discuss some ideals whose Rees algebras admit a nice description. These ideals include Ferrers ideals and strongly stable ideals generated in degree two. |
September 13, 2010 |
Bonnie Smith (University of Kentucky)
The Packing Problem for Monomial Ideals Abstract: In 1993, Conforti and Cornuejols conjectured that a clutter has the Max-Flow Min-Cut property (a linear programming condition) if and only if all of its minors pack. Cornuejols went on to offer $5,000 to whomever could prove or disprove the conjecture before 2020... a prize which is still up for grabs! The problem was later cast in algebraic terms by Gitler, Valencia and Villarreal. I will give an introduction to this problem and an overview of progress which has be made so far. |
May 3, 2010 |
Bonnie Smith (University of Notre Dame)
The core of a strongly stable ideal Abstract: A reduction of an ideal I can be thought of as a simpler ideal, and is an important tool for studying I and its powers. The core of I is the intersection of all of its reductions. We will look at ways in which the core arises naturally, and observe that in certain cases the core encodes geometric information about the ideal. However, the core is usually very difficult to describe explicitly, since by definition it is an infinite intersection. We will consider strongly stable ideals of degree two, a class of ideals coming from graph theory. After examining the properties of these ideals, we will show that there is a surprisingly simple formula for their cores. |
April 26, 2010 |
Vassily Gorbounov (University of Aberdeen, UK)
Toward the universal deformation of Schubert calculus Abstract: Schubert calculus has been in the intersection of several fast developing areas of mathematics for a long time. Originally invented as the description of the cohomology of homogeneous spaces it needs to be redesigned when applied to other generalized cohomology theories such as the equivariant, the quantum cohomology, K-theory, and cobordism. All this cohomology theories are different deformations of the ordinary cohomology. In this talk we show that there is the universal deformation of Schubert calculus which produces the above mentioned by specialization of the appropriate parameters. We build on the work of D.Gepner and E.Witten on the relation between the fusion algebra of the group $SU(n)$ at the level $k$ and the quantum cohomology of the Grassmann manifold $Gr(n,k)$. The main observation there was that the classical cohomology of the Grassmann manifold is a Jacobi ring of an appropriate potential and the quantum cohomology is the Jacobi ring of a particular deformation of the this potential. We extend this result to hermitian symmetric spaces. Namely we show that the cohomology of the hermitian symmetric space is a Jacobi ring of a certain potential and the equivariant and the quantum cohomology and K-theory is a Jacobi ring of a particular deformation of this potential. This suggests to study the most general deformations of the Frobenius algebra of cohomology of these manifolds by considering the versal deformation of the appropriate potential. The structure of the Jacobi ring of such potential is a subject of well developed singularity theory. This gives a potentially new way to look at the classical, the equivariant, the quantum and other flavors of Schubert calculus. |
April 19, 2010 |
Detlev Hoffmann (University of Nottingham, UK)
Level and sublevels of rings Abstract: The level (resp. sublevel) of a ring is the smallest number n such that -1 (resp. 0) can be written as a sum of n (resp. n+1) nonzero squares in the ring if such an n exists, otherwise it is defined to be infinity. A famous result by Pfister from the 1960s states that the level of a field, if finite, is always a 2-power, and each 2-power can in fact be realized as level of a suitable field. This answered a question by van der Waerden posed in the 1930s. In the case of fields, level and sublevel coincide, but this need not be true for other types of rings. We will give a survey of various known results about levels and sublevels of rings and mention some open problems. |
April 12, 2010 |
Theodoros Kyriopoulos (University of Kentucky)
The Jacobian conjecture, II Abstract: We continue the discussion of the Jacobian conjecture. |
April 5, 2010 |
Avinash Sathaye (University of Kentucky)
Recognizing the coordinate planes in three space Abstract: A surface F(X,Y,Z)=0 is said to be a coordinate plane if k[X,Y,Z]=k[F,G,H] for some polynomials G,H. Naturally the coordinate ring k[X,Y,Z]/(F) of a coordinate plane is isomorphic to k[u,v], a polynomial ring in two variables. Any surface with this property is called an abstract plane. An abstract plane F has a parametrization X=p(u,v), y=q(u,v), z=r(u,v) such that F(p,q,r)=0 and k[p,q,r]=k[u,v]. The epimorphism problem asks if the converse is true, i.e. is every abstract plane a coordinate plane. We will describe the structure of the ring k[p,q] of an abstract plane and use it to prove some cases of this problem. The structure analyzes the jacobians of polynomials in the ring k[u,v]. |
March 29, 2010 |
Enrico Carlini (Politecnico di Torino, Italy)
Star configuration points Abstract: The pairwise intersections of a family of lines in the plane is called a star configuration. A star configuration has the same Hilbert function as a set of generic points of the same cardinality. Thus it is natural to ask the following question: how special is a star configuration? I will show how to give a possible answer to this question. This is joint work with Adam van Tuyl at Lakehead, Canada. |
March 8, 2010 |
Dennis Moore (University of Kentucky)
Saturated Strongly Stable Ideals with a given Hilbert Polynomial Abstract: Strongly stable ideals have a simple combinatorial structure. The focus of the talk will be to explain how to find all the saturated strongly stable ideals which have a fixed Hilbert polynomial. To begin, the Hilbert polynomial and strongly stable ideals will be defined. Next, some basic operations on stable ideals are introduced. Then a few useful results are covered, culminating in an algorithm for finding the desired set of ideals. Also, I will mention why strongly stable ideals arise and how they are useful. |
March 1, 2010 |
Theodoros Kyriopoulos (University of Kentucky)
The Jacobian Conjecture Abstract: Let F: C^n -> C^n be a polynomial map (i.e. an endomorphism of affine n-space). The Jacobian conjecture claims that "if the determinant of the Jacobian matrix is a non-zero constant, then the map is an isomorphism of affine space" (i.e., it is a bijection and its inverse is a polynomial map. This conjecture was first stated by Eduard Ott-Heinrich Keller in 1939. Despite its simplicity, it has resisted many attempts to be solved, and many faulty proofs have been published by reputable mathematicians. We present various degree reductions, prove special cases, explain why injectivity or birationality would suffice to prove it, and relate it to differential topology. |
Feb. 22, 2010 |
Uwe Nagel (University of Kentucky)
Boij-Soederberg Theory Abstract: The purpose of this talk is to discuss a recent breakthrough in commutative algebra. In 1890 Hilbert introduced free resolutions over a polynomial ring. They have been the object of intense research ever since, yet many questions have not been answered. In 2006 Boij and Soederberg proposed several conjectures about the numerical information encoded in a free resolution, the graded Betti numbers. Their amazing conjectures sparked a lot of interest, and in 2009 Eisenbud and Schreyer finally proved these conjectures. Free resolutions and graded Betti numbers will be introduced in the talk. |
Feb. 8, 2010 |
Zach Teitler (Texas A&M)
Ranks of polynomials Abstract: The Waring rank of a polynomial of degree d is the least number of terms in an expression for the polynomial as a sum of d-th powers. The problem of finding the rank of a given polynomial and studying rank in general has been a central problem of classical algebraic geometry, related to secant varieties; in addition, there are applications to signal processing and computational complexity. Other than a well-known lower bound for rank in terms of catalecticant matrices, there has been relatively little progress on the problem of determining or bounding rank for a given polynomial (although related questions have proved very fruitful). I will describe new upper and lower bounds, with especially nice results for some examples including monomials and cubic polynomials. This is joint work with J.M. Landsberg. |
Feb. 1, 2010 |
David Cook II (University of Kentucky)
Clique-whiskering and face vectors Abstract: The concept of whiskering a graph at every vertex in order to produce a Cohen-Macaulay graph was introduced by Villarreal. This result was strengthened to show that a fully whiskered graph is vertex-decomposable and pure by Doctermann and Engstroem. We introduce a generalisation of whiskering which we call clique-whiskering. We show that a fully clique-whiskered graph is vertex-decomposable and has a surprising relation between its h-vector and the face vector of the independence complex of the base graph. |
Dec. 8, 2009 |
Josh Roberts (University of Kentucky)
A conjecture of Quillen and an algorithm for low dimensional group homology Abstract: For certain rings R of algebraic integers, a conjecture of Quillen, as reformulated by Anton, states that certain classes in the mod p homology of D_1 vanish in the mod p homology of SL_2, where SL_n and D_n are the special linear group and group of diagonal matrices in GL_n respectively. We show that in homological dimension two, this is equivalent to the surjectivity of a certain transgression map. In studying this problem, a very general algorithm was developed that finds an upper bound for the second homology, with coefficients in a finite field k, for any finitely presented group, and, in certain cases, calculates this homology exactly. Given a finitely presented group G, Hopf’s formula expresses the second integral homology of G in terms of generators and relators. The algorithm we give exploits Hopf’s formula to estimate H_2(G,k). We conclude with a few example calculations. |
Nov. 10, 2009 |
Aleams Barra (University of Kentucky)
MacWilliams Extension Theorems Abstract: Let C be a linear code of length n over a finite field F, that is, a subspace of F^n. In her thesis, MacWilliams showed that every linear map from C to F^n that preserves the Hamming weight extends to a monomial map on F^n, i.e., to a map that only permutes and rescales the coordinates. We will show that this result also holds true when we replace the field F by any finite Frobenius ring. We will discuss various weights on rings that have been studied in the literature, especially the Lee weight, the Euclidean weight and the homogeneous weight, and show that on certain rings, any linear map preserving the (Lee, Euclidean, or homogeneous) weight extends to a monomial map. |
Nov. 3, 2009 |
Alberto Corso (University of Kentucky)
Determinantal Equations Defining the Special Fiber Ring of Certain Ideals Abstract: In a previous work, Corso and Nagel studied the algebraic properties of a class of monomial ideals arising from special bipartite graphs. These ideals, involving two distinct sets of variables, were dubbed Ferrers ideals. In particular, the special fiber ring of these ideals turned out to be defined by the two by two minors of a ladder. Using these equations we determine a special reduction of these ideals in a fashion that generalizes an old formula of Dedekind and Mertens about the relation of the contents of two polynomials and their product. Further, in some cases a specialization process produces an interesting class of monomial ideals generated in degree two. This class includes (square-free) strongly stable ideals. We show that the equations defining the special fiber ring of these new ideals are given by the two by two minors of a symmetric ladder, possibly with holes. This result extends some previous work of Conca and, later, Villarreal. As an application we will discuss how these results are needed in a proof of Bonnie Smith (U. of Notre Dame) who was able to give a description of the core of some strongly stable ideals. This is joint work with Uwe Nagel, Sonja Petrovic and Cornelia Yuen. |
Oct. 20, 2009 |
Elizabeth Weaver (University of Kentucky)
Trellis Representations for Linear Block Codes Abstract: Linear block codes can be represented by a type of graph called a trellis which is used in decoding with the Viterbi algorithm. Since the computational complexity of this algorithm depends on the size of our trellis, it is useful to look at optimal trellises. In the literature, there exist mainly two types of trellises, conventional and tail-biting ones. While conventional trellises act on the linear time interval [0,n-1], tail biting trellises act on the circular time axis Z mod n. In the case of conventional trellises, there is a unique minimal trellis with many nice properties, and I will illustrate a construction by Forney for this unique minimal trellis. When tail-biting trellises are considered, the situation is more complicated, and there is no unique minimal trellis. I will introduce a method for creating the set of all minimal linear tail-biting trellises for a given code. |
Oct. 13, 2009 |
Ed Enochs (University of Kentucky)
Orthogonal Decompositions of Categories Abstract: An inner product on a finite dimensional vector space gives a notion of orthogonality of two vectors and so often provides orthogonal direct sum decompositions of such a vector space. Using the extension functor there is way to define an orthogonality relation between objects of a category. This in turn often leads to orthogonal decompositions of the category and so helps us get a better understanding of the category. In this talk I will give a brief history of these ideas and then will explain how they relate to my interests. |
Sep.22/29, 2009 |
Uwe Nagel (University of Kentucky)
Pure O-sequences and Lefschetz properties Abstract: Given a finite set of monomials of the same degree, a pure O-sequence is determined by counting the number of monomials that divide any of the given monomials. Pure O-sequences occur in various disguises, so ideally one would like to classify the possible pure O-sequences. This is considered a very difficult problem. In the talk an algebraic approach will be discussed. The first step is to reinterpret an O-sequence as the Hilbert function of a certain ring. Then the key is to investigate the properties of these rings. As a first application, this provides a new proof of Hibi's results about the growth of pure O-sequences. There remain many open problems. All relevant concepts will be explained in the talk. |
Sep. 14, 2009 |
David Leep (University of Kentucky)
The u-invariant of p-adic function fields Abstract: The u-invariant of a field k, u(k), is the smallest integer n such that any quadratic form with coefficients from k having more than n variables has a nontrivial zero defined over k. Calculating the u-invariant of an arbitrary field is often very difficult, but the u-invariant of fields arising in number theory (finite fields, p-adic fields, number fields) have been known for a long time. An interesting question is the computation of u-invariants of function fields over these fields. The u-invariants of function fields over finite fields are completely known, while essentially nothing is known about u-invariants of a function fields over number fields. During the last decade, the u-invariants of function fields of curves over p-adic fields have been computed. A new result of Heath-Brown on systems of quadratic forms over p-adic fields has led to the computation of u-invariants of arbitrary function fields over p-adic fields. I will report on the background to this problem and my proof of this new result. The talk will not be overly technical. |
Jun. 23, 2009 |
Jose Ignacio Iglesias Curto (University of Salamanca, Spain)
Coding theory and algebraic geometry Abstract: After a brief review of the basics of coding theory we will explain how the use of algebraic geometric tools leads to certain interesting code constructions. The knowledge of the geometric elements involved can then be used to study the properties of the codes so obtained and to derive decoding algorithms. We will also present a similar construction carried out in the context of convolutional codes and comment on the particularities of these codes. |