Results 71 to 80 of about 8,473 (239)

Generating Bijections between HOAS and the Natural Numbers [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
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

Volume Quantization with Flexible Singularities for Hexahedral Meshing

open access: yesComputer 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

Bijections for Dyck paths with colored hills [PDF]

open access: yesEnumerative Combinatorics and Applications, 2022
Kostas Manes, Ioannis Tasoulas
doaj   +1 more source

Limit Shapes via Bijections [PDF]

open access: yesCombinatorics, Probability and Computing, 2018
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

Mesh Processing Non‐Meshes via Neural Displacement Fields

open access: yesComputer Graphics Forum, EarlyView.
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

Dyck tilings, linear extensions, descents, and inversions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
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

Properties of the Edelman-Greene bijection

open access: yes, 2020
Edelman and Greene constructed a bijective correspondence between reduced words of the reverse permutation and standard Young tableaux. We prove that for any reduced word the shape of the region of the insertion tableau containing the smallest possible ...
Linusson, Svante,, Potka, Samu,
core   +1 more source

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

open access: yesComputer Graphics Forum, EarlyView.
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

Type C parking functions and a zeta map [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
We introduce type $C$ parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type $C$ parking functions to regions of the Shi arrangement of type $C$, encoded as diagonally labelled ...
Robin Sulzgruber, Marko Thiel
doaj   +1 more source

Symmetric functions: a bijective identity [PDF]

open access: yesProceedings of the American Mathematical Society, 1988
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

Home - About - Disclaimer - Privacy