We partition the fast escaping set of a transcendental entire function into two subsets, the maximally fast escaping set and the non-maximally fast escaping set. These sets are shown to have strong dynamical properties. We show that the intersection of the Julia set with the non-maximally fast escaping set is never empty. The proof uses a new covering result for annuli, which is of wider intere...

Planning for a successful MIS implementation requires understanding the effects of the introduction of a new system on the work lives of potential adopters. The effects can be assessed by the MIS practitioner/ change agent ff the agent will first obtain a thorough and specific understanding of the task activities performed by potential adopters, the interactions they engage in as they perform t...

This note investigates the noncooperative foundations of von Neumann-Morgenstern (vN-M) stable sets in voting games. To do so, we study subgame perfect equilibria of a noncooperative legislative bargaining game, based on underlying simple games. The following results emerge from such an exercise: Every stable set of the underlying simple game is the limit set of undominated pure-strategy Markov...

Experiential learning activities (ELAs) that are industry-partnered and real-world problem-based can provide undergraduate students with concrete experiences of using information technologies in the field. Flow theory provides a theoretical basis to guide the design of ELAs, ensuring that the goals are clear, feedback is explicit, and the challenges and skills are balanced. Based on this theory...

We determine the maximal cocliques of size ≥ 4q2 + 5q + 5 in the Kneser graph on point-plane flags in PG(4, q). The maximal size of a coclique in this graph is (q2 + q + 1)(q3 + q2 + q + 1).

We show that the independent set sequence of a bipartite graph need not be unimodal.

The direct product of graphs G = (V (G), E(G)) and H = (V (H), E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We prove that every maximum independent set in Pn×G, respectively Cm×G, is of the form (A×C)∪(B× D), where C and D are nonadjacent in G, and A∪...

given a non-abelian finite group $g$, let $pi(g)$ denote the set of prime divisors of the order of $g$ and denote by $z(g)$ the center of $g$. thetextit{ prime graph} of $g$ is the graph with vertex set $pi(g)$ where two distinct primes $p$ and $q$ are joined by an edge if and only if $g$ contains an element of order $pq$ and the textit{non-commuting graph} of $g$ is the graph with the vertex s...

At most how many (proper) q-colorings does a regular graph admit? Galvin and Tetali conjectured that among all n-vertex, d-regular graphs with 2d|n, none admits more q-colorings than the disjoint union of n/2d copies of the complete bipartite graph Kd,d. In this note we give asymptotic evidence for this conjecture, showing that the number of proper q-colorings admitted by an n-vertex, d-regular...

For a set D of positive integers, we define a vertex set S ⊆ V (G) to be D-independent if u, v ∈ S implies the distance d(u, v) 6∈ D. The D-independence number βD(G) is the maximum cardinality of a D-independent set. In particular, the independence number β(G) = β{1}(G). Along with general results we consider, in particular, the odd-independence number βODD(G) where ODD = {1, 3, 5, . . .}.