Results 61 to 70 of about 382,738 (264)

On Minimal Strings Containing the Elements of S_n by Decimation [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2001
The permutations by decimation problem is thought to be applicable to computer graphics, and raises interesting theoretical questions in combinatory theory.We present the results of some theoretical and practical investigation into this problem.We show ...
Robert Erra, Nik Lygeros, Nigel Stewart
doaj   +1 more source

Coherent random permutations with record statistics

open access: yes, 2006
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$.
Gnedin, Alexander
core   +2 more sources

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe   +3 more
wiley   +1 more source

Polyominoes determined by involutions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutations of length $n$, such that $\pi_1(i) \neq \pi_2(i)$, for $1 \leq i \leq n$.
Filippo Disanto, Simone Rinaldi
doaj   +1 more source

Transport of patterns by Burge transpose

open access: yes, 2020
We take the first steps in developing a theory of transport of patterns from Fishburn permutations to (modified) ascent sequences. Given a set of pattern avoiding Fishburn permutations, we provide an explicit construction for the basis of the ...
Cerbai, Giulio, Claesson, Anders
core  

Time after time – circadian clocks through the lens of oscillator theory

open access: yesFEBS Letters, EarlyView.
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo   +2 more
wiley   +1 more source

Surrogate Data Preserving All the Properties of Ordinal Patterns up to a Certain Length

open access: yesEntropy, 2019
We propose a method for generating surrogate data that preserves all the properties of ordinal patterns up to a certain length, such as the numbers of allowed/forbidden ordinal patterns and transition likelihoods from ordinal patterns into others.
Yoshito Hirata   +2 more
doaj   +1 more source

On the enumeration of column-convex permutominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We study the enumeration of \emphcolumn-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations. We provide a direct recursive construction for the column-convex permutominoes of a given size, based on the application of ...
Nicholas R. Beaton   +3 more
doaj   +1 more source

The enumeration of permutations avoiding 2143 and 4231 [PDF]

open access: yes, 2011
We enumerate the pattern class Av(2143, 4231) and completely describe its permutations.
Albert, M. H.   +2 more
core   +2 more sources

Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays

open access: yes, 2016
A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in
Pan, Ran, Remmel, Jeffrey B.
core   +1 more source

Home - About - Disclaimer - Privacy