Results 71 to 80 of about 1,383 (202)

Incumbent‐Born B2B Platforms: Organizational Boundary Dynamics in Platform Creation

open access: yesJournal of Product Innovation Management, EarlyView.
ABSTRACT This study examines the dynamics of organizational boundaries in B2B industry platform creation through an in‐depth single‐case study. Specifically, we address the question: How do B2B firms redefine their organizational boundaries when shifting from a pipeline model to an industry platform?
Khaled Abed Alghani   +2 more
wiley   +1 more source

Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$

open access: yes, 2022
For fixed non-negative integers $k$, $t$, and $n$, with $t < k$, a $k_t$-Dyck path of length $(k+1)n$ is a lattice path that starts at $(0, 0)$, ends at $((k+1)n, 0)$, stays weakly above the line $y = -t$, and consists of steps from the step-set $\{(1, 1)
Selkirk, Sarah J.   +5 more
core   +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

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

Left to right maxima in Dyck Paths

open access: yes, 2021
In a Dyck path a peak which is (weakly) higher than all the preceding peaks is called a strict (weak) left to right maximum. We obtain explicit generating functions for both weak and strict left to right maxima in Dyck paths. The proofs of the associated asymptotics make use of analytic techniques such as Mellin transforms, singularity analysis and ...
Blecher, Aubrey, Knopfmacher, Arnold
openaire   +3 more sources

Children Show Stronger Learning‐Dependent Explicit Knowledge Than Adults After Offline Wake or Sleep Intervals

open access: yesJournal of Sleep Research, EarlyView.
ABSTRACT Previous research has extensively investigated the impact of post‐training sleep and wakefulness on procedural memory consolidation across development. However, results regarding how offline processes specifically affect the explicit and implicit components of newly acquired procedural skills in children and adults remain controversial.
D. Voisin   +4 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

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

Middlebrow Aesthetics: An Explanation and Defense

open access: yesPacific Philosophical Quarterly, EarlyView.
ABSTRACT We offer a philosophical account of the middlebrow as a theoretical category to do explanatory and critical work in aesthetics. On our account, the middlebrow ought to be understood as aspirational popular art. That is, it is art which aspires both to be popular (in a distinctive sense), and at the same time to be something more than popular ...
Aaron Meskin, Jonathan M. Weinberg
wiley   +1 more source

Restricted Dyck Paths on Valleys Sequence

open access: yes, 2021
In this paper we study a subfamily of a classic lattice path, the \emph{Dyck paths}, called \emph{restricted $d$-Dyck} paths, in short $d$-Dyck. A valley of a Dyck path $P$ is a local minimum of $P$; if the difference between the heights of two consecutive valleys (from left to right) is at least $d$, we say that $P$ is a restricted $d$-Dyck path. The \
Flórez, Rigoberto   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy