Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Lattice Point Counting And Height Bounds Over Number Fields And Quaternion Algebras, Lenny Fukshansky, Glenn Henshaw
Lattice Point Counting And Height Bounds Over Number Fields And Quaternion Algebras, Lenny Fukshansky, Glenn Henshaw
CMC Faculty Publications and Research
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit applications of a particular estimate of this sort to several counting problems in number theory: counting integral points and units of bounded height over number fields, counting points of bounded height over positive definite quaternion algebras, and counting points of bounded height with a fixed support over global function fields. Our arguments use a collection of height comparison inequalities for heights over a number …
A Discrete Approach To The Poincare-Miranda Theorem, Connor Thomas Ahlbach
A Discrete Approach To The Poincare-Miranda Theorem, Connor Thomas Ahlbach
HMC Senior Theses
The Poincare-Miranda Theorem is a topological result about the existence of a zero of a function under particular boundary conditions. In this thesis, we explore proofs of the Poincare-Miranda Theorem that are discrete in nature - that is, they prove a continuous result using an intermediate lemma about discrete objects. We explain a proof by Tkacz and Turzanski that proves the Poincare-Miranda theorem via the Steinhaus Chessboard Theorem, involving colorings of partitions of n-dimensional cubes. Then, we develop a new proof of the Poincare-Miranda Theorem that relies on a polytopal generalization of Sperner's Lemma of Deloera - Peterson - Su. …
Chip Firing Games And Riemann-Roch Properties For Directed Graphs, Joshua Z. Gaslowitz
Chip Firing Games And Riemann-Roch Properties For Directed Graphs, Joshua Z. Gaslowitz
HMC Senior Theses
The following presents a brief introduction to tropical geometry, especially tropical curves, and explains a connection to graph theory. We also give a brief summary of the Riemann-Roch property for graphs, established by Baker and Norine (2007), as well as the tools used in their proof. Various generalizations are described, including a more thorough description of the extension to strongly connected directed graphs by Asadi and Backman (2011). Building from their constructions, an algorithm to determine if a directed graph has Row Riemann-Roch Property is given and thoroughly explained.
Hypergraph Capacity With Applications To Matrix Multiplication, John Lee Thompson Peebles Jr.
Hypergraph Capacity With Applications To Matrix Multiplication, John Lee Thompson Peebles Jr.
HMC Senior Theses
The capacity of a directed hypergraph is a particular numerical quantity associated with a hypergraph. It is of interest because of certain important connections to longstanding conjectures in theoretical computer science related to fast matrix multiplication and perfect hashing as well as various longstanding conjectures in extremal combinatorics.
We give an overview of the concept of the capacity of a hypergraph and survey a few basic results regarding this quantity. Furthermore, we discuss the Lovász number of an undirected graph, which is known to upper bound the capacity of the graph (and in practice appears to be the best such …
Chromatic Bounds On Orbital Chromatic Roots, Dae Hyun Kim, Alexander H. Mun, Mohamed Omar
Chromatic Bounds On Orbital Chromatic Roots, Dae Hyun Kim, Alexander H. Mun, Mohamed Omar
All HMC Faculty Publications and Research
Given a group G of automorphisms of a graph Γ, the orbital chromatic polynomial OPΓ,G(x) is the polynomial whose value at a positive integer k is the number of orbits of G on proper k-colorings of Γ. In \cite{Cameron}, Cameron et. al. explore the roots of orbital chromatic polynomials, and in particular prove that orbital chromatic roots are dense in R, extending Thomassen's famous result (see \cite{Thomassen}) that chromatic roots are dense in [32/27,∞). Cameron et al \cite{Cameron} further conjectured that the real roots of the orbital chromatic polynomial of any graph are bounded above by the largest real root …