Results 171 to 180 of about 15,858 (200)

Evidence for divergent cortical organisation in Parkinson's disease and Lewy Body Dementia. [PDF]

Nat Commun
Zarkali A, Thomas G, Hannaway N, Dobreva I, Grant Peters M, Callaghan MF, Ryten M, Weil RS.   +7 more
europepmc   +1 more source

Ocean heat determines benthic trajectories on artificial as well as natural submarine substrata. [PDF]

Sci Rep
Riegl BM, Stratigaki V, Geldhof R, van Acker J, Birmingham D, Riegl BJ, Burt JA.   +6 more
europepmc   +1 more source

Structure-function coupling using fixel-based analysis and functional magnetic resonance imaging in Alzheimer's disease and mild cognitive impairment. [PDF]

Netw Neurosci
Billaud CHA, Yu J, Alzheimer’s Disease Neuroimaging Initiative.   +2 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Caylerian polynomials

Discrete Mathematics, 2023
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by linking Caylerian
Giulio Cerbai, Anders Claesson
semanticscholar   +1 more source

Dyck Paths, Binary Words, and Grassmannian Permutations Avoiding an Increasing Pattern

Annals of Combinatorics, 2022
A permutation is called Grassmannian if it has at most one descent. The study of pattern avoidance in such permutations was initiated by Gil and Tomasko in 2021. We continue this work by studying Grassmannian permutations that avoid an increasing pattern.
Krishna Menon, Anurag Singh
semanticscholar   +1 more source

Annular noncrossing permutations and partitions, and second-order asymptotics for random matrices

, 2003
We study the set Sann−nc(p,q) of permutations of {1, …, p+q} which are noncrossing in an annulus with p points marked on its external circle and q points marked on its internal circle.
J. Mingo, A. Nica
semanticscholar   +1 more source

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform

International Symposium on Mathematical Foundations of Computer Science
We define generalized de Bruijn words as those words having a Burrows-Wheeler transform that is a concatenation of permutations of the alphabet. We show that generalized de Bruijn words are in 1-to-1 correspondence with Hamiltonian cycles in the ...
Gabriele Fici, Estéban Gabory
semanticscholar   +1 more source

Efficient Unitary Designs from Random Sums and Permutations

IEEE Annual Symposium on Foundations of Computer Science
A unitary k-design is an ensemble of unitaries that matches the first $k$ moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques.
Chi-Fang Chen, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G. S. L. Brandão, Patrick Hayden   +5 more
semanticscholar   +1 more source

2d numerical simulations of an electron―phonon hydrodynamical model based on the maximum entropy principle

, 2010
V. Romano, A. Rusakov
semanticscholar   +1 more source

On Rotation Group and Encryption of Analog Signals

Annual International Cryptology Conference, 1985
Su-shing Chen
semanticscholar   +1 more source