Results 71 to 80 of about 117,839 (222)
A crystal to rigged configuration bijection for nonexceptional affine algebras
, 2002 Kerov, Kirillov, and Reshetikhin defined a bijection between highest weight vectors in the crystal graph of a tensor power of the vector representation, and combinatorial objects called rigged configurations, for type $A^{(1)}_n$.
Okado, Masato +2 more
core +3 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
Bijections for Dyck paths with colored hills [PDF]
Enumerative Combinatorics and Applications, 2022 Kostas Manes, Ioannis Tasoulas
doaj +1 more source
Dyck tilings, linear extensions, descents, and inversions [PDF]
Discrete 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
Mesh Processing Non‐Meshes via Neural Displacement Fields
Computer 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
Type C parking functions and a zeta map [PDF]
Discrete 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
, 2018 It is known that if $M$ is a finite-dimensional Banach space, or a strictly convex space, or the space $\ell_1$, then every non-expansive bijection $F: B_M \to B_M$ is an isometry.
Zavarzina, Olesia
core +1 more source
Discrete Mathematics, 2013 AbstractWe provide a bijective proof of the identity ∑x∈λ(h(x)2−c(x)2)=|λ|2 where λ is an integer partition, h(x) is the hook number of the cell x∈λ, and c(x) is the content of x. A closely related identity is also proved bijectively.
openaire +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer 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
Algebraic properties for some permutation statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In this article, we study some quotient sets on permutations built from peaks, valleys, double rises and double descents. One part is dedicated to the enumeration of the cosets using the bijection of Francon-Viennot which is a bijection between ...
Vincent Vong
doaj +1 more source