User Tools

Site Tools


seminars:comb:start

Combinatorics Seminar

SPRING 2021

  • Tuesday, 2/16
    Organizational meeting
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 2/23
    Title: What I've Been Doing, Part I
    Speakers: Thomas Zaslavsky, James West, Michael Dobbins
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 3/2
    Title: What I've Been Doing, Part II
    Speakers: Olakunle Abawonse,
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 3/9
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 3/16
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 3/23
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 3/30
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 4/6
    Title:
    Speaker: Laura Anderson
    Time: 1:15-2:15

    This will be related to a talk by Kunle Abawonse the previous week in the Topology Seminar.

    Zoom meeting id: 953 0238 3985

  • Tuesday, 4/13
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 4/20
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 4/27
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 5/4
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 5/11
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985

  • Tuesday, 5/18
    Title:
    Speakers:
    Time: 1:15-2:15

    Zoom meeting id: 953 0238 3985


  • FALL 2020

  • Tuesday, 9/8
    Title: Like speed dating, except combinatorics
    Speakers: Michael Dobbins, Laura Anderson, Tom Zaslavsky
    Time: 1:10-2:10

    Zoom meeting id: 925 2894 7102

    Today some of us will give very brief introductions to our current research.

  • Tuesday, 9/15
    Title: Like speed dating, except combinatorics, part 2
    Speakers: Nick Lacasse, Seunghun Lee
    Time: 1:15 - 2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

  • Tuesday, 9/22
    Title: Like speed dating, except combinatorics, part 3
    Speakers: Chris Eppolito, Kunle Abawonse
    Time: 1:15 - 2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

  • Tuesday, 9/29
    Speaker: Thomas Zaslavsky (Binghamton)
    Title: Structure for Signed Graphs
    Time: 1:15 - 2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    A signed graph is a graph whose edges are labelled positive or negative. I survey a selection of aspects of signed-graph structure, beginning with Harary's founding “Structure Theorem” and including edges in circles, kinds of connection, a signed Kuratowski-type theorem, and structures that guarantee negative circles are not very disjoint.

  • Tuesday, 10/6
    Speaker: Tillmann Miltzow (Utrecht University)
    Title: A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
    Time: 1:15-2:15

    Zoom meeting id: 925 2894 7102

    Given a closed simple polygon P, we say two points p,q see each other if the segment pq is fully contained in P. The art gallery problem seeks a smallest set G of guards that sees P completely. Previous algorithms for the art gallery problem either had theoretical run time bounds (not necessarily good ones) but were utterly impractical, or were practical but could take forever on certain inputs without ever terminating. I present an algorithm that has both theoretical guarantees and practical performance.

    This is joint work with Simon Hengeveld.

  • Tuesday, 10/13
    Speaker: Shira Zerbib (Iowa State)
    Title: Cutting Cakes with Topological Hall
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    An r-partite hypergraph is called fractionally balanced if there exists a non-negative function on its edge set that has constant degree in each vertex side. Using a topological version of Hall's theorem, I prove bounds on the matching number of such hypergraphs. Combined with an approach of Meunier and Su (2018), this yields results on envy-free division of multiple cakes, and on rental harmony with multiple houses.

    This is joint work with Ron Aharoni, Eli Berger, Joseph Briggs and Erel Segal-Halevi.

  • Tuesday, 10/20
    Speaker: Geva Yashfe (Hebrew University of Jerusalem)
    Title: Representability of $c$-Arrangements
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    This talk is about two undecidability results in matroid theory and their applications to secret-sharing and to the study of rank inequalities for representable matroids. After a brief discussion of the applications, I will outline a proof that the following problem, together with an approximate variant, is undecidable: given a matroid, decide whether its rank function has a positive multiple which is a representable polymatroid.

    This is based on joint work with Lukas Kühne.

  • Tuesday, 10/27
    Speaker: Michael Dobbins (Binghamton)
    Title: Continuous Dependence of Curvature Flow on Initial Conditions in the Sphere
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    Consider the space of all simple closed curves of area 0 in the sphere that evenly divide the sphere. I will show that the restriction of level-set flow, which is a weakening of curvature flow, to this space is continuous. This was motivated by a problem of showing that the space of weighted pseudoline arrangements is homotopy equivalent to the corresponding rank 3 real Grassmannian.

  • Tuesday, 11/3
    Speaker: Jo Ellis-Monaghan (Korteweg-de Vries Instituut voor Wiskunde, Universiteit van Amsterdam)
    Title: An Introduction to Twualities
    Time: 1:15-2:15
    Place: Zoomland, opening at 11:45.

    Zoom meeting id: 925 2894 7102

    Zoomland LUNCH at noon with the speaker; all invited (no crowding, please).

    We develop tools to identify and generate new surface embeddings of graphs with various forms of self-twuality including geometric duality, Petrie duality, Wilson duality, and both forms of triality (which is like duality, but of order three instead of two). Previous work typically focused on regular maps (special, highly symmetric, embedded graphs), but the methods presented here apply to general embedded graphs. In contrast to Wilson’s very large self-trial map of type {9,9}_9 we show that there are self-trial graphs on as few as three edges. We reduce the search for graphs with some form of self-twuality to the study of one-vertex ribbon graphs. Our results include a fast algorithm that will find all graphs with any of the various forms of self-twuality in the orbit of a graph that is isomorphic to any twisted dual of itself.

    This is joint work with Lowell Abrams (George Washington University).

  • Tuesday, 11/10
    Speaker: Seunghun Lee (Binghamton)
    Title: The Near-$d$-Leray Property of Non-Matching Complexes
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    Given a graph $G$ on the fixed vertex set $V$, the non-matching complex of $G$, denoted by NM$_k(G)$, is the family of all subgraphs $G'$ of $G$ whose matching number $\nu(G')$ is strictly less than $k$. As an attempt to generalize a result by Linusson, Shareshian and Welker, we show that (i) NM$_k(G)$ is $(3k-3)$-Leray, and (ii) if $G$ is bipartite, then NM$_k(G)$ is $(2k-2)$-Leray. This result is obtained by analyzing the homology of the links of non-empty faces of the complex NM$_k(G)$, which vanishes in all dimensions $d \geq 3k-4$, and all dimensions $d \geq 2k-3$ when $G$ is bipartite.

    As a corollary, we have the following rainbow matching theorem, which generalizes a result by Aharoni et al. and Drisko's theorem: Given a graph $G=(V,E)$, let $E_1,\ldots, E_{3k-2}$ be non-empty edge sets (not necessarily disjoint), each colored with a different color, that cover $E$. If $\nu(E_i\cup E_j) \geq k$ for every distinct $i$ and $j$, then $G$ has a rainbow matching (where each edge has a different color) of size $k$. The number of edge sets $E_i$ can be reduced to $2k-1$ when $G$ is bipartite.

    This is a joint work with Andreas Holmsen.

  • Tuesday, 11/17
    Speaker: Vaidy Sivaraman (Mississippi State)
    Title: Double-Threshold Graphs
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    A graph is double-threshold if there exists a weight assignment to its vertices and real numbers $L$, $U$ such that two vertices are adjacent if and only if the sum of their weights is between $L$ and $U$. The class of double-threshold graphs is closed under induced subgraphs but not under complementation. Kobayashi, Okamoto, Otachi, Uno asked whether the set of forbidden induced subgraphs for the class is finite. We answer this question negatively and make progress on determining the complete set of forbidden induced subgraphs.

    This is joint work with Deven Gill.

  • Tuesday, 11/24
    Speaker: Kunle Abawonse (Binghamton)
    Title: Homeomorphism Type of Combinatorial Grassmannnian and Combinatorial Flag Manifold
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    I will consider combinatorial analogues to the Grassmannian G(2,n) and flag manifold G(1,2,n), denoted by MacP(2,n) and MacP(1,2,n) respectively. R. MacPherson conjectured that MacP(2,n) is homeomorphic to G(2,n), while it was later proven by Eric Babson that the manifolds are homotopy equivalent to their respective combinatorial analogues. I will establish that the manifolds are homeomorphic to their combinatorial analogues.

  • Tuesday, 12/1
    Speaker: Benjamin Schröter (KTH Royal Institute of Technology)
    Title: Reconstructibility of Matroid Polytopes
    Paper: arXiv:2010.10227
    Time: 1:15-2:15
    Place: Zoomland, opening at 1:00.

    Zoom meeting id: 925 2894 7102

    My talk will deal with two fundamental objects of discrete mathematics that are closely related - (convex) polytopes and matroids. Both appear in many areas of mathematics, e.g., algebraic geometry, topology and optimization.

    A classical question in polyhedral combinatorics is, 'Does the vertex-edge graph of a d-dimensional polytope determine its face lattice?'. In general the answer is no, but a famous result of Blind and Mani, and later Kalai, is a positive answer to that question for simple polytopes. In my talk I discuss this reconstructability question for the special class of matroid (base) polytopes. Matroids encode an abstract version of dependency and independency, and thus generalize graphs, point configurations in vector spaces and algebraic extensions of fields.

    This is joint work with Guillermo Pineda-Villavicencio.


  • SPRING 2020


    Anticipated Future Talks

    • Speaker: Daniel Slilaty (Wright State)
    • Speaker: Christopher Hanusa (Queens College)
    • Speaker: Bertrand Guenin (Waterloo)
    • Speaker: Zoran Stanic (Belgrade)

    Past Semesters

    seminars/comb/start.txt · Last modified: 2021/02/23 19:23 by zaslav