skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Haymaker, Kathryn"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Linear and Multilinear Algebra)
    Free, publicly-accessible full text available April 9, 2026
  2. ; ; ; (, The PUMP Journal of Undergraduate Research)
    A permutation in a finite symmetric group on a set of ordered elements has a descent at the i-th index if the permutation value at the i-th index is greater than the permutation value that follows. The descent set of a permutation is the set of all indices where the permutation has a descent. Each finite symmetric group can be partitioned by descent sets. In this paper we study the Hamming metric and the L-infinity metric on the sets of permutations that share the same descent set for all nonempty descent sets to determine the maximum possible value that these metrics can achieve when restricted to these subsets.  
    more » « less
    Free, publicly-accessible full text available January 13, 2026
  3. ; ; (, Designs, Codes and Cryptography)
    Abstract Codes with locality, also known as locally recoverable codes, allow for recovery of erasures using proper subsets of other coordinates. These subsets are typically of small cardinality to promote recovery using limited network traffic and other resources. Hierarchical locally recoverable codes allow for recovery of erasures using sets of other symbols whose sizes increase as needed to allow for recovery of more symbols. In this paper, we describe a hierarchical recovery structure arising from geometry in Reed–Muller codes and codes with availability from fiber products of curves. We demonstrate how the fiber product hierarchical codes can be viewed as punctured subcodes of Reed–Muller codes, uniting the two constructions. This point of view provides natural structures for local recovery with availability at each level in the hierarchy. 
    more » « less
  4. ; ; ; ; (, Involve, a Journal of Mathematics)
    Full Text Available 
  5. ; ; ; ; (, IEEE BITS the Information Theory Magazine)
    Full Text Available