Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Polytopes (2)
- Algebraic Geometry (1)
- Boij-Söderberg Decomposition (1)
- Box polynomial (1)
- Cellular Resolutions (1)
-
- Coloring (1)
- Commutative Algebra (1)
- Equivariant Hilbert series (1)
- Fat Points (1)
- Filter (1)
- Fundamental parallelepiped (1)
- Gorenstein (1)
- Graphs (1)
- Hamming distance (1)
- Hierarchical models (1)
- Machine Learning (1)
- Markov bases (1)
- Mathematics (1)
- Matroids (1)
- Partition lattice (1)
- Poincaré series (1)
- Polyhedral geometry (1)
- Posets (1)
- Q-Matroids (1)
- Q-Polymatroids (1)
- Q-ary block codes (1)
- Rank-metric codes (1)
- Simplices (1)
- Stabilization (1)
- Stirling numbers (1)
Articles 1 - 7 of 7
Full-Text Articles in Algebra
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 …
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 …
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 …
Boij-Söderberg Decompositions, Cellular Resolutions, And Polytopes, Stephen Sturgeon
Boij-Söderberg Decompositions, Cellular Resolutions, And Polytopes, Stephen Sturgeon
Theses and Dissertations--Mathematics
Boij-Söderberg theory shows that the Betti table of a graded module can be written as a linear combination of pure diagrams with integer coefficients. In chapter 2 using Ferrers hypergraphs and simplicial polytopes, we provide interpretations of these coefficients for ideals with a d-linear resolution, their quotient rings, and for Gorenstein rings whose resolution has essentially at most two linear strands. We also establish a structural result on the decomposition in the case of quasi-Gorenstein modules. These results are published in the Journal of Algebra, see [25].
In chapter 3 we provide some further results about Boij-Söderberg decompositions. We …