Bounds On The Expected Size Of The Maximum Agreement Subtree, 2016 The Ohio State University

#### Bounds On The Expected Size Of The Maximum Agreement Subtree, Colby Long, Daniel Irving Bernstein, Lam Si Tung Ho, Mike Steel, Katherine St. John, Seth Sullivant

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

Exploring The Space Of Rna Secondary Structures, 2016 Georgia Institute of Technology

#### Exploring The Space Of Rna Secondary Structures, Heather C. Smith

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

Markov Chains On Graphical Models Of Gene Regulation, 2016 Georgia Institute of Technology

#### Markov Chains On Graphical Models Of Gene Regulation, Megan Bernstein

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

Genome Rearrangement: Graphs And Matrices, 2016 Emory University

#### Genome Rearrangement: Graphs And Matrices, Jeffrey Davis

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

On The Expected Number Of Crossings In A Tanglegram, 2016 University of South Carolina

#### On The Expected Number Of Crossings In A Tanglegram, Eva Czabarka

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

On The Perfect Reconstruction Of The Structure Of Dynamic Networks, 2016 University of Dayton

#### On The Perfect Reconstruction Of The Structure Of Dynamic Networks, Alan Veliz-Cuba

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

Spectral Graph Theory And New Stability Measures For Deterministic Gene Regulatory Networks, 2016 Illinois State University

#### Spectral Graph Theory And New Stability Measures For Deterministic Gene Regulatory Networks, Fusun Akman, Devin Akman

*Annual Symposium on Biomathematics and Ecology: Education and Research*

No abstract provided.

Rogers-Ramanujan Computer Searches, 2016 West Chester University of Pennsylvania

#### Rogers-Ramanujan Computer Searches, James Mclaughlin, Andrew Sills, Peter Zimmer

*James McLaughlin*

We describe three computer searches (in PARI/GP, Maple, and Mathematica, respectively) which led to the discovery of a number of identities of Rogers–Ramanujan type and identities of false theta functions.

Preservers Of Term Ranks And Star Cover Numbers Of Symmetric Matrices, 2016 Utah State University

#### Preservers Of Term Ranks And Star Cover Numbers Of Symmetric Matrices, Leroy B. Beasley

*Electronic Journal of Linear Algebra*

Let $\S$ denote the set of symmetric matrices over some semiring, $\s$. A line of $A\in\S$ is a row or a column of $A$. A star of $A$ is the submatrix of $A$ consisting of a row and the corresponding column of $A$. The term rank of $A$ is the minimum number of lines that contain all the nonzero entries of $A$. The star cover number is the minimum number of stars that contain all the nonzero entries of $A$. This paper investigates linear operators that preserve sets of symmetric matrices of specified term rank and sets of ...

Induced Subgraph Saturated Graphs, 2016 University of New England

#### Induced Subgraph Saturated Graphs, Craig M. Tennenhouse

*Theory and Applications of Graphs*

A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the addition of any edge between non-adjacent vertices in $G$ creates one. While induced subgraphs are often studied in the extremal case with regard to the removal of edges, we extend saturation to induced subgraphs. We say that $G$ is \emph{induced $H$-saturated} if $G$ contains no induced subgraph isomorphic to $H$ and the addition of any edge to $G$ results in an induced copy of $H$. We demonstrate constructively that there are non-trivial examples of saturated graphs for all ...

Improving Proof-Writing With Reading Guides, 2016 Dordt College

#### Improving Proof-Writing With Reading Guides, Mike Janssen

*Faculty Work: Comprehensive List*

One of the barriers in the transition to advanced mathematics is that the proofs and ideas in even the best mathematics texts must be read more carefully than many students are accustomed to. Yet in order to learn to write proofs well, one must learn how to read proofs well. Borrowing an idea from Lewis Ludwig, I flipped my introduction to proofs (discrete structures) course in Spring 2016 with the use of reading guides. Each day, students were responsible for reading a section of the text and completing a worksheet that highlighted the main points, asked students to create their ...

Potentially Eventually Positive Star Sign Patterns, 2016 Huaiyin Institute of Technology

#### Potentially Eventually Positive Star Sign Patterns, Yu Ber-Lin, Huang Ting-Zhu, Jie Cui, Deng Chunhua

*Electronic Journal of Linear Algebra*

An $n$-by-$n$ real matrix $A$ is eventually positive if there exists a positive integer $k_{0}$ such that $A^{k}>0$ for all $k\geq k_{0}$. An $n$-by-$n$ sign pattern $\mathcal{A}$ is potentially eventually positive (PEP) if there exists an eventually positive real matrix $A$ with the same sign pattern as $\mathcal{A}$. An $n$-by-$n$ sign pattern $\mathcal{A}$ is a minimal potentially eventually positive sign pattern (MPEP sign pattern) if $\mathcal{A}$ is PEP and no proper subpattern of $\mathcal{A}$ is PEP. Berman, Catral, Dealba, et al. [Sign patterns that ...

Combinatorics Of The Sonnet, 2016 The Open University

#### Combinatorics Of The Sonnet, Terry S. Griggs

*Journal of Humanistic Mathematics*

Using a definition of a sonnet, the number of basic rhyming schemes is enumerated. This is then used to discuss the 86 sonnets which appear in John Clare's *The Rural Muse*.

Hybrid Proofs Of The Q-Binomial Theorem And Other Identities, 2016 University of California - Irvine

#### Hybrid Proofs Of The Q-Binomial Theorem And Other Identities, Dennis Eichhorn, James Mclaughlin, Andrew V. Sills

*James McLaughlin*

No abstract provided.

Polynomial Generalizations Of Two-Variable Ramanujan Type Identities, 2016 West Chester University of Pennsylvania

#### Polynomial Generalizations Of Two-Variable Ramanujan Type Identities, James Mclaughlin, Andrew V. Sills

*James McLaughlin*

No abstract provided.

A New Summation Formula For Wp-Bailey Pairs, 2016 West Chester University of Pennsylvania

#### A New Summation Formula For Wp-Bailey Pairs, James Mclaughlin

*James McLaughlin*

No abstract provided.

Graphs With Reciprocal Eigenvalue Properties, 2016 IIT GUWAHATI

#### Graphs With Reciprocal Eigenvalue Properties, Swarup Kumar Panda, Sukanta Pati

*Electronic Journal of Linear Algebra*

In this paper, only simple graphs are considered. A graph G is nonsingular if its adjacency matrix A(G) is nonsingular. A nonsingular graph G satisfies reciprocal eigenvalue property (property R) if the reciprocal of each eigenvalue of the adjacency matrix A(G) is also an eigenvalue of A(G) and G satisfies strong reciprocal eigenvalue property (property SR) if the reciprocal of each eigenvalue of the adjacency matrix A(G) is also an eigenvalue of A(G) and they both have the same multiplicities. From the definitions property SR implies property R. Furthermore, for some classes of graphs (for ...

Kemeny's Constant And An Analogue Of Braess' Paradox For Trees, 2016 University of Manitoba

#### Kemeny's Constant And An Analogue Of Braess' Paradox For Trees, Steve Kirkland, Ze Zeng

*Electronic Journal of Linear Algebra*

Given an irreducible stochastic matrix M, Kemeny’s constant K(M) measures the expected time for the corresponding Markov chain to transition from any given initial state to a randomly chosen final state. A combinatorially based expression for K(M) is provided in terms of the weights of certain directed forests in a directed graph associated with M, yielding a particularly simple expression in the special case that M is the transition matrix for a random walk on a tree. An analogue of Braess’ paradox is investigated, whereby inserting an edge into an undirected graph can increase the value of ...

Classifying Resolving Lists By Distances Between Members, 2016 University of Texas of the Permian Basin

#### Classifying Resolving Lists By Distances Between Members, Paul Feit

*Theory and Applications of Graphs*

L

Let $G$ be a connected graph and let $w_1,\cdots w_r$ be a list of vertices. We refer the choice of a triple $(r;G;w_1,\cdots w_r)$, as a {\em metric selection.} Let $\rho$ be the shortest path metric of $G$. We say that $w_1,\cdots w_r$ {\em resolves $G$ (metricly)\/} if the function $c:V(G)\mapsto\bbz^r$ given by

\[ x\mapsto (\rho (w_1,x),\cdots ,\rho (w_r,x))\]

is injective. We refer to this function the {\em code map,} and to its image as the {\em codes\/} of the triple $(r;G;w_1,\cdots ,w_r ...

Group-Antimagic Labelings Of Multi-Cyclic Graphs, 2016 Illinois Wesleyan University

#### Group-Antimagic Labelings Of Multi-Cyclic Graphs, Dan Roberts, Richard M. Low

*Theory and Applications of Graphs*

Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$ $\{f(u,v): (u, v) \in E(G) \}$, is a one-to-one map. The \textit{integer-antimagic spectrum} of a graph $G$ is the set IAM$(G) = \{k: G \textnormal{ is } \mathbb{Z}_k\textnormal{-antimagic and } k \geq 2\}$. In this paper, we analyze the integer-antimagic spectra for various classes of multi-cyclic graphs.