Related papers: The numbers behind Plimpton 322
Prediction criteria for surface reconstructions are discussed, with reference to ab initio calculations of the (110)-$1\times 2$ missing-row and (100)-$5\times 1$ quasi-hexagonal reconstructions of Ir and Rh.
We develop an algebraic framework for ribbon graphs, revealing symmetry properties of (partial) twisted duality. The original ribbon group action of Ellis-Monaghan and Moffatt restricts self-duality, -petriality, or -triality to the…
The aim of this expository article is twofold. The first is to introduce several polynomials of one variable as well as two variables defined on the positive integers with values as congruent numbers. The second is to present connections…
This paper analyzes relations between pattern avoidance of certain permutations and graphs on staircase grids and boundary grids, and proves two conjectures posed by Bean, Tannock, and Ulfarsson (2015). More specifically, this paper…
A permutiple is a natural number whose representation in some base, $b>1$, is an integer multiple of a number whose base-$b$ representation has the same collection of digits. Previous efforts have made progress in finding such numbers using…
We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of $v$-palindromes that inspires this investigation. We also…
Gilbert Strang posited that a permutation matrix of bandwidth $w$ can be written as a product of $N < 2w$ permutation matrices of bandwidth 1. A proof employing a greedy ``parallel bubblesort'' algorithm on the rows of the permutation…
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…
Given a group $G$ and an integer $n\geq2$ we construct a new group $\tilde{{\cal K}}(G,n)$. Although this construction naturally occurs in the context of finding new invariants for complex algebraic surfaces, it is related to the theory of…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the (n-1)/2th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance…
We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave…
Conway and Ryba considered a table of bi-infinite Fibonacci sequences and discovered new interesting patterns. We extend their considerations to tables that are defined by the recurrence $X_{n+1}=dX_n+X_{n-1}$ for natural numbers $d$. In…
We compute the number of rhombus tilings of a hexagon with sides $a+2,b+2,c+2,a+2,b+2,c+2$ with three fixed tiles touching the border. The particular case $a=b=c$ solves a problem posed by Propp. Our result can also be viewed as the…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…
The theory of bi-Hamiltonian systems has its roots in what is commonly referred to as the "Lenard recursion formula". The story about the discovery of the formula told by Andrew Lenard is the subject of this article.