Results 111 to 120 of about 206,672 (309)
Counting parking sequences and parking assortments through permutations [PDF]
Enumerative Combinatorics and Applications, 2023 Spencer J. Franks +4 more
doaj +1 more source
Log-Convexity and Fixed Points of Permutations
AxiomsWe provide a combinatorial proof for the fact that the numbers of derangements of length n form a log-convex sequence for n≥3. A minor modification of our proof yields the same result for permutations of length n≥4 that have exactly one fixed point.
Miklós Bóna
doaj +1 more source
The shallow permutations are the unlinked permutations
, 2022 Diaconis and Graham studied a measure of distance from the identity in the symmetric group called total displacement and showed that it is bounded below by the sum of length and reflection length. They asked for a characterization of the permutations where this bound is an equality; we call these the shallow permutations.
openaire +2 more sources
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael H. Albert +4 more
openaire +3 more sources
The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome
FEBS Letters, EarlyView.This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley +1 more source
FEBS Letters, EarlyView.An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley +1 more source
Crossings and Permutations [PDF]
, 2006 We investigate crossing minimization problems for a set of permutations, where a crossing expresses a disarrangement between elements. The goal is a common permutation π* which minimizes the number of crossings. This is known as the Kemeny optimal aggregation problem minimizing the Kendall-τ distance.
Therese Biedl +2 more
openaire +1 more source
Molecular Oncology, Volume 20, Issue 6, Page 1429-1452, June 2026.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source
Molecular Oncology, Volume 20, Issue 6, Page 1513-1534, June 2026.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Permutation and local permutation polynomials of maximum degree
Afrika MatematikaAbstract Let $$\mathbb {F}_q$$ F q be the finite field with q elements and $$\mathbb {F}_q[x_1,\ldots , x_n]$$
Jaime Gutierrez 0001 +1 more
openaire +4 more sources