Gwyneth R. Whieldon. Cornell University Department of Mathematics
|
|
- Oliver Summers
- 5 years ago
- Views:
Transcription
1 Gwyneth R. Whieldon Cornell University Department of Mathematics Research Statement My research is at the crossroads of commutative algebra, combinatorics and algebraic geometry, focused on the study of rings and modules via their underlying combinatorial structure. The core mission is to understand the geometry of varieties and schemes via properties of their free resolutions, exploration of the generating sets and decompositions of their defining ideals, and analyzing the topological properties of associated spaces. Main Themes of Research Program. (1) To study the algebraic invariants of squarefree monomial ideals in an attempt to better understand extremal behavior of ideals and modules over polynomial rings. (2) To answer questions on the structure of modules via decompositions of their free resolutions, either through initial ideals or in the style of Boij-Soederberg theory. (3) To apply the tools of topological combinatorics to algebra and geometry. Understanding the combinatorial structure of the free resolutions of modules relies on numerous tools from topology, combinatorics, and algebra, and permits a rich interplay between the geometry of these rings and the topology of combinatorial objects. Specific Areas of Research. Within these broader themes of algebraic geometry and computational commutative algebra, my specific problems and results are in the areas of: (1) Studying Castelnuovo-Mumford regularity and projective dimension of modules M and providing both upper and lower bounds on the growth of these invariants in terms of combinatorial data of the ring. (2) Studying the asymptotic behavior of powers of monomial ideals, via polarization, the topology and decompositions of their Stanley-Reisner complexes, and the bigraded structure of their Rees algebras. (3) Classifying Betti diagrams of special classes of monomial ideals in terms of their structure, with a goal of algebraically approaching combinatorial questions such as possible f-vectors or h-vectors of spheres and reconstructibility of graphs. (4) Translating questions about topology of simplicial complexes into algebraic calculations via free resolutions. Most of my approaches to these problems are flavored with topological combinatorics. Discrete Morse theory plays a large role, as do combinatorial expressions of the Betti numbers via Hochster s formula and the lcm-lattice. Investigating the Stanley-Reisner complexes of squarefree monomial ideals permits broad algebraic questions to be turned into topological computations such as homology, k-connectedness, or colorability. More generally, algebraic concepts such as Alexander duality, linkage of ideals, or the primary decomposition and associated primes of an ideal can often be translated into combinatorial conditions. This connection permits rich results on both the topological and algebraic sides. 1. Background (Commutative Algebra and Free Resolutions) A central object in commutative algebra is the free resolution of module M, which can be thought of as a chain complex of modules measuring precisely how far a module is from free. At each stage of a resolution, we approximate the module by taking the module of
2 2 relations on the generators of M, then the module of relations on those relations, etc. The i th module in this list is called the i th syzygy module of M. Free Resolutions of Graded Modules. More formally, we say that the free resolution of a graded module M over a ring R is an exact sequence of free modules of the form: F : R( j) β ϕ i,j i R( j) β ϕ 1,j 1 R( j) β ϕ 0,j 0 M, where ϕ i : R( j) β i,j R( j) β i 1,j are graded degree zero maps with entries in R. Such a resolution is minimal precisely when the entries in the ϕ are in R >0, the maximal ideal of R. The β i,j = β i,j (M), the rank of the graded component in degree j at the i th homological stage of the resolution, are an algebraic invariant of M. Many invariants of modules, including Tor, Ext, Castelnuovo-Mumford regularity, depth, dimension, Hilbert function, etc. can be obtained via these free resolutions. Computer algebra systems such as Macaulay 2 (M2) permit explicit calculation of these resolutions (and other algebraic invariants.) This makes their use in investigating the geometry of these rings invaluable, and a strong component of my research agenda includes continued exploration of geometry of modules via such computer algebra systems. The packages I have written for Macaulay 2 use the explicit computation of Betti numbers via free resolutions to investigate extremal properties of topological and geometric structures. 2. Bounds on Growth of Algebraic Invariants: Known and Conjectured Free resolutions have been studied extensively over the last century, but outside of a few narrow cases, sharp bounds on the growth in degree or length of such in terms of general data of the module remain elusive. The Hilbert Syzygy Theorem provides an upper bound on the length of a free resolution of M for modules over polynomial rings in n variables, but upper bounds on the growth independent of the global dimension of our ring R generally require increasingly specific classes of modules Extremal Examples. In the course of answering this question, I exhibited modules with the highest currently known projective dimension (length of minimal resolution) among ideals generated in degree d with k generators, independent of the number of generators of the ring. Theorem 2.1. [Whi11] Let k be a field, d, k N with k = l + m some fixed partition of k. For N = ( ) m+d 2 d 1, in the polynomial ring with m + l N variables, we have the ideal R = k[x 1, x 2,..., x m, y i,j : 1 i l, 1 j N], N N I d,k,m = (x d 1, x d 2,..., x d m, y 1,j m j,..., y l,j m j ), j=1 with m 1,..., m N all monomials of degree d in the x-variables, has projective dimension equal to the number of variables in the ring, or pd(i d,k,m ) = m + l (m+d 2 ). j=1 d 1
3 The rapid increase in projective dimension of these ideals relative to the degree and number of the generators hints at the computational difficulty inherent even in resolutions of standardly graded ideals in a polynomial ring Combinatorics of Free Resolutions Stepping from Algebraic Geometry to Combinatorial Algebra. Classifying free resolutions of modules over polynomial rings in general can be quite difficult. Via initial ideals 1 and polarization 2, many algebraic invariants of general resolutions can be reduced to problems in resolutions of squarefree monomial ideals. Pushing these questions into ideals such as these allows the use of tools from simplicial topology. Stanley-Reisner Ideals and Hypergraph Ideals. The set of squarefree ideals in a polynomial ring in n variables can be put in 1:1 correspondence with simplicial complexes on n vertices in two standard ways - via the Stanley-Reisner ideal or the facet (or hypergraph) ideal of a simplicial complex. The Stanley-Reisner ideal is generated by squarefree monomials corresponding to the nonfaces of, while the facet ideal is generated by monomials corresponding to the facets of. Example 3.1. Let be the following simplicial complex. b a c d Then in the ring R = k[a, b, c, d] we have the Stanley-Reisner ideal SR = (ac, bcd) and the facet ideal I = (abd, bc, cd). We let k[ ] := R/SR for ease of notation. The combinatorics of simplicial complexes are connected to algebraic invariants of the Stanley-Reisner ring k[ ] through Hochster s formula, which allows us to rewrite the Betti numbers β i,j (k[ ]) in terms of the homologies of subcomplexes of. Theorem 3.2. (Hochster s Formula [Hoc77]) Let k[ ] be a Stanley-Reisner ring on variables X = {x 1,..., x n }. Then if m is a squarefree monomial with support W = {x i1,..., x ij } X with deg(m) = j, we have β i,m (k[ ]) = dim H j i 1 ( W, k), where W is the induced subcomplex of on vertices in W. Viewing a squarefree monomial ideal I as either a facet ideal (as in [Far02], or as surveyed in [HVT08]) or a Stanley-Reisner ideal (as in Chapter 5 of [BH93]) will showcase different combinatorial aspects of the complex. 1 The initial ideal in(i) is the monomial ideal generated by leading terms of all polynomials in an ideal I. 2 The polarization of a monomial ideal is the monomial ideal obtained by replacing monomial generators with an equivalent squarefree generating set in a larger number of variables.
4 4 4. Edge Ideals and Facet Ideals My personal research has been focused on applications of Hochster s formula to computations of Betti numbers on facet ideals of degree 2, called edge ideals in recognition of their corresponding simplicial complexes being graphs. Properties of edge ideals have been explored by Van Tuyl, Tai Ha, Francisco, Villareal, Faridi and others, leading to surprisingly fertile combinatorial structure even in this seemingly simple case. Numerous graph theoretic problems can be turned into questions in algebra, and vice versa. Proposition 4.1. [Vil90] Let G be a simple graph on vertex set [n] = {1, 2,..., n} with edge set E, and let I G = (x i x j : {i, j} E) R = k[x 1,..., x n ] be the edge ideal of G. Then the Stanley-Reisner complex of I G, denoted (I G ), is given by (I G ) = Ĝc, the clique closure [i.e. adding a face σ to whenever σ ] of the complement graph of G in [n]. Linear Quotients of Powers of Edge Ideals. One common graph that arises in combinatorial investigations is the graph of the anticycle, meaning the complement graph of a cycle of length n. In joint work with A. Hoefel, we exhibited a linear quotient ordering for the second power of this ideal, giving us that the Stanley-Reisner complex of the Alexander dual of the polarization of IG 2 is shellable. Theorem 4.2. [Whi11] Let G be the complement graph of the n-cycle. Then I 2 G has a linear resolution with linear quotients. This meshes well with my general research program s goal: To classify invariants of edge ideals (and other squarefree ideals) and the powers of these ideals in terms of combinatorial data. While having linear quotients guarantees a linear resolution of these particular ideals IG 2, a better understanding of the shapes of the Betti diagrams of edge ideals 4.1. Syzygies of Edge Ideals of Graphs with C 4 -free Complement. As an additional result in this direction, I was able to classify the first Betti number that is of degree two higher than the linear strand in terms of the location of the first nonlinear Betti number. Theorem 4.3. [Whi10b] Let G be a graph with the complement graph G c having no induced 4-cycles [a graph with C 4 -free complement.] If the first nonlinear Betti number in the resolution of R/I G occurs at stage i of the resolution, then the earliest a syzygy of higher degree can occur is at stage 2i. The complement graph of the 1-skeleton of the icosahedron is an example of a stronger conjectured bound: Namely, in graphs with the first nonlinear Betti number in the 3 rd stage of the resolution, the soonest the second nonlinear Betti number can occur is at the 9 th stage of the resolution. G total: : 1 1: : : 1
5 Theorem 4.4. [Whi11] Given an edge ideal I G with a complement graph G c with no induced cycles of length 4 and β 2,5 (I G ) 0, all Betti number in the 4-strand are zero until β 3,12 (I G ). The proof of these relies on an examination of the topology of the clique closures of complements graphs a fairly standard theme in edge ideals. Future research plans include further characterization of graph structures which force bounds on projective dimension and regularity (a generalization of maximum degree of generators of our ideal I measuring the complexity of the resolution.) For ideals I G with regularity higher than 4, the degree sequences can have more interesting patterns - but these can be characterized via topological joins of Stanley-Reisner complexes of other ideals, and the Betti numbers of some classes of ideals can be completely characterized [Whi10a]. 5. Asymptotic Behavior of Powers of Equigenerated Monomial Ideals My research also addresses the behavior of higher powers of edge ideals and other facet ideals. The following result was via an examination of the bigraded and multigraded structures of the Rees algebras of equigenerated monomial ideals, refining work in [Cha97]. Stabilization of Betti Diagrams of Monomial Ideals I. Theorem 5.1. Let I = (m 1,..., m k ) R be an equigenerated monomial ideal of degree d, i.e. deg(m i ) = d. Then there exists an N such that for all n > N shape of the Betti diagrams of I n stabilize, e.g. for all i, j N. β,i,dn+j(r/i) 0 β,i,dn+j(r/i) 0 This N marks the power of I that needs to be taken to fix the shape of the Betti table of the resolution of R/I at all subsequent powers, the locations of nonzero entries in the Betti table can be obtained by shifting down by d places all of the nonzero entries in the Betti table of the previous power. This result generalized to non-equigenerated ideals easily, but the translation of the Betti tables are less clear. This stabilization happens at or before the x-regularity of the Rees algebra of I. Precise calculation of this stabilization number in terms of data of I remains elusive, as the bound given by the x-regularity is not sharp. 6. Undergraduate Research Program Connections Between Graph Theory and Algebra. As my research has a deep focus on graph theory with a wide application to algebra many of the problems are amenable to adaption to undergraduate research. Creating a dictionary between graph invariants of G and algebraic properties of I G is a rich and accessible field. Previous REU Experience: Combinatorics of Free Probability. A future direction for research with undergraduates is a continuation of a previous REU I helped run, where we helped students connect the combinatorics of poset structures arising from noncrossing pairings on bit-strings of 0 s and 1 s to asymptotics of random matrices and free probability. This approach was an extension of work in [NS06]. The advantage of approaching these problems combinatorially rather than through heavy analysis is twofold - it permits an easy extension of the free central limit theorem to the multidimensional case, and it gives rise to an interesting interplay between the topology of the poset of noncrossing pairings [and special subposets of it corresponding to particular strings] and moments of free variables 5
6 6 and free cumulants. The mixed flavor of this project - a melange of combinatorics, probability, topology, and computer algebra system exploration - was rewarding and exciting for the students and I would be very pleased to return to this project. 7. Future Research Program While many of the previously mentioned work is still ongoing and productive, some additional avenues of research I would be interested in exploring include: Classifying shapes of Betti diagrams of edge ideals (or general squarefree monomial ideals) and their powers in terms of combinatorial data of the graphs or hypergraphs. I would like as well to have better combinatorial data determining the power I N required to stabilize the shape of the Betti diagrams of I n. Using topological or algebraic constructions (nerves and inverse nerves of simplicial complexes, discrete Morse theory, Rees algebras, whiskered complexes, etc.) to extend the computational power of these resolutions. Some additional current results of mine connect structures in graphs (and other simplicial complexes ) to the Ext modules of the Stanley Reisner ideals of the nerve of, which potentially provide a direct combinatorial interpretation of Ext modules for squarefree monomial ideals. My goal is to extend these results further than the few current cases known [Whi10b]. To produce large classes of ideals maximizing algebraic invariants with restraints. For example, classes achieving maximal or minimal Betti numbers for a fixed Hilbert function, Gotzmann growth in the general monomial ideal case, maximum regularity or projective dimension with certain forbidden minors of G, etc. To examine decompositions of resolutions of Stanley-Reisner ideals into their pure parts via Boij-Soederberg theory. Some current work of mine has been focused on examining the decompositions of 2-stranded resolutions (quotients of ideals with regularity 3) into their pure parts, in an attempt to give combinatorial significance to coefficients appearing in the decomposition. While the modules resolved to obtain the pure resolutions aren t (necessarily) obtained as quotients of polynomial rings, other recent work [BEKS10] has indicated that there is hope at a better understanding of these module structures. Most generally, to continue to extend the reach of topological combinatorics into calculation or specification of algebraic invariants of resolutions. References [BEKS10] Christine Berkesch, Daniel Erman, Manoj Kummini, and Steven Sam. Poset structures in boijsderberg theory. unpublished, [BH93] Winfried Bruns and Jürgen Herzog. Cohen-Macaulay rings, volume 39 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, [Cha97] Karen A. Chandler. Regularity of the powers of an ideal. Comm. Algebra, 25(12): , [DE09] Anton Dochtermann and Alexander Engström. Algebraic properties of edge ideals via combinatorial topology. Electron. J. Combin., 16(2, Special volume in honor of Anders Bjorner):Research Paper 2, 24, [Far02] Sara Faridi. The facet ideal of a simplicial complex. Manuscripta Math., 109(2): , 2002.
7 [Hoc77] [HVT08] Melvin Hochster. Cohen-Macaulay rings, combinatorics, and simplicial complexes. In Ring theory, II (Proc. Second Conf., Univ. Oklahoma, Norman, Okla., 1975), pages Lecture Notes in Pure and Appl. Math., Vol. 26. Dekker, New York, Huy Tài Hà and Adam Van Tuyl. Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers. J. Algebraic Combin., 27(2): , [NS06] Alexandru Nica and Roland Speicher. Lectures on the combinatorics of free probability, volume 335 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, [Vil90] Rafael H. Villarreal. Cohen-Macaulay graphs. Manuscripta Math., 66(3): , [Whi10a] Gwyneth R. Whieldon. Jump sequences of edge ideals. Arxiv, [Whi10b] Gwyneth R. Whieldon. Nerves of simplicial complexes. In preparation, [Whi11] Gwyn Whieldon. Bounding invariants of Stanley-Reisner ideals. Ph.D. Thesis,
COMBINATORIAL COMMUTATIVE ALGEBRA. Fatemeh Mohammadi (University of Bristol)
COMBINATORIAL COMMUTATIVE ALGEBRA Fatemeh Mohammadi (University of Bristol) Abstract. In this lecture we focus on the ideals associated to graphs. We see many interesting examples in which the Betti numbers
More informationSEQUENTIALLY COHEN-MACAULAY GRAPHS OF FORM θ n1,...,n k. Communicated by Siamak Yassemi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 36 No. 2 (2010), pp 109-118. SEQUENTIALLY COHEN-MACAULAY GRAPHS OF FORM θ n1,...,n k F. MOHAMMADI* AND D. KIANI Communicated by Siamak Yassemi Abstract.
More informationarxiv: v1 [math.at] 8 Jan 2015
HOMOLOGY GROUPS OF SIMPLICIAL COMPLEMENTS: A NEW PROOF OF HOCHSTER THEOREM arxiv:1501.01787v1 [math.at] 8 Jan 2015 JUN MA, FEIFEI FAN AND XIANGJUN WANG Abstract. In this paper, we consider homology groups
More informationMINIMAL FREE RESOLUTIONS OF COMPLETE BIPARTITE GRAPH IDEALS
MINIMAL FREE RESOLUTIONS OF COMPLETE BIPARTITE GRAPH IDEALS DANIEL VISSCHER Department of Mathematics, St. Olaf College, Northfield, MN 55057, USA visscher@stolaf.edu Abstract. This paper gives an explicit
More informationA combinatorial proof of a formula for Betti numbers of a stacked polytope
A combinatorial proof of a formula for Betti numbers of a staced polytope Suyoung Choi Department of Mathematical Sciences KAIST, Republic of Korea choisy@aistacr (Current Department of Mathematics Osaa
More informationFURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION
FURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION HAILONG DAO AND JAY SCHWEIG Abstract. We study the relationship between the projective dimension of a squarefree monomial ideal
More informationChordal Graphs and Minimal Free Resolutions
Chordal Graphs and Minimal Free Resolutions David J. Marchette David A. Johannsen Abstract The problem of computing the minimal free resolution of the edge ideal of a graph has attracted quite a bit of
More informationA non-partitionable Cohen-Macaulay simplicial complex
A non-partitionable Cohen-Macaulay simplicial complex Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University of Kansas, 3 Brown University Discrete
More informationAlgebraic properties of edge ideals via combinatorial topology
Algebraic properties of edge ideals via combinatorial topology Anton Dochtermann TU Berlin, MA 6-2 Straße des 17. Juni 136 10623 Berlin Germany dochterm@math.tu-berlin.de Alexander Engström KTH Matematik
More informationON CELLULAR RESOLUTION OF MONOMIAL IDEALS
ON CELLULAR RESOLUTION OF MONOMIAL IDEALS THE WORKSHOP ON COMPUTATIONAL DIFFERENTIAL ALGEBRA AND RELATED TOPICS SCHOOL OF MATHEMATICS, IPM JUNE 21-25, 2014 TEHRAN, IRAN RAHIM ZAARE-NAHANDI, UNIVERSITY
More informationA SURVEY OF MONOMIAL RESOLUTIONS
A SURVEY OF MONOMIAL RESOLUTIONS by Andrew Hoefel SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE AT DALHOUSIE UNIVERSITY HALIFAX, NOVA SCOTIA DECEMBER 2006 c Copyright
More informationA non-partitionable Cohen-Macaulay simplicial complex
A non-partitionable Cohen-Macaulay simplicial complex Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University of Kansas, 3 Brown University Department
More informationON THE COMBINATORICS OF RESOLUTIONS OF MONOMIAL IDEALS
ON THE COMBINATORICS OF RESOLUTIONS OF MONOMIAL IDEALS by Nursel Erey Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy at Dalhousie University Halifax, Nova Scotia
More informationarxiv: v2 [math.co] 24 Aug 2016
Slicing and dicing polytopes arxiv:1608.05372v2 [math.co] 24 Aug 2016 Patrik Norén June 23, 2018 Abstract Using tropical convexity Dochtermann, Fink, and Sanyal proved that regular fine mixed subdivisions
More informationA non-partitionable Cohen-Macaulay simplicial complex, and implications for Stanley depth
A non-partitionable Cohen-Macaulay simplicial complex, and implications for Stanley depth Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University
More informationarxiv: v1 [math.co] 22 Dec 2016
THE LERAY DIMENSION OF A CONVEX CODE CARINA CURTO AND RAMÓN VERA arxiv:607797v [mathco] Dec 06 ABSTRACT Convex codes were recently introduced as models for neural codes in the brain Any convex code C has
More informationCOMBINATORIC AND ALGEBRAIC ASPECTS OF A CLASS OF PLANAR GRAPHS
Communications to SIMAI Congress, ISSN 87-905, Vol. (007 DOI: 0.685/CSC060 COMBINATORIC AND ALGEBRAIC ASPECTS OF A CLASS OF PLANAR GRAPHS M. LA BARBIERA Department of Mathematics, University of Messina,
More informationarxiv: v1 [math.ac] 25 May 2016
LATTICE COMPLEMENTS AND THE SUBADDITIVITY OF SYZYGIES OF SIMPLICIAL FORESTS arxiv:1605.07727v1 [math.ac] 25 May 2016 Sara Faridi Abstract We prove the subadditivity property for the maximal degrees of
More informationTHREE SIMPLICIAL RESOLUTIONS
THREE SIMPLICIAL RESOLUTIONS JEFFREY MERMIN Abstract. We describe the Taylor and Lyubeznik resolutions as simplicial resolutions, and use them to show that the Scarf complex of a monomial ideal is the
More informationSIMPLICIAL COMPLEXES SATISFYING SERRE S CONDITION: A SURVEY WITH SOME NEW RESULTS
SIMPLICIAL COMPLEXES SATISFYING SERRE S CONDITION: A SURVEY WITH SOME NEW RESULTS M. R. POURNAKI, S. A. SEYED FAKHARI, N. TERAI, AND S. YASSEMI Dedicated with gratitude to our friend Richard P. Stanley
More informationSTANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M. MASUDA
Communications in Algebra, 34: 1049 1053, 2006 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870500442005 STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M.
More informationA non-partitionable CM simplicial complex
A non-partitionable Cohen-Macaulay simplicial complex Art M. Duval (University of Texas, El Paso) Bennet Goeckner (University of Kansas) Caroline J. Klivans (Brown University) Jeremy L. Martin (University
More informationTHE BASIC THEORY OF PERSISTENT HOMOLOGY
THE BASIC THEORY OF PERSISTENT HOMOLOGY KAIRUI GLEN WANG Abstract Persistent homology has widespread applications in computer vision and image analysis This paper first motivates the use of persistent
More informationBoolean graphs are Cohen-Macaulay
Boolean graphs are Cohen-Macaulay A-Ming Liu and Tongsuo Wu Department of Mathematics, Shanghai Jiaotong University Abstract. For each Boolean graph B n, it is proved that both B n and its complement B
More informationIndependence complexes of well-covered circulant graphs
Independence complexes of well-covered circulant graphs Jonathan Earl (Redeemer - NSERC USRA 2014) Kevin Vander Meulen (Redeemer) Adam Van Tuyl (Lakehead) Catriona Watt (Redeemer - NSERC USRA 2012) October
More informationA NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL
A NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL KIM KESTING, JAMES POZZI, AND JANET STRIULI Abstract. An algebraic approach to graph theory involves the study of the edge ideal and
More informationToric Cohomological Rigidity of Simple Convex Polytopes
Toric Cohomological Rigidity of Simple Convex Polytopes Dong Youp Suh (KAIST) The Second East Asian Conference on Algebraic Topology National University of Singapore December 15-19, 2008 1/ 28 This talk
More informationvia combinatorial topology
Algebraic properties of edge ideals arxiv:0810.4120v1 [math.co] 22 Oct 2008 via combinatorial topology Anton Dochtermann and Alexander Engström Dedicated to Anders Björner on the occasion of his 60th birthday.
More informationSimplicial and Cellular Spanning Trees, I: General Theory
Simplicial and Cellular Spanning Trees, I: General Theory Art Duval (University of Texas at El Paso) Caroline Klivans (Brown University) Jeremy Martin (University of Kansas) University of California, Davis
More informationThe Charney-Davis conjecture for certain subdivisions of spheres
The Charney-Davis conjecture for certain subdivisions of spheres Andrew Frohmader September, 008 Abstract Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced,
More informationChordal graphs and the characteristic polynomial
Discrete Mathematics 262 (2003) 211 219 www.elsevier.com/locate/disc Chordal graphs and the characteristic polynomial Elizabeth W. McMahon ;1, Beth A. Shimkus 2, Jessica A. Wolfson 3 Department of Mathematics,
More informationarxiv: v1 [math.co] 9 Dec 2015
ALGEBRAIC DISCRETE MORSE THEORY FOR THE HULL RESOLUTION arxiv:1512.03045v1 [math.co] 9 Dec 2015 PATRIK NORÉN Abstract. We study how powerful algebraic discrete Morse theory is when applied to hull resolutions.
More informationGeneralized Moment-Angle Complexes
Generalized Moment-Angle Complexes Fred Cohen 1-5 June 2010 joint work with Tony Bahri, Martin Bendersky, and Sam Gitler The setting and the problems: This report addresses joint work with Tony Bahri,
More informationNoncrossing sets and a Graßmann associahedron
Noncrossing sets and a Graßmann associahedron Francisco Santos, Christian Stump, Volkmar Welker (in partial rediscovering work of T. K. Petersen, P. Pylyavskyy, and D. E. Speyer, 2008) (in partial rediscovering
More informationSimplicial Matrix-Tree Theorems
Art Duval (University of Texas at El Paso) Caroline Klivans (University of Chicago) Jeremy Martin (University of Kansas) KUMUNU VIII University of Nebraska, Lincoln September 9, 2007 Graphs and Spanning
More informationERDŐS-KO-RADO THEOREMS FOR SIMPLICIAL COMPLEXES arxiv: v3 [math.co] 29 Nov 2010
ERDŐS-KO-RADO THEOREMS FOR SIMPLICIAL COMPLEXES arxiv:1001.0313v3 [math.co] 29 Nov 2010 RUSS WOODROOFE Abstract. A recent framework for generalizing the Erdős-Ko- Rado Theorem, due to Holroyd, Spencer,
More informationMONOMIAL RESOLUTIONS. Dave Bayer Irena Peeva Bernd Sturmfels
MONOMIAL RESOLUTIONS Dave Bayer Irena Peeva Bernd Sturmfels 1. Introduction. Let M be a monomial ideal in the polynomial ring S = k[x 1,...,x n ] over a field k. We are interested in the problem, first
More informationarxiv: v1 [math.at] 19 Aug 2017
SPANNING SIMPLICIAL COMPLEXES OF UNI-CYCLIC MULTIGRAPHS arxiv:708.05845v [math.at] 9 Aug 207 IMRAN AHMED, SHAHID MUHMOOD Abstract. A multigraph is a nonsimple graph which is permitted to have multiple
More informationarxiv: v1 [math.gt] 18 Nov 2015
arxiv:1511.05845v1 [math.gt] 18 Nov 2015 A geometric description of the extreme Khovanov cohomology J. González-Meneses, P. M. G. Manchón and M. Silvero November 19, 2015 Abstract We prove that the hypothetical
More informationCREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais
Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant
More informationarxiv: v1 [math.co] 18 Jan 2013
arxiv:1301.4459v1 [math.co] 18 Jan 2013 Composition of simplicial complexes, polytopes and multigraded Betti numbers Ayzenberg Anton Abstract. For a simplicial complex K on m vertices and simplicial complexes
More informationPERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES
PERSISTENT HOMOLOGY OF FINITE TOPOLOGICAL SPACES HANEY MAXWELL Abstract. We introduce homology and finite topological spaces. From the basis of that introduction, persistent homology is applied to finite
More informationA VARIETY OF GRAPH COLORING PROBLEMS
A VARIETY OF GRAPH COLORING PROBLEMS DAVID MEHRLE Gröbner Bases and the Ideal Membership Problem Let k be a field and let A = C[x 1,..., x n ]. For the set of common zeros of elements of an ideal I A,
More informationTopological Invariance under Line Graph Transformations
Symmetry 2012, 4, 329-335; doi:103390/sym4020329 Article OPEN ACCESS symmetry ISSN 2073-8994 wwwmdpicom/journal/symmetry Topological Invariance under Line Graph Transformations Allen D Parks Electromagnetic
More informationPOLYTOPES. Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of convex polytopes.
POLYTOPES MARGARET A. READDY 1. Lecture I: Introduction to Polytopes and Face Enumeration Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of
More informationSIMPLICIAL COMPLEXES OF PLACEMENT GAMES
SIMPLICIAL COMPLEXES OF PLACEMENT GAMES by Svenja Huntemann Submitted in partial fulfillment of the requirements for the degree of Master of Science at Dalhousie University Halifax, Nova Scotia August
More informationarxiv: v1 [math.ac] 19 Jan 2016
COHEN-MACAULAYNESS OF TRIANGULAR GRAPHS arxiv:1601.05016v1 [math.ac] 19 Jan 2016 HERNAN DE ALBA, WALTER CARBALLOSA, DANIEL DUARTE, LUIS MANUEL RIVERA Abstract. We study the Cohen-Macaulay property of triangular
More informationSimplicial cycles and the computation of simplicial trees
Simplicial cycles and the computation of simplicial trees Massimo Caboara Sara aridi Peter Selinger Abstract We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial
More informationSimplicial cycles and the computation of simplicial trees
Simplicial cycles and the computation of simplicial trees Massimo Caboara Sara aridi Peter Selinger Abstract We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial
More informationComputation of Poincaré-Betti Series for Monomial Rings
Rend. Istit. Mat. Univ. Trieste Vol. XXXVII, 85 94 (2005) Computation of Poincaré-Betti Series for Monomial Rings Mikael Johansson ( ) Contribution to School (and Workshop) on Computational Algebra for
More informationEDGEWISE COHEN MACAULAY CONNECTIVITY OF PARTIALLY ORDERED SETS
EDGEWISE COHEN MACAULAY CONNECTIVITY OF PARTIALLY ORDERED SETS CHRISTOS A. ATHANASIADIS and MYRTO KALLIPOLITI Abstract The proper parts of face lattices of convex polytopes are shown to satisfy a strong
More informationTHE SOFTWARE PACKAGE SpectralSequences
THE SOFTWARE PACKAGE SpectralSequences ADAM BOOCHER, NATHAN GRIEVE, AND ELOÍSA GRIFO Abstract We describe the computer algebra software package SpectralSequences for the computer algebra system Macaulay2
More informationCUBICAL SUBDIVISIONS AND LOCAL h-vectors
CUBICAL SUBDIVISIONS AND LOCAL h-vectors CHRISTOS A. ATHANASIADIS Abstract. Face numbers of triangulations of simplicial complexes were studied by Stanley by use of his concept of a local h-vector. It
More informationDESCRIPTION OF PROBLEMS MICHAEL MOSSINGHOFF AND SINAI ROBINS
SUMMER@ICERM 2014 DESCRIPTION OF PROBLEMS MICHAEL MOSSINGHOFF AND SINAI ROBINS We describe a number of interesting, open-ended problems in combinatorics, discrete geometry, and number theory for study
More information3. Persistence. CBMS Lecture Series, Macalester College, June Vin de Silva Pomona College
Vin de Silva Pomona College CBMS Lecture Series, Macalester College, June 2017 o o The homology of a planar region Chain complex We have constructed a diagram of vector spaces and linear maps @ 0 o 1 C
More informationcombinatorial commutative algebra final projects
combinatorial commutative algebra. 2009 final projects due dates. o Wednesday, April 8: rough outline. (1-2 pages) o Monday, May 18: final project. ( 10 pages in LaTeX, 11pt, single space). san francisco
More informationh-polynomials of triangulations of flow polytopes (Cornell University)
h-polynomials of triangulations of flow polytopes Karola Mészáros (Cornell University) h-polynomials of triangulations of flow polytopes (and of reduction trees) Karola Mészáros (Cornell University) Plan
More informationREPRESENTATION OF DISTRIBUTIVE LATTICES BY MEANS OF ORDERED STONE SPACES
REPRESENTATION OF DISTRIBUTIVE LATTICES BY MEANS OF ORDERED STONE SPACES H. A. PRIESTLEY 1. Introduction Stone, in [8], developed for distributive lattices a representation theory generalizing that for
More informationMOMENT-ANGLE MANIFOLDS AND CONNECTED SUMS OF SPHERE PRODUCTS
Fan, F., Chen, L., Ma, J. and Wang, X. Osaka J. Math. 53 (2016), 31 45 MOMENT-ANGLE MANIFOLDS AND CONNECTED SUMS OF SPHERE PRODUCTS FEIFEI FAN, LIMAN CHEN, JUN MA and XIANGJUN WANG (Received July 1, 2014,
More informationPolytopes Course Notes
Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationarxiv: v1 [math.gr] 19 Dec 2018
GROWTH SERIES OF CAT(0) CUBICAL COMPLEXES arxiv:1812.07755v1 [math.gr] 19 Dec 2018 BORIS OKUN AND RICHARD SCOTT Abstract. Let X be a CAT(0) cubical complex. The growth series of X at x is G x (t) = y V
More informationDISCRETE MORSE THEORY FOR MOMENT-ANGLE COMPLEXES OF PAIRS (D n, S n 1 )
DISCRETE MORSE THEORY FOR MOMENT-ANGLE COMPLEXES OF PAIRS (D n, S n 1 ) VLADIMIR GRUJIĆ AND VOLKMAR WELKER Abstract. For a finite simplicial complex K and a CW-pair (X, A), there is an associated CW-complex
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationTorus Actions Determined by Simple Polytopes
Contemporary Mathematics Torus Actions Determined by Simple Polytopes Victor M. Buchstaber and Taras E. Panov Abstract. An n-dimensional polytope P n is called simple if exactly n codimension-one faces
More informationTurn Graphs and Extremal Surfaces in Free Groups
Turn Graphs and Extremal Surfaces in Free Groups Noel Brady, Matt Clay, and Max Forester Abstract. This note provides an alternate account of Calegari s rationality theorem for stable commutator length
More informationarxiv: v2 [math.co] 5 Oct 2013
A CLASSIFICATION OF THE FACE NUMBERS OF BUCHSBAUM SIMPLICIAL POSETS JONATHAN BROWDER AND STEVEN KLEE arxiv:1307.1548v2 [math.co] 5 Oct 2013 Abstract. The family of Buchsbaum simplicial posets generalizes
More informationIs there a McLaughlin geometry?
Is there a McLaughlin geometry? Leonard H. Soicher School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, UK email: L.H.Soicher@qmul.ac.uk February 9, 2006 Dedicated
More informationCHRISTOS A. ATHANASIADIS
FLAG SUBDIVISIONS AND γ-vectors CHRISTOS A. ATHANASIADIS Abstract. The γ-vector is an important enumerative invariant of a flag simplicial homology sphere. It has been conjectured by Gal that this vector
More informationAlgorithms for finding the minimum cycle mean in the weighted directed graph
Computer Science Journal of Moldova, vol.6, no.1(16), 1998 Algorithms for finding the minimum cycle mean in the weighted directed graph D. Lozovanu C. Petic Abstract In this paper we study the problem
More informationOn the Partial Sum of the Laplacian Eigenvalues of Abstract Simplicial Complexes
On the Partial Sum of the Laplacian Eigenvalues of Abstract Simplicial Complexes Rediet Abebe and Joshua Pfeffer Abstract We present progress made in showing the generalized Grone-Merris conjecture for
More informationThe topology of the independence complex
The topology of the independence complex Richard EHRENBORG and Gábor HETYEI Abstract We introduce a large self-dual class of simplicial complexes about which we show that each complex in it is contractible
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationThe orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.
Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version
More informationTriangulations of Simplicial Polytopes
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 45 (004), No. 1, 37-46. Triangulations of Simplicial Polytopes Peter McMullen University College London Gower Street, London
More informationPiecewise Boolean algebra. Chris Heunen
Piecewise Boolean algebra Chris Heunen 1 / 33 Boolean algebra: example {,, } {, } {, } {, } { } { } { } 2 / 33 Boolean algebra: definition A Boolean algebra is a set B with: a distinguished element 1 B;
More informationarxiv:math/ v1 [math.ac] 16 Feb 2005
arxiv:math/0502348v1 [math.ac] 16 Feb 2005 COMPUTATION OF POINCARÉ-BETTI SERIES FOR MONOMIAL RINGS MIKAEL JOHANSSON Abstract. The multigraded Poincaré-Betti series PR k (Ü;t) of a monomial ring k[ü]/ M
More informationWhat is high-dimensional combinatorics?
What is high-dimensional combinatorics? Random-Approx, August 08 A (very) brief and (highly) subjective history of combinatorics Combinatorics must always have been fun. But when and how did it become
More informationRigid Multiview Varieties
Joe Kileel University of California, Berkeley January 9, 2016 Nonlinear Algebra JMM, Seattle Joe Kileel Preprint arxiv:1509.03257 Michael Joswig Bernd Sturmfels André Wagner Algebraic vision Multiview
More informationGeometry. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. U. H. Kortenkamp. 1.
Discrete Comput Geom 18:455 462 (1997) Discrete & Computational Geometry 1997 Springer-Verlag New York Inc. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationThe important function we will work with is the omega map ω, which we now describe.
20 MARGARET A. READDY 3. Lecture III: Hyperplane arrangements & zonotopes; Inequalities: a first look 3.1. Zonotopes. Recall that a zonotope Z can be described as the Minkowski sum of line segments: Z
More informationINTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP*
South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 10-16. INTERSECTION OF CURVES FACTS, COMPUTATIONS, APPLICATIONS IN BLOWUP* PAVEL CHALMOVIANSKÝ abstrakt. We deal with application of intersection
More informationApplied Math Research Showcase: Statistics, Algebra, & Randomization
Applied Math Research Showcase: Statistics, Algebra, & Randomization Sonja Petrović Illinois Institute of Technology April 2017 (math.iit.edu/-spetrov1) Alg Stats, Ntwks, Random Alg April 2017 0 / 15 My
More informationHomology cycle bases from acyclic matchings
Homology cycle bases from acyclic matchings Dmitry Feichtner-Kozlov University of Bremen Kyoto Workshop, January 019 What is... Applied Topology? studying global features of shapes applications in other
More informationOn the Topology of Finite Metric Spaces
On the Topology of Finite Metric Spaces Meeting in Honor of Tom Goodwillie Dubrovnik Gunnar Carlsson, Stanford University June 27, 2014 Data has shape The shape matters Shape of Data Regression Shape of
More informationA MODEL CATEGORY STRUCTURE ON THE CATEGORY OF SIMPLICIAL CATEGORIES
A MODEL CATEGORY STRUCTURE ON THE CATEGORY OF SIMPLICIAL CATEGORIES JULIA E. BERGNER Abstract. In this paper we put a cofibrantly generated model category structure on the category of small simplicial
More informationProblem 1: A connected graph which contains no cycles is called a tree. Prove that the following are equivalent:
Problem Set 1 Due on February 13th. Problem 1: A connected graph which contains no cycles is called a tree. Prove that the following are equivalent: G is a tree. G is minimally connected, that is G \ e
More informationSurfaces Beyond Classification
Chapter XII Surfaces Beyond Classification In most of the textbooks which present topological classification of compact surfaces the classification is the top result. However the topology of 2- manifolds
More informationAlgorithmic Semi-algebraic Geometry and its applications. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology.
1 Algorithmic Semi-algebraic Geometry and its applications Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology. 2 Introduction: Three problems 1. Plan the motion of
More informationGeneralized Foulkes Conjecture and Tableaux Construction
Generalized Foulkes Conjecture and Tableaux Construction Thesis by Rebecca Vessenes In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology
More informationarxiv: v1 [math.co] 13 Mar 2015
THE MANY FACES OF MODERN COMBINATORICS CRISTIAN LENART arxiv:1503.04240v1 [math.co] 13 Mar 2015 Abstract. This is a survey of recent developments in combinatorics. The goal is to give a big picture of
More informationREPRESENTATION STABILITY AND TROPICAL GEOMETRY
REPRESENTATION STABILITY AND TROPICAL GEOMETRY JUSTIN LANIER Abstract. The lens of representation stability has shed light on phenomena that were classically viewed as unstable in fields as varied as topology,
More informationMonomial Ideals and Planar Graphs
Monomial Ideals and Planar Graphs Ezra Miller and Bernd Sturmfels Department of Mathematics, University of California, Berkeley CA 94720, USA enmiller@math.berkeley.edu, bernd@math.berkeley.edu Abstract.
More informationExact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )
Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 469 476 Exact discrete Morse functions on surfaces Vasile Revnic To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. In this paper,
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationTORIC VARIETIES JOAQUÍN MORAGA
TORIC VARIETIES Abstract. This is a very short introduction to some concepts around toric varieties, some of the subsections are intended for more experienced algebraic geometers. To see a lot of exercises
More informationElementary Combinatorial Topology
Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallée Cedex E-mail address: frederic.meunier@cermics.enpc.fr
More informationThe Borsuk-Ulam theorem- A Combinatorial Proof
The Borsuk-Ulam theorem- A Combinatorial Proof Shreejit Bandyopadhyay April 14, 2015 1 Introduction The Borsuk-Ulam theorem is perhaps among the results in algebraic topology having the greatest number
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More information