NHNickolas Hein

Nickolas Hein

*This is an algorithmically generated author record based on publicly available information.

Nickolas Hein has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Variations of the Catalan numbers from some nonassociative binary operations

    by Nickolas Hein, Jia Huang

    We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial objects such as binary trees, plane trees, lattice paths, and permutations.


  • Open Access

    Certification for Polynomial Systems via Square Subsystems

    by Timothy Duff, Nickolas Hein, Frank Sottile

    We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsystem. We give several approaches that certifiably select which are solutions to the original overdetermined system. These approaches each use different additional information for this certification, such as liaison, Newton-Okounkov bodies, or intersection theory. They may be used to certify individual solutions, reject nonsolutions, or certify that we have found all solutions.

  • Open Access

    Modular Catalan Numbers

    by Nickolas Hein, Jia Huang

    The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$ satisfies a $k$-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by $C_{k,n}$ with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for $C_{k,n}$ with two different proofs. For each $n\ge0$ we compute the largest size of $k$-associative equivalence classes and show that the number of classes with this size is a Catalan number.