\(P\)-orderings of finite subsets of Dedekind domains (Q835655): Difference between revisions

Let \(R\) be a Dedekind domain, \(P\) a prime ideal of it and \(K\) the quotient field \(R/P\) with the cardinal number \(q=|R/P|\). For \( x\in R\), let \(\gamma (x)\) denotes the largest integer \(k\) for which \(x\in P^{k}\). An ordering of a finite set \(S\) with \(|S|=n\) is a bijection \(\phi :\langle n\rangle \to S\) where \( \langle n\rangle =\{ 1,2,\dots ,n\} ,\) and \( \langle 0\rangle =\varnothing .\) For non negative integers \(k_{1},k_{2},\dots ,k_{q}\) such that \(n=\sum k_{i}.\) A \((k_{1},k_{2},\dots ,k_{q})\)-shuffle is an ordered set of \(q\) strictly increasing maps \(\phi _{j}:\langle k_{i}\rangle \to \langle n\rangle \) with disjoint images. For non negative integers \( k_{1},k_{2},\dots ,k_{q}\) such that \(m\leq \sum k_{i},\) A \( (k_{1},k_{2},\dots ,k_{q};m)\)-alignment is an ordered set of \(q\) strictly increasing maps \(\phi _{j}:\langle k_{i}\rangle \to \langle m\rangle \) the union of whose images is \(\langle m\rangle .\) A \(P\)-ordering of \(S\) is an ordering \(\{ a_{i},i=1,2,\dots ,|S|\} \) of \(|S|\) with the property that for each \(i>1\) the element \(a_{i}\) minimizes \(\gamma \left( \prod_{j<i}(s-a_{i})\right) \) among all elements \(s\) of \(S\). If \(S,S^{\prime }\) are two finite subsets of \(R\) of the same cardinality, \(m\), then a bijection \(\phi :S\to S^{\prime }\) is a \(P\)-ordering equivalence if \(\phi \) preserves \(P\)-orderings. The author of the paper under review uses the concepts of shuffle and alignment to reconstruct \(P\)-ordering of \(S\) from that of some specific subsets of \(S\) to present upper and lower bounds for the number of distinct \( P\)-orderings a finite set can have in terms of its cardinality and also give an upper bound on the number of \(P\)-ordering equivalence classes of a given cardinality.