SearcharxivSearch

arXiv subjects

Connor Donovan

Publications and source records attributed to Connor Donovan.

4 recordsLinked to original sources

The Feynman path integral formulation of non-dispersive Airy wave packets and their applications to the heavy meson mass spectra and ultra-cold neutrons

We demonstrate the non-spreading behavior of Airy wave packets utilizing the Feynman path integral formulation of a linear potential, the Airy functions' zeros correspondence to heavy-meson mass spectroscopy, and their implications to the eigenstates of ultra-cold neutrons in Earth's gravitational field. We derive the linear kernel, and utilize the Feynman path integral time evolution to show that Airy function wave packets are non-dispersive in free space. We then model the confining contribution to 1S - 2S heavy meson mass gaps as a 1+1D absolute linear potential and look at the correspondence of the Airy function zeros. In doing so, we predicted the confining contribution to the mass gap of heavy mesons with a good accuracy when compared to calculations performed in the light front. Furthermore, we used these Airy function solutions to model the quantum states of a neutron under Earth's gravity. We show that the measured heights of a neutron can be modeled by the zeros of the Airy function, and compare to experimental data and predictions utilizing the WKB approximation.

hep-ph

Colorful and Quantitative Variations of Krasnosselsky's Theorem

Krasnosselsky's art gallery theorem gives a combinatorial characterization of star-shaped sets in Euclidean spaces, similar to Helly's characterization of finite families of convex sets with non-empty intersection. We study colorful and quantitative variations of Krasnosselsky's result. In particular, we are interested in conditions on a set $K$ that guarantee there exists a measurably large set $K'$ such that every point in $K'$ can see every point in $K$. We prove results guaranteeing the existence of $K'$ with large volume or large diameter.

math.CO

Star clusters in the Matching, Morse, and Generalized Morse complex

In this paper, we determine the homotopy type of the Morse complex and matching complex of multiple families of complexes by utilizing star cluster collapses and the Cluster Lemma. We compute the homotopy type of the Morse complex of an extended notion of a star graph, as well as the homotopy type of the matching complex of a Dutch windmill graph. Additionally, we provide alternate computations of the homotopy type of the Morse complex of paths, the homotopy type of the matching complex of paths, and the homotopy type of the matching complex of cycles. We then use this same method of computing homotopy types to investigate the relationship between the homotopy type of the matching complex and the generalized Morse complex.

math.AT

On the homotopy and strong homotopy type of complexes of discrete Morse functions

In this paper, we determine the homotopy type of the Morse complex of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if $K$ contains two leaves that share a common vertex, then the Morse complex is strongly collapsible and hence has the homotopy type of a point. We also show that the pure Morse complex of a tree is strongly collapsible, thereby recovering as a corollary a result of Ayala et al. In addition, we prove that the Morse complex of a disjoint union $K\sqcup L$ is the Morse complex of the join $K*L$. This result is used to compute the homotopy type of the Morse complex of some families of graphs, including Caterpillar graphs, as well as the automorphism group of a disjoint union for a large collection of disjoint complexes.

math.AT