Results 241 to 250 of about 382,738 (264)

Chip firing on directed k-ary trees

open access: yesEnumerative Combinatorics and Applications
Ryota Inagaki   +2 more
doaj   +1 more source

The effects of a second pregnancy on women's brain structure and function. [PDF]

open access: yesNat Commun
Straathof M   +4 more
europepmc   +1 more source

The Spatial Signature of Glioblastoma: A Statistical Re-Assessment of Anatomical Distribution Based on Methylation Subtypes. [PDF]

open access: yesCells
Herrmann T   +14 more
europepmc   +1 more source

Permutation Machines

ACS Synthetic Biology, 2016
We define a new inversion-based machine called a permuton of n genetic elements, which allows the n elements to be rearranged in any of the n·(n - 1)·(n - 2)···2 = n! distinct orderings. We present two design algorithms for architecting such a machine.
Swapnil, Bhatia   +4 more
openaire   +2 more sources

Arithmetic Permutations

Journal of the London Mathematical Society, 1991
The group \(\hbox{Sym }\mathbb{R}\) of permutations of the set \(\mathbb{R}\) of real numbers is considered in the paper. Let \(P_ 0\) be its subgroup of power functions \(x\mapsto x^{m/n}\) where \(m\), \(n\) are positive odd integers, \(T\) be the subgroup of translations \(x\mapsto x+a\) where \(a\) is a real algebraic number, and \(M\) be the ...
Adeleke, S. A.   +2 more
openaire   +2 more sources

Geometric Permutations

Results in Mathematics, 2011
The paper is concerned with so called geometric permutations. It starts by showing the connection between permutations and Coxeter-Bennet configurations (CBC's are regular graphs on \(d+3\) vertices having degree \(d\)). This connection is used to define an equivalence relation on permutations. Next some properties of difference permutations (roughly \(
openaire   +2 more sources

Permutation enumeration

Communications of the ACM, 1976
Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n—1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The
openaire   +2 more sources

Home - About - Disclaimer - Privacy