Related papers: Symmetry groups for social preference functions
The Wigner function provides a useful quasiprobability representation of quantum mechanics, with applications in various branches of physics. Many nice properties of the Wigner function are intimately connected with the high symmetry of the…
Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is…
Actual individual preferences are neither complete (=total) nor antisymmetric in general, so that at least every quasi-order must be an admissible input to a satisfactory choice rule. It is argued that the traditional notion of…
\noindent In our contribution to this volume we deal with \emph{discrete} symmetries: these are symmetries based upon groups with a discrete set of elements (generally a set of elements that can be enumerated by the positive integers). In…
A symmetry in quantum mechanics is described by the projective representations of a Lie symmetry group that transforms between physical quantum states such that the square of the modulus of the states is invariant. The Heisenberg…
Social choice theory offers a wealth of approaches for selecting a candidate on behalf of voters based on their reported preference rankings over options. When voters have underlying utilities for these options, however, using preference…
If a system undergoes symmetric dynamics, then the final state of the system can only break the symmetry in ways in which it was broken by the initial state, and its measure of asymmetry can be no greater than that of the initial state. It…
Symmetries in quantum mechanics are realized by the projective representations of the Lie group as physical states are defined only up to a phase. A cornerstone theorem shows that these representations are equivalent to the unitary…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
It is well known that the allowed wavefunctions for an $N$-electron system should be antisymmetric with respect to the permutation of any pair of electron labels. On the other hand, the Hamiltonian for such system is invariant under any…
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…
Topological order in two dimensions can be described in terms of deconfined quasiparticle excitations - anyons - and their braiding statistics. However, it has recently been realized that this data does not completely describe the situation…
We introduce notions of a constraint metric approximation and of a constraint stability of a metric approximation. This is done in the language of group equations with coefficients. We give an example of a group which is not constraintly…
We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over…
We review and introduce several approaches to the study of centralizer algebras of the infinite symmetric group $S_\infty$. Our study is led by the double commutant relationships between finite symmetric groups and partition algebras; each…
We study symplectic groups and indefinite orthogonal groups over involutive, possibly noncommutative, algebras $(A, \sigma)$. In the case when the algebra $(A, \sigma)$ is Hermitian, or the complexification $(A_{\mathbb{C}},…
It is well known that Euler experimentally discovered the functional equation of the Riemann zeta function. Indeed he detected the fundamental $s\mapsto 1-s$ invariance of $\zeta(s)$ by looking only at special values. In particular, via…
In this paper, we define a set which has a finite group action and is generated by a finite color set, a set which has a finite group action, and a subset of the set of non negative integers. we state its properties to apply one of solution…