We introduce a new class of quantum enhancements we call biquandle brackets, which are customized skein invariants for biquandle colored links. Quantum enhancements of biquandle counting invariants form a class of knot and link invariants that includes biquandle cocycle invariants and skein invariants such as the HOMFLY-PT polynomial as special cases, providing an explicit unification of these apparently unrelated types of invariants. We provide examples demonstrating that the new invariants are not determined by the biquandle counting invariant, the knot quandle, the knot group or the traditional skein invariants.
Abstract. We show how voting may be viewed naturally from an algebraic perspective by viewing voting profiles as elements of certain well-studied QSn-modules. By using only a handful of simple combinatorial objects (e.g., tabloids) and some basic ideas from representation theory (e.g., Schur's Lemma), this allows us to recast and extend some well-known results in the field of voting theory.
Several nonparametric tests exist to test for differences among alternatives when using ranked data. Testing for differences among alternatives amounts to testing for uniformity over the set of possible permutations of the alternatives. Well-known tests of uniformity, such as the Friedman test or the Anderson test, are based on the impact of the usual limiting theorems (e.g. central limit theorem) and the results of different summary statistics (e.g. mean ranks, marginals, and pairwise ranks). Inconsistencies can occur among statistical tests' outcomes -different statistical tests can yield different outcomes when applied to the same ranked data. In this paper, we describe a conceptual framework that naturally decomposes the underlying ranked data space. Using the framework, we explain why test results can differ and how their differences are related. In practice, one may choose a test based on the power or the structure of the ranked data. We discuss the implications of these choices and illustrate that for data meeting certain conditions, no existing test is effective in detecting nonuniformity. Finally, using a real data example, we illustrate how to construct new linear rank tests of uniformity.
Let W n,r denote the n-fold iterated wreath product of Z/rZ with itself. In this paper, we are interested in the tower of groups W 1,r ⊂ W 2,r ⊂ · · ·. We show that the irreducible representations of W n,r are indexed by a set of labeled rooted trees. By adding a partial order on this set of rooted trees, we obtain the Bratteli diagram for this tower of groups. In particular, we give the branching rules. This approach yields combinatorial rules for the decomposition of restricted and induced representations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.