Results 71 to 80 of about 8,688 (230)
Bijections for Dyck paths with colored hills [PDF]
Kostas Manes, Ioannis Tasoulas
doaj +1 more source
Resources for Research on Analogy: A Multi-disciplinary Guide
Work on analogy has been done from a number of disciplinary perspectives throughout the history of Western thought. This work is a multidisciplinary guide to theorizing about analogy.
Marcello Guarini +3 more
doaj +1 more source
Generating Bijections between HOAS and the Natural Numbers [PDF]
A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a ``not equals'' relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term family to ...
John Tang Boyland
doaj +1 more source
Mesh Processing Non‐Meshes via Neural Displacement Fields
Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
A new bijection relating $q$-Eulerian polynomials
On the set of permutations of a finite set, we construct a bijection which maps the 3-vector of statistics $(maj-exc,des,exc)$ to a 3-vector $(maj_2,\widetilde{des_2},inv_2)$ associated with the $q$-Eulerian polynomials introduced by Shareshian and Wachs
Bigeni, Ange
core +5 more sources
Limit Shapes via Bijections [PDF]
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes continuously in the plane. We start with bijections outlined in [43], and extend them to include limit shapes with
Stephen Desalvo, Igor Pak
openaire +2 more sources
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Dyck tilings, linear extensions, descents, and inversions [PDF]
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths.
Jang Soo Kim +3 more
doaj +1 more source
Symmetric functions: a bijective identity [PDF]
We give a bijective proof of a classical identity which we have named the cyclotomic identity.
Metropolis, N., Rota, Gian-Carlo
openaire +2 more sources
Stochastic Pairwise MIS for Unbiased Large‐Kernel Reuse in Real‐Time
Abstract Spatiotemporal resampling methods such as ReSTIR decrease noise in Monte Carlo rendering of dynamic content by reusing paths across frames and pixels. Standard ReSTIR reuses spatially from a small number of randomly selected neighbors. This reuse suffers when few neighbors contain contributing samples, reducing quality toward that of the ...
Trevor Hedstrom +4 more
wiley +1 more source

