Results 61 to 70 of about 8,688 (230)
Eulerian digraphs and Dyck words, a bijection
, 2014 The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions.
P. Codara, O. D'Antona, M. Genuzio
core +2 more sources
Bijections for Entringer families
European Journal of Combinatorics, 2011 André proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of André's result was given by Entringer, who proved that counting alternating permutations according to the first element gives rise to Seidel's triangle $(E_{n,k})$ for computing the Euler numbers.
Gelineau, Yoann +2 more
openaire +5 more sources
Journal of the Royal Anthropological Institute, EarlyView.Based on ethnographic research at Rūm Orthodox Christian monasteries in Lebanon, the article studies scenes of Islam at the monastery as they intersect with anxious public debates on, and anthropological theorizations of, sectarianism and ‘Muslim–Christian’ relations in the Mashriq.
Aaron F. Eldridge
wiley +1 more source
Lenart's bijection via bumpless pipe dreams [PDF]
, 2022 Pipe dreams and bumpless pipe dreams for vexillary permutations are each known to be in bijection with certain semistandard tableaux via maps due to Lenart and Weigandt, respectively.
Gregory, Adam, Hamaker, Zachary
core
Operators of equivalent sorting power and related Wilf-equivalences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired.
Michael Albert, Mathilde Bouvel
doaj +1 more source
The RAND Journal of Economics, EarlyView.ABSTRACT This article studies a dynamic project‐selection game between a Principal and an Agent with conflicting interests. Only the Agent knows what projects are feasible. In each period before a project is selected, the Principal imposes a restriction set. The Agent can select any feasible project within this set, thereby ending the game.
Wenhao Li
wiley +1 more source
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract Two classes of probabilistic models are compared: the true and error (TE) type models and models in the family of the basic local independence model (BLIM). The former finds applications in the study of human preference, whereas the latter has been developed within the theory of knowledge structures with the aim of producing knowledge ...
Luca Stefanutti +2 more
wiley +1 more source
A bijection between irreducible k-shapes and surjective pistols of height $k-1$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 This paper constructs a bijection between irreducible $k$-shapes and surjective pistols of height $k-1$, which carries the "free $k$-sites" to the fixed points of surjective pistols.
Ange Bigeni
doaj +1 more source
Object grammars and bijections
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Dutour, Jean-Marc Fedou
openaire +2 more sources
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source