Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Meertens Number And Its Variations, Chai Wah Wu
Meertens Number And Its Variations, Chai Wah Wu
Communications on Number Theory and Combinatorial Theory
In 1998, Bird introduced Meertens numbers as numbers that are invariant under a map similar to the Gödel encoding. In base 10, the only known Meertens number is 81312000. We look at some properties of Meertens numbers and consider variations of this concept. In particular, we consider variations of Meertens numbers where there is a finite time algorithm to decide whether such numbers exist, exhibit infinite families of these variations and provide bounds on parameters needed for their existence.
On Two-Player Pebbling, Garth Isaak, Matthew Prudente, Andrea Potylycki, William Fagley, Joseph Marcinik
On Two-Player Pebbling, Garth Isaak, Matthew Prudente, Andrea Potylycki, William Fagley, Joseph Marcinik
Communications on Number Theory and Combinatorial Theory
Graph pebbling can be extended to a two-player game on a graph G, called Two-Player Graph Pebbling, with players Mover and Defender. The players each use pebbling moves, the act of removing two pebbles from one vertex and placing one of the pebbles on an adjacent vertex, to win. Mover wins if they can place a pebble on a specified vertex. Defender wins if the specified vertex is pebble-free and there are no more pebbling moves on the vertices of G. The Two-Player Pebbling Number of a graph G, η(G), is the minimum m such that for every arrangement …
Some Np-Complete Edge Packing And Partitioning Problems In Planar Graphs, Jed Yang
Some Np-Complete Edge Packing And Partitioning Problems In Planar Graphs, Jed Yang
Communications on Number Theory and Combinatorial Theory
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges. Bernáth and Király proved that this decision problem is NP-complete and asked if the same result holds when restricting to planar graphs. Similarly, they showed that the packing problem with a spanning tree and a path between two distinguished vertices is NP-complete. They also established the NP-completeness of the partitioning problem of determining whether the edge set of a graph can be …
Generating B-Nomial Numbers, Ji Young Choi
Generating B-Nomial Numbers, Ji Young Choi
Communications on Number Theory and Combinatorial Theory
This paper presents three new ways to generate each type of b-nomial numbers: We develop ordinary generating functions, we find a whole new set of recurrence relations, and we identify each b-nomial number as a single binomial coefficient or as an alternating sum of products of two binomial coefficients.