#### Filter Results:

#### Publication Year

1981

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Kathryn L. Nyman, Ed Swartz
- Discrete & Computational Geometry
- 2004

- Garth Isaak, Kathryn L. Nyman, Ann N. Trenk
- Ars Comb.
- 2003

In this paper we extend the work of Bogart and Trenk [3] and Fishburn and Trotter [6] in studying different classes of bitolerance orders. We provide a more comprehensive list of classes of bitolerance orders and prove equality between some of these classes in general and other classes in the bipartite domain. We also provide separating examples between… (More)

- John Cloutier, Kathryn L. Nyman, Francis Edward Su
- Mathematical Social Sciences
- 2010

We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut… (More)

- H Ohtsubo, K Nyman, W Doroszkiewicz, E Ohtsubo
- Nature
- 1981

- K Nyman, K Nakamura, H Ohtsubo, E Ohtsubo
- Nature
- 1981

Translocation of DNA segments is a recombinational event seen in both eukaryotic and prokaryotic chromosomes, and it is thought to be involved in controlling gene expression and in the evolution of chromosomes. In bacteria, insertion (IS) and transposable (Tn) elements not only translocate their own DNA, but also promote the rearrangement of both bacterial… (More)

- Robert B. Ellis, Kathryn L. Nyman
- J. Comb. Theory, Ser. A
- 2009

We consider an extension of the 2-person Rényi-Ulam liar game in which lies are governed by a channel C, a set of allowable lie strings of maximum length k. Carole selects x ∈ [n], and Paul makes t-ary queries to uniquely determine x. In each of q rounds, Paul weakly partitions [n] = A 0 ∪· · ·∪A t−1 and asks for a such that x ∈ A a. Carole responds with… (More)

The peak algebra P n is a unital subalgebra of the symmetric group algebra, linearly spanned by sums of permutations with a common set of peaks. By exploiting the combinatorics of sparse subsets of [n− 1] (and of certain classes of compositions of n called almost-odd and thin), we construct three new linear bases of P n. We discuss two peak analogs of the… (More)

- KATHRYN NYMAN
- 2003

We prove that the order complex of a geometric lattice has a convex ear decomposition. As a consequence, if ∆(L) is the order complex of a rank (r + 1) geometric lattice L, then the for all i ≤ r/2 the h-vector of ∆(L) satisfies, h i−1 ≤ h i and h i ≤ h r−i. We also obtain several inequalities for the flag h-vector of ∆(L) by analyzing the weak Bruhat order… (More)

- Kathryn L. Nyman, Francis Edward Su
- The American Mathematical Monthly
- 2013

A Borsuk-Ulam equivalent that implies Sperner's Lemma. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR,… (More)

- Caroline J. Klivans, Kathryn L. Nyman, Bridget Eileen Tenner
- Discrete Mathematics
- 2009

We study degree sequences for simplicial posets and polyhedral complexes, generalizing the well-studied graphical degree sequences. Here we extend the more common generalization of vertex-to-facet degree sequences by considering arbitrary face-to-flag degree sequences. In particular, these may be viewed as natural refinements of the flag f-vector of the… (More)