Mount Allison University

output

19972026

most citedRobustness of coherence: An operational and observable measure of quantum coherence

590 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

7 papers · 1 filter

math.CO2024

Discrete-time treatment number

N. E. Clarke, K. L. Collins, M. E. Messinger +2

We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our…

math.CO2024★ 2 cited

The Factor Width Rank of a Matrix

Nathaniel Johnston, Shirin Moein, Sarah Plosker

A matrix is said to have factor width at most $k$ if it can be written as a sum of positive semidefinite matrices that are non-zero only in a single $k \times k$ principal submatri…

math.CO2024

Eulerian $k$ -dominating reconfiguration graphs

M. E. Messinger, A. Porter

For a graph $G$ , the vertices of the $k$ -dominating graph, denoted $D_{k} (G)$ , correspond to the dominating sets of $G$ with cardinality at most $k$ . Two vertices of $\math…

math.CO2023★ 2 cited

Laplacian ${- 1, 0, 1}$ - and ${- 1, 1}$ -diagonalizable graphs

Nathaniel Johnston, Sarah Plosker

A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagona…

math.CO2023★ 4 cited

A New Formula for the Determinant and Bounds on Its Tensor and Waring Ranks

Robin Houston, Adam P. Goucher, Nathaniel Johnston

We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show…

math.CO2022★ 3 cited

Real Schur norms and Hadamard matrices

John Holbrook, Nathaniel Johnston, Jean-Pierre Schoch

We present a preliminary study of Schur norms $∥ M ∥_{S} = max {∥ M \circ C ∥ : ∥ C ∥ = 1}$ , where M is a matrix whose entries are $\pm 1$ , and $\circ$ denotes the entrywise (i.e., Sch…

math.CO2019

A Note on the Parallel Cleaning of Cliques

Alejandro Angeli Ayello, Margaret-Ellen Messinger

We disprove a conjecture proposed in [Gaspers et al., Discrete Applied Mathematics, 2010] and provide a new upper bound for the minimum number of brushes required to continually pa…