Zobrazeno 1 - 10
of 241 493
pro vyhledávání: '"Dyck, A"'
Autor:
Natalia Gritsai
À partir de la création de son premier atelier à l'âge de seize ans, sir Anthony van Dyck (1599-1641) devint célèbre dans le monde de l'art. Rubens, son professeur lorsqu'il était enfant, disait de lui qu'il était son élève le plus talentue
Autor:
Rognerud, Baptiste
There are three classical lattices on the Catalan numbers: the Tamari lattice, the lattice of noncrossing partitions and the lattice of Dyck paths. The first is known to be isomorphic to the lattice of torsion classes of the path algebra of an equior
Externí odkaz:
http://arxiv.org/abs/2410.18034
Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational Dyck paths
Externí odkaz:
http://arxiv.org/abs/2409.20210
In the Stanley lattice defined on Dyck paths of size $n$, cover relations are obtained by replacing a valley $DU$ by a peak $UD$. We investigate a greedy version of this lattice, first introduced by Chenevi\`ere, where cover relations replace a facto
Externí odkaz:
http://arxiv.org/abs/2409.15982
Autor:
Takahasi, Hiroki
The heterochaos baker maps are piecewise affine maps on the square or the cube that are one of the simplest partially hyperbolic systems. The Dyck shift is a well-known example of a subshift that has two fully supported ergodic measures of maximal en
Externí odkaz:
http://arxiv.org/abs/2409.01261
This study investigates the learnability of Recurrent Neural Networks (RNNs) in classifying structured formal languages, focusing on counter and Dyck languages. Traditionally, both first-order (LSTM) and second-order (O2RNN) RNNs have been considered
Externí odkaz:
http://arxiv.org/abs/2410.03118
Autor:
Shigechi, Keiichi
We study a partially ordered set of planar labeled rooted trees by use of combinatorial objects called Dyck tilings. A generating function of the poset is factorized when the minimum element of the poset is $312$-avoiding and satisfies some extra con
Externí odkaz:
http://arxiv.org/abs/2408.05483
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not intrinsic
Externí odkaz:
http://arxiv.org/abs/2406.19828
Autor:
Backman, Spencer, Charbonneau, Cole, Loehr, Nicholas A., Mullins, Patrick, O'Connor, Mazie, Warrington, Gregory S.
For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are equinumerous wi
Externí odkaz:
http://arxiv.org/abs/2408.06923
Autor:
Prodinger, Helmut
Descents of odd length in Dyck paths are discussed, taking care of some variations. The approach is based on generating functions and the kernel method and augments relations about them from the Encyclopedia of Integer Sequences, that were pointed ou
Externí odkaz:
http://arxiv.org/abs/2408.01290