It is known that knot homologies admit a physical description as spaces of open BPS states. We study operators and algebras acting on these spaces. This leads to a very rich story, which involves wall crossing phenomena, algebras of closed BPS states acting on spaces of open BPS states, and deformations of Landau-Ginzburg models. One important application to knot homologies is the existence of ...

Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the smallest set of initially colored vertices which forces the entire graph to eventually become colored. Connected forcing is a variant of zero forcing in which t...

Kierstead, H.A. and W.T. Trotter. Colorful induced subgraphs, Discrete Mathematics 101 (1992) 165-169. A colored graph is a graph whose vertices have been properly, though not necessarily optimally colored, with integers. Colored graphs have a natural orientation in which edges are directed from the end point with smaller color to the end point with larger color. A subgraph of a colored graph i...

If the electroweak symmetry breaking sector contains colored particles weighing a few hundred GeV, then they will be copiously produced at a hadron supercollider. Colored technipions can rescatter into pairs of gauge bosons. As proposed by Bagger, Dawson, and Valencia, this leads to gauge boson pair rates far larger than in the standard model. In this note we reconsider this mechanism, and illu...

A novel inattention search paradigm (Mack & Rock, 1998) was used to assess the visual efficiency of fluorescent colored relative to nonfluorescent colored highway signs in a laboratory setting. Unexpected presentation of a fluorescent colored search target was not accompanied by an improvement in visual search time. However, visual search times improved dramatically once the participants develo...

The monochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In general, to determine this number is very difficult. For 2edge-colored complete multipartite graph, Kaneko, Kano, and Suzuki gave the exa...

Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set – a smallest set of initially colored vertices which forces the entire graph to be colored. We show that the problem remains NP-hard when the initially colored set induces a connected subgraph. We also ...