Results 121 to 130 of about 8,688 (230)
A crystal to rigged configuration bijection for nonexceptional affine algebras
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 +1 more source
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT is a bijective variant of it that has not yet been studied for text indexing applications. We fill this gap by proposing a self-index built on the bijective BWT .
Hideo Bannai +3 more
openaire +3 more sources
From tetrachoric to kappa: How to assess reliability on binary scales
Abstract Reliability is crucial in psychometrics, reflecting the extent to which a measurement instrument can discriminate between individuals or items. While classical test theory and intraclass correlation coefficients are well‐established for quantitative scales, estimating reliability for binary outcomes presents unique challenges due to their ...
Sophie Vanbelle
wiley +1 more source
The Haagerup property is not invariant under quasi‐isometry
Abstract Using the work of Cornulier–Valette and Whyte (see Appendix A for the latter), we show that neither the Haagerup property nor weak amenability is invariant under quasi‐isometry of finitely generated groups. Appendix B shows, using the same examples, that the same holds for vanishing of the equivariant Lp$L^p$‐compression.
Mathieu Carette +4 more
wiley +1 more source
Weighted veronese rings via convex semigroups
Abstract We determine several properties of two‐dimensional normal affine semigroup rings, and in particular of weighted Veronese rings, including determinantal presentations, Gröbner bases, graded Hilbert series and graded Betti numbers, the structure of their associated graded rings, and their Koszul property.
Bek Chase +6 more
wiley +1 more source
Discrete homotopy hypothesis for n$n$‐types
Abstract We show that discrete and classical homotopy theories are equivalent after localizing at n$n$‐equivalences for any non‐negative integer n$n$. By constructing an explicit homotopy inverse to the graph nerve functor associating an n$n$‐fibrant cubical set to a graph, we are also able to give explicit computations of several previously unknown ...
Daniel Carranza, Krzysztof Kapulkin
wiley +1 more source
Pattern Avoidance and the Fundamental Bijection
The fundamental bijection is a bijection $\theta:\mathcal{S}_n\to\mathcal{S}_n$ in which one uses the standard cycle form of one permutation to obtain another permutation in one-line form. In this paper, we enumerate the set of permutations $\pi\in\mathcal{S}_n$ that avoids a pattern $\sigma\in\mathcal{S}_3$, whose image $\theta(\pi)$ also avoids ...
Kassie Archer, Robert P. Laudone
openaire +2 more sources
Bijective Recurrences for Motzkin Paths
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Enumeration modulo four of overpartitions wherein only even parts may be overlined [PDF]
Aidan Carlson +2 more
doaj +1 more source
About the Multifractal Nature of Cantor's Bijection [PDF]
In this talk, we present the Cantor's bijection between the irrational numbers of the unit interval [0,1] and the irrational numbers of the unit square [0,1]². We explore the regularity and the fractal nature of this map.
Simons, Laurent, Nicolay, Samuel
core

