Results 41 to 50 of about 116,248 (268)

Classification of bijections between 321- and 132-avoiding permutations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs confirming this fact.
Anders Claesson, Sergey Kitaev
doaj   +1 more source

Strict Bounds for Pattern Avoidance [PDF]

open access: yesTheoretical Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blanchet-Sadri, F., Woodhouse, Brent
openaire   +1 more source

Carcinomas and Carcinoid Tumors of the Lungs and Bronchi in Children and Adolescents: The EXPeRT Recommendations

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Primary lung carcinomas and bronchial carcinoid tumors (BC) are very rare malignancies in childhood. While typical BC and mucoepidermoid carcinomas are mostly low‐grade, localized tumors with a more favorable prognosis than in adults, necessitating avoidance of overtreatment, adenocarcinomas of the lung are often diagnosed at advanced disease ...
Michael Abele   +19 more
wiley   +1 more source

Permutation patterns, Stanley symmetric functions, and the Edelman-Greene correspondence [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
Generalizing the notion of a vexillary permutation, we introduce a filtration of $S_{\infty}$ by the number of Edelman-Greene tableaux of a permutation, and show that each filtration level is characterized by avoiding a finite set of patterns.
Sara Billey, Brendan Pawlowski
doaj   +1 more source

Exploring Preferences for a Digital Single‐Session Intervention for Adolescent Siblings of Youth With Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro   +10 more
wiley   +1 more source

Rational smoothness and affine Schubert varieties of type A [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
The study of Schubert varieties in G/B has led to numerous advances in algebraic combinatorics and algebraic geometry. These varieties are indexed by elements of the corresponding Weyl group, an affine Weyl group, or one of their parabolic quotients ...
Sara Billey, Andrew Crites
doaj   +1 more source

Symmetric Permutations Avoiding Two Patterns [PDF]

open access: yesAnnals of Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lonoff, David, Ostroff, Jonah
openaire   +1 more source

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen   +23 more
wiley   +1 more source

Arc Permutations (extended abstract) [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. In this paper we describe combinatorial properties of these permutations, including characterizations in terms of pattern avoidance, connections to ...
Sergi Elizalde, Yuval Roichman
doaj   +1 more source

Pattern avoidance in forests of binary shrubs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2016
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary shrub forests.
David Bevan   +6 more
doaj   +1 more source

Home - About - Disclaimer - Privacy