1.2k citations
- Massachusetts Institute of TechnologyUS33 papers
- Northwestern UniversityUS31 papers
- University of California, Santa BarbaraUS30 papers
- University of GlasgowGB29 papers
- University of MichiganUS29 papers
- University of RochesterUS28 papers
- California Institute of TechnologyUS24 papers
- Fermi National Accelerator LaboratoryUS23 papers
- University of Wisconsin–MadisonUS22 papers
- Karlsruhe Institute of TechnologyDE20 papers
- Lawrence Berkeley National LaboratoryUS20 papers
- Michigan State UniversityUS20 papers
11 papers · 1 filter
Tree Orbits under Permutation Group Action: Algorithm, Enumeration and Application to Viral Assembly
Miklos Bona, Meera Sitharam, Andrew Vince
This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly…
The Average Number of Block Interchanges Needed to Sort A Permutation and a recent result of Stanley
Miklos Bona, Ryan Flynn
We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of b…
Incidence Modules for Symplectic Spaces in Characteristic Two
David B. Chandler, Peter Sin, Qing Xiang
We study the permutation action of a finite symplectic group of characteristic 2 on the set of subspaces of its standard module which are either totally isotropic or else complemen…
The extremal values of the Wiener index of a tree with given degree sequence
Hua Wang
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate achemical compound's molecular graph w…
On divisibility of Narayana numbers by primes
Miklos Bona, Bruce Sagan
Using Kummer's Theorem, we give a necessary and sufficient condition for a Narayana number to be divisible by a given prime. We use this to derive certain properties of the Narayan…
Dissecting the Stanley Partition Function
Alexander Berkovich, Frank G. Garvan
Let p(n) denote the number of unrestricted partitions of n. For i=0, 2, let p[i](n) denote the number of partitions pi of n such that O(pi) - O(pi') = i mod 4. Here O(pi) denotes t…