Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Polytopes (4)
- Ehrhart theory (3)
- Graphs (3)
- Lattice polytope (3)
- Graph theory (2)
-
- Posets (2)
- Simplices (2)
- Affine Symmetric Group (1)
- Algebraic Geometry (1)
- Antipode (1)
- Associahedron (1)
- Boij-Söderberg Decomposition (1)
- Boolean algebras (1)
- Box polynomial (1)
- CD-index (1)
- Cd-index (1)
- Cellular Resolutions (1)
- Chip firing (1)
- Coloring (1)
- Combinatorial game (1)
- Combinatorics Education (1)
- Commutative Algebra (1)
- Connectivity (1)
- Counting (1)
- Counting graph embeddings (1)
- Coxeter groups (1)
- Curves (1)
- Cut polytope (1)
- Cyclic sieving phenomenon (1)
- Deletion and contraction (1)
- Publication Year
Articles 1 - 30 of 32
Full-Text Articles in Discrete Mathematics and Combinatorics
Surjectivity Of The Wahl Map On Cubic Graphs, Angela C. Hanson
Surjectivity Of The Wahl Map On Cubic Graphs, Angela C. Hanson
Theses and Dissertations--Mathematics
Much of algebraic geometry is the study of curves. One tool we use to study curves is whether they can be embedded in a K3 surface or not. If the Wahl map is surjective on a curve, that curve cannot be embedded in a K3 surface. Therefore, studying if the Wahl map is surjective for a particular curve gives us more insight into the properties of that curve. We simplify this problem by converting graph curves to dual graphs. Then the information for graphs can be used to study the underlying curves. We will discuss conditions for the Wahl map …
Methods Of Computing Graph Gonalities, Noah Speeter
Methods Of Computing Graph Gonalities, Noah Speeter
Theses and Dissertations--Mathematics
Chip firing is a category of games played on graphs. The gonality of a graph tells us how many chips are needed to win one variation of the chip firing game. The focus of this dissertation is to provide a variety of new strategies to compute the gonality of various graph families. One family of graphs which this dissertation is particularly interested in is rook graphs. Rook graphs are the Cartesian product of two or more complete graphs and we prove that the gonality of two dimensional rook graphs is the expected value of (n − 1)m where n is …
Geometry Of Pipe Dream Complexes, Benjamin Reese
Geometry Of Pipe Dream Complexes, Benjamin Reese
Theses and Dissertations--Mathematics
In this dissertation we study the geometry of pipe dream complexes with the goal of gaining a deeper understanding of Schubert polynomials. Given a pipe dream complex PD(w) for w a permutation in the symmetric group, we show its boundary is Whitney stratified by the set of all pipe dream complexes PD(v) where v > w in the strong Bruhat order. For permutations w in the symmetric group on n elements, we introduce the pipe dream complex poset P(n). The dual of this graded poset naturally corresponds to the poset of strata associated to the Whitney stratification of the boundary of …
Q-Polymatroids And Their Application To Rank-Metric Codes., Benjamin Jany
Q-Polymatroids And Their Application To Rank-Metric Codes., Benjamin Jany
Theses and Dissertations--Mathematics
Matroid theory was first introduced to generalize the notion of linear independence. Since its introduction, the theory has found many applications in various areas of mathematics including coding theory. In recent years, q-matroids, the q-analogue of matroids, were reintroduced and found to be closely related to the theory of linear vector rank metric codes. This relation was then generalized to q-polymatroids and linear matrix rank metric codes. This dissertation aims at developing the theory of q-(poly)matroid and its relation to the theory of rank metric codes. In a first part, we recall and establish preliminary results for both q-polymatroids and …
Lattice Minors And Eulerian Posets, William Gustafson
Lattice Minors And Eulerian Posets, William Gustafson
Theses and Dissertations--Mathematics
We study a partial ordering on pairings called the uncrossing poset, which first appeared in the literature in connection with a certain stratified space of planar electrical networks. We begin by examining some of the relationships between the uncrossing poset and Catalan combinatorics, and then proceed to study the structure of lower intervals. We characterize the lower intervals in the uncrossing poset that are isomorphic to the face lattice of a cube. Moving up in complexity certain lower intervals are isomorphic to the poset of simple vertex labeled minors of an associated graph.
Inspired by this structure, we define a …
Geometric And Combinatorial Properties Of Lattice Polytopes Defined From Graphs, Kaitlin Bruegge
Geometric And Combinatorial Properties Of Lattice Polytopes Defined From Graphs, Kaitlin Bruegge
Theses and Dissertations--Mathematics
Polytopes are geometric objects that generalize polygons in the plane and polyhedra in 3-dimensional space. Of particular interest in geometric combinatorics are families of lattice polytopes defined from combinatorial objects, such as graphs. In particular, this dissertation studies symmetric edge polytopes (SEPs), defined from simple undirected graphs. In 2019, Higashitani, Jochemko, and Michalek gave a combinatorial description of the hyperplanes that support facets of a symmetric edge polytope in terms of certain labelings of the underlying graph.
Using this framework, we explore the number of facets that can be attained by the symmetric edge polytopes for graphs with certain structure. …
Matrix Interpretations And Tools For Investigating Even Functionals, Benjamin Stringer
Matrix Interpretations And Tools For Investigating Even Functionals, Benjamin Stringer
Theses and Dissertations--Computer Science
Even functionals are a set of polynomials evaluated on the terms of hollow symmetric matrices. Their properties lend themselves to applications such as counting subgraph embeddings in generic (weighted or unweighted) host graphs and computing moments of binary quadratic forms, which occur in combinatorial optimization. This research focuses primarily on counting subgraph embeddings, which is traditionally accomplished with brute-force algorithms or algorithms curated for special types of graphs. Even functionals provide a method for counting subgraphs algebraically in time proportional to matrix multiplication and is not restricted to particular graph types. Counting subgraph embeddings can be accomplished by evaluating a …
Geometric Properties Of Weighted Projective Space Simplices, Derek Hanely
Geometric Properties Of Weighted Projective Space Simplices, Derek Hanely
Theses and Dissertations--Mathematics
A long-standing conjecture in geometric combinatorics entails the interplay between three properties of lattice polytopes: reflexivity, the integer decomposition property (IDP), and the unimodality of Ehrhart h*-vectors. Motivated by this conjecture, this dissertation explores geometric properties of weighted projective space simplices, a class of lattice simplices related to weighted projective spaces.
In the first part of this dissertation, we are interested in which IDP reflexive lattice polytopes admit regular unimodular triangulations. Let Delta(1,q)denote the simplex corresponding to the associated weighted projective space whose weights are given by the vector (1,q). Focusing on the case where Delta …
On Flow Polytopes, Nu-Associahedra, And The Subdivision Algebra, Matias Von Bell
On Flow Polytopes, Nu-Associahedra, And The Subdivision Algebra, Matias Von Bell
Theses and Dissertations--Mathematics
This dissertation studies the geometry and combinatorics related to a flow polytope Fcar(ν) constructed from a lattice path ν, whose volume is given by the ν-Catalan numbers. It begins with a study of the ν-associahedron introduced by Ceballos, Padrol, and Sarmiento in 2019, but from the perspective of Schröder combinatorics. Some classical results for Schröder paths are extended to the ν-setting, and insights into the geometry of the ν-associahedron are obtained by describing its face poset with two ν-Schröder objects. The ν-associahedron is then shown to be dual to a framed triangulation of Fcar(ν), which is a …
Combinatorial Invariants Of Rational Polytopes, Andrés R. Vindas Meléndez
Combinatorial Invariants Of Rational Polytopes, Andrés R. Vindas Meléndez
Theses and Dissertations--Mathematics
The first part of this dissertation deals with the equivariant Ehrhart theory of the permutahedron. As a starting point to determining the equivariant Ehrhart theory of the permutahedron, Ardila, Schindler, and I obtain a volume formula for the rational polytopes that are fixed by acting on the permutahedron by a permutation, which generalizes a result of Stanley’s for the volume for the standard permutahedron. Building from the aforementioned work, Ardila, Supina, and I determine the equivariant Ehrhart theory of the permutahedron, thereby resolving an open problem posed by Stapledon. We provide combinatorial descriptions of the Ehrhart quasipolynomial and Ehrhart series …
A Tropical Approach To The Brill-Noether Theory Over Hurwitz Spaces, Kaelin Cook-Powell
A Tropical Approach To The Brill-Noether Theory Over Hurwitz Spaces, Kaelin Cook-Powell
Theses and Dissertations--Mathematics
The geometry of a curve can be analyzed in many ways. One way of doing this is to study the set of all divisors on a curve of prescribed rank and degree, known as a Brill-Noether variety. A sequence of results, starting in the 1980s, answered several fundamental questions about these varieties for general curves. However, many of these questions are still unanswered if we restrict to special families of curves. This dissertation has three main goals. First, we examine Brill-Noether varieties for these special families and provide combinatorial descriptions of their irreducible components. Second, we provide a natural generalization …
Graph-Theoretic Simplicial Complexes, Hajos-Type Constructions, And K-Matchings, Julianne Vega
Graph-Theoretic Simplicial Complexes, Hajos-Type Constructions, And K-Matchings, Julianne Vega
Theses and Dissertations--Mathematics
A graph property is monotone if it is closed under the removal of edges and vertices. Given a graph G and a monotone graph property P, one can associate to the pair (G,P) a simplicial complex, which serves as a way to encode graph properties within faces of a topological space. We study these graph-theoretic simplicial complexes using combinatorial and topological approaches as a way to inform our understanding of the graphs and their properties.
In this dissertation, we study two families of simplicial complexes: (1) neighborhood complexes and (2) k-matching complexes. A neighborhood complex is a simplicial …
Algebraic And Geometric Properties Of Hierarchical Models, Aida Maraj
Algebraic And Geometric Properties Of Hierarchical Models, Aida Maraj
Theses and Dissertations--Mathematics
In this dissertation filtrations of ideals arising from hierarchical models in statistics related by a group action are are studied. These filtrations lead to ideals in polynomial rings in infinitely many variables, which require innovative tools. Regular languages and finite automata are used to prove and explicitly compute the rationality of some multivariate power series that record important quantitative information about the ideals. Some work regarding Markov bases for non-reducible models is shown, together with advances in the polyhedral geometry of binary hierarchical models.
Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok
Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok
Theses and Dissertations--Mathematics
This dissertation is devoted to the study of the geometric properties of subspace configurations, with an emphasis on configurations of points. One distinguishing feature is the widespread use of techniques from Matroid Theory and Combinatorial Optimization. In part we generalize a theorem of Edmond's about partitions of matroids in independent subsets. We then apply this to establish a conjectured bound on the Castelnuovo-Mumford regularity of a set of fat points.
We then study how the dimension of an ideal of point changes when intersected with a generic fat subspace. In particular we introduce the concept of a ``very unexpected hypersurface'' …
Lattice Simplices: Sufficiently Complicated, Brian Davis
Lattice Simplices: Sufficiently Complicated, Brian Davis
Theses and Dissertations--Mathematics
Simplices are the "simplest" examples of polytopes, and yet they exhibit much of the rich and subtle combinatorics and commutative algebra of their more general cousins. In this way they are sufficiently complicated --- insights gained from their study can inform broader research in Ehrhart theory and associated fields.
In this dissertation we consider two previously unstudied properties of lattice simplices; one algebraic and one combinatorial. The first is the Poincar\'e series of the associated semigroup algebra, which is substantially more complicated than the Hilbert series of that same algebra. The second is the partial ordering of the elements of …
Bounding The Number Of Compatible Simplices In Higher Dimensional Tournaments, Karthik Chandrasekhar
Bounding The Number Of Compatible Simplices In Higher Dimensional Tournaments, Karthik Chandrasekhar
Theses and Dissertations--Mathematics
A tournament graph G is a vertex set V of size n, together with a directed edge set E ⊂ V × V such that (i, j) ∈ E if and only if (j, i) ∉ E for all distinct i, j ∈ V and (i, i) ∉ E for all i ∈ V. We explore the following generalization: For a fixed k we orient every k-subset of V by assigning it an orientation. That is, every facet of the (k − 1)-skeleton of the ( …
A Combinatorial Miscellany: Antipodes, Parking Cars, And Descent Set Powers, Alexander Thomas Happ
A Combinatorial Miscellany: Antipodes, Parking Cars, And Descent Set Powers, Alexander Thomas Happ
Theses and Dissertations--Mathematics
In this dissertation we first introduce an extension of the notion of parking functions to cars of different sizes. We prove a product formula for the number of such sequences and provide a refinement using a multi-parameter extension of the Abel--Rothe polynomial. Next, we study the incidence Hopf algebra on the noncrossing partition lattice. We demonstrate a bijection between the terms in the canceled chain decomposition of its antipode and noncrossing hypertrees. Thirdly, we analyze the sum of the 𝑟th powers of the descent set statistic on permutations and how many small prime factors occur in these numbers. These results …
Polytopes Associated To Graph Laplacians, Marie Meyer
Polytopes Associated To Graph Laplacians, Marie Meyer
Theses and Dissertations--Mathematics
Graphs provide interesting ways to generate families of lattice polytopes. In particular, one can use matrices encoding the information of a finite graph to define vertices of a polytope. This dissertation initiates the study of the Laplacian simplex, PG, obtained from a finite graph G by taking the convex hull of the columns of the Laplacian matrix for G. The Laplacian simplex is extended through the use of a parallel construction with a finite digraph D to obtain the Laplacian polytope, PD.
Basic properties of both families of simplices, PG and P …
Hilbert Bases, Descent Statistics, And Combinatorial Semigroup Algebras, Mccabe J. Olsen
Hilbert Bases, Descent Statistics, And Combinatorial Semigroup Algebras, Mccabe J. Olsen
Theses and Dissertations--Mathematics
The broad topic of this dissertation is the study of algebraic structure arising from polyhedral geometric objects. There are three distinct topics covered over three main chapters. However, each of these topics are further linked by a connection to the Eulerian polynomials.
Chapter 2 studies Euler-Mahonian identities arising from both the symmetric group and generalized permutation groups. Specifically, we study the algebraic structure of unit cube semigroup algebra using Gröbner basis methods to acquire these identities. Moreover, this serves as a bridge between previous methods involving polyhedral geometry and triangulations with descent bases methods arising in representation theory.
In Chapter …
Some Take-Away Games On Discrete Structures, Kristen M. Barnard
Some Take-Away Games On Discrete Structures, Kristen M. Barnard
Theses and Dissertations--Mathematics
The game of Subset Take-Away is an impartial combinatorial game posed by David Gale in 1974. The game can be played on various discrete structures, including but not limited to graphs, hypergraphs, polygonal complexes, and partially ordered sets. While a universal winning strategy has yet to be found, results have been found in certain cases. In 2003 R. Riehemann focused on Subset Take-Away on bipartite graphs and produced a complete game analysis by studying nim-values. In this work, we extend the notion of Take-Away on a bipartite graph to Take-Away on particular hypergraphs, namely oddly-uniform hypergraphs and evenly-uniform hypergraphs whose …
Influences Of Probability Instruction On Undergraduates' Understanding Of Counting Processes, Kayla Blyman
Influences Of Probability Instruction On Undergraduates' Understanding Of Counting Processes, Kayla Blyman
Theses and Dissertations--Education Sciences
Historically, students in an introductory finite mathematics course at a major university in the mid-south have struggled the most with the counting and probability unit, leading instructors to question if there was a better way to help students master the material. The purpose of this study was to begin to understand connections that undergraduate finite mathematics students are making between counting and probability. By examining student performance in counting and probability, this study provides insights that inform future instruction in courses that include counting and probability. Consequently, this study lays the groundwork for future inquiries in the field of undergraduate …
Colorings Of Hamming-Distance Graphs, Isaiah H. Harney
Colorings Of Hamming-Distance Graphs, Isaiah H. Harney
Theses and Dissertations--Mathematics
Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into …
The Partition Lattice In Many Guises, Dustin G. Hedmark
The Partition Lattice In Many Guises, Dustin G. Hedmark
Theses and Dissertations--Mathematics
This dissertation is divided into four chapters. In Chapter 2 the equivariant homology groups of upper order ideals in the partition lattice are computed. The homology groups of these filters are written in terms of border strip Specht modules as well as in terms of links in an associated complex in the lattice of compositions. The classification is used to reproduce topological calculations of many well-studied subcomplexes of the partition lattice, including the d-divisible partition lattice and the Frobenius complex. In Chapter 3 the box polynomial B_{m,n}(x) is defined in terms of all integer partitions that fit in an m …
On Independence, Matching, And Homomorphism Complexes, Wesley K. Hough
On Independence, Matching, And Homomorphism Complexes, Wesley K. Hough
Theses and Dissertations--Mathematics
First introduced by Forman in 1998, discrete Morse theory has become a standard tool in topological combinatorics. The main idea of discrete Morse theory is to pair cells in a cellular complex in a manner that permits cancellation via elementary collapses, reducing the complex under consideration to a homotopy equivalent complex with fewer cells. In chapter 1, we introduce the relevant background for discrete Morse theory.
In chapter 2, we define a discrete Morse matching for a family of independence complexes that generalize the matching complexes of suitable "small" grid graphs. Using this matching, we determine the dimensions of the …
New Perspectives Of Quantum Analogues, Yue Cai
New Perspectives Of Quantum Analogues, Yue Cai
Theses and Dissertations--Mathematics
In this dissertation we discuss three problems. We first show the classical q-Stirling numbers of the second kind can be expressed more compactly as a pair of statistics on a subset of restricted growth words. We extend this enumerative result via a decomposition of a new poset which we call the Stirling poset of the second kind. The Stirling poset of the second kind supports an algebraic complex and a basis for integer homology is determined. A parallel enumerative, poset theoretic and homological study for the q-Stirling numbers of the first kind is done. We also give a bijective …
Flag F-Vectors Of Polytopes With Few Vertices, Sarah A. Nelson
Flag F-Vectors Of Polytopes With Few Vertices, Sarah A. Nelson
Theses and Dissertations--Mathematics
We may describe a polytope P as the convex hull of n points in space. Here we consider the numbers of chains of faces of P. The toric g-vector and CD-index of P are useful invariants for encoding this information. For a simplicial polytope P, Lee defined the winding number wk in a Gale diagram corresponding to P. He showed that wk in the Gale diagram equals gk of the corresponding polytope. In this dissertation, we fully establish how to compute the g-vector for any polytope with few vertices from its …
Deletion-Induced Triangulations, Clifford T. Taylor
Deletion-Induced Triangulations, Clifford T. Taylor
Theses and Dissertations--Mathematics
Let d > 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we lift into ℝd+1. Further let k be an integer satisfying 0 ≤ k ≤ n-(d+2) and assign to each k-subset of the points of A a (regular) triangulation obtained by deleting the specified k-subset and projecting down the lower hull of the convex hull of the resulting lifting. Next, for each triangulation we form the characteristic vector defined by Gelfand, Kapranov, and Zelevinsky by assigning to each …
Polyhedral Problems In Combinatorial Convex Geometry, Liam Solus
Polyhedral Problems In Combinatorial Convex Geometry, Liam Solus
Theses and Dissertations--Mathematics
In this dissertation, we exhibit two instances of polyhedra in combinatorial convex geometry. The first instance arises in the context of Ehrhart theory, and the polyhedra are the central objects of study. The second instance arises in algebraic statistics, and the polyhedra act as a conduit through which we study a nonpolyhedral problem.
In the first case, we examine combinatorial and algebraic properties of the Ehrhart h*-polynomial of the r-stable (n,k)-hypersimplices. These are a family of polytopes which form a nested chain of subpolytopes within the (n,k)-hypersimplex. We show that a well-studied unimodular triangulation of the (n,k)-hypersimplex restricts to a …
Combinatorial Potpourri: Permutations, Products, Posets, And Pfaffians, Norman B. Fox
Combinatorial Potpourri: Permutations, Products, Posets, And Pfaffians, Norman B. Fox
Theses and Dissertations--Mathematics
In this dissertation we first examine the descent set polynomial, which is defined in terms of the descent set statistics of the symmetric group. Algebraic and topological tools are used to explain why large classes of cyclotomic polynomials are factors of the descent set polynomial. Next the diamond product of two Eulerian posets is studied, particularly by examining the effect this product has on their cd-indices. A combinatorial interpretation involving weighted lattice paths is introduced to describe the outcome of applying the diamond product operator to two cd-monomials. Then the cd-index is defined for infinite posets, with …
Unimodality Questions In Ehrhart Theory, Robert Davis
Unimodality Questions In Ehrhart Theory, Robert Davis
Theses and Dissertations--Mathematics
An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal h*-vector.Although various sufficient conditions have been found, necessary conditions remain a challenge. Highly-structured polytopes, such as the polytope of real doubly-stochastic matrices, have been proven to possess unimodal h*-vectors, but the same is unknown even for small variations of it.
In this dissertation, we mainly consider two particular classes of polytopes: reflexive simplices and the polytope of symmetric real doubly-stochastic matrices. For the first class, we discuss an operation that preserves reflexivity, integral closure, and unimodality of the h* …