Results 71 to 80 of about 1,109,500 (204)

Promotion of Lattice Paths by Riordan Arrays

open access: yesMathematics
This paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion.
Aoife Hennessy   +3 more
doaj   +1 more source

On Enumeration of Dyck--Schröder Paths

open access: yes, 2016
We address the problem of enumerating paths in square lattices, where allowed steps include (1,0) and (0,1) everywhere, and (1,1) above the diagonal y=x. We consider two such lattices differing in whether the (1,1) steps are allowed along the diagonal itself.
openaire   +3 more sources

Antoine van Dyck

open access: yes, 1882
ANTOINE VAN DYCK Antoine van Dyck ( - ) Einband ( - ) Vorblatt ( - ) Titelblatt ( - ) Abbildung ([I]) A Antoine van Dyck. Sonnet ([III]) A Sully Prudhomme ([V]) Première partie. La famille de van Dyck - van Dyck
Dyck, Anton/van, Guiffrey, Jules
core   +1 more source

Dyck paths with first sojourn highest [PDF]

open access: yes
A Dyck path is a lattice path in the first quadrant using steps $u=(1,1)$ and $d=(1,-1)$, starting at the origin and ending on the $x$-axis. A Dyck sojourn is a Dyck path with only one return to the $x$-axis. Various subclasses of Dyck paths are shown to
Knopfmacher, Arnold, Blecher, Aubrey
core   +1 more source

Platform development in incumbent firms: The interplay of data and actor interests in adding platforms to existing businesses

open access: yesStrategic Management Journal, EarlyView.
Abstract Research Summary Despite growing interest in platform transitions, limited research examines how firms navigate challenges of building platform businesses alongside existing products. Through a longitudinal case study of a financial services firm launching a platform, we develop a process model revealing how data bottlenecks shape platform ...
Jack Fraser   +2 more
wiley   +1 more source

Symmetric and asymmetric peaks or valleys in (partial) Dyck paths [PDF]

open access: yesEnumerative Combinatorics and Applications, 2022
Yidong Sun, Wenle Shi, Di Zhao
doaj   +1 more source

Dyck paths, Motzkin paths, and the binomial transform [PDF]

open access: yesJ. Integer Seq., 2015
Summary: We study the moments of orthogonal polynomial sequences (OPS) arising from tridiagonal matrices. We obtain combinatorial information about the sequence of moments of some OPS in terms of Motzkin and Dyck paths, and also in terms of the binomial transform. We then introduce an equivalence relation on the set of Dyck paths and some operations on
CAPPARELLI, Stefano, DEL FRA, ALBERTO
openaire   +2 more sources

Parenting as Civic Action: A Relational Framework for Citizenship

open access: yesThe British Journal of Sociology, EarlyView.
ABSTRACT This article conceptualizes parenting as a form of civic action. Identifying a relational turn in theories of citizenship, we propose an analytical framework for examining civic meanings in everyday parental acts. Foregrounding the intersubjective and intergenerational nature of state–citizen relations, the framework expands existing theories ...
Lauren Erdreich   +3 more
wiley   +1 more source

On Enumeration of Dyck Paths with colored hills

open access: yesJ. Integer Seq., 2018
We continue to investigate the properties of the earlier defined functions fm and gm, which depend on an initial arithmetic function f0. In this papers values of f0 are the Fine numbers. We investigate functions fi; gi; (i = 1; 2; 3; 4). For each function, we derive an explicit formula and give a combinatorial interpretation.
openaire   +4 more sources

WORDS, DYCK PATHS, TREES, AND BIJECTIONS [PDF]

open access: yes, 2001
In \cite{BaDeFePi96} the concept of nondecreasing Dyck paths was introduced. We continue this research by looking at it from the point of view of words, rational languages, planted plane trees, and continued fractions. We construct a bijection with planted plane trees of height $\le 4$ and compute various statistics on trees that are the equivalents of
openaire   +3 more sources

Home - About - Disclaimer - Privacy