English
Related papers

Related papers: Han's Bijection via Permutation Codes

200 papers

This note contains a generalization to $p>2$ of the authors' previous calculations of the coefficients of $(\mathbb{Z}/2)^n$-equivariant ordinary cohomology with coefficients in the constant $\mathbb{Z}/2$-Mackey functor. The algberaic…

Algebraic Topology · Mathematics 2020-02-14 John Holler , Igor Kriz

We prove that any bijective fidelity preserving transformation on the set of all density operators on a Hilbert space is implemented by an either unitary or antiunitary operator on the underlying Hilbert space.

Operator Algebras · Mathematics 2009-11-07 Lajos Molnar

Wigner's classical theorem on symmetry transformations plays a fundamental role in quantum mechanics. It can be formulated, for example, in the following way: Every bijective transformation on the set L of all 1-dimensional subspaces of a…

Functional Analysis · Mathematics 2009-10-31 Lajos Molnar

One-point codes on the Hermitian curve produce long codes with excellent parameters. Feng and Rao introduced a modified construction that improves the parameters while still using one-point divisors. A separate improvement of the parameters…

Information Theory · Computer Science 2011-02-18 Iwan Duursma , Radoslav Kirov

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

Probability · Mathematics 2015-05-19 Julia Storm , Dirk Zeindler

If $\alpha \in S_n$ is a permutation of $\{1, 2, \ldots, n\}$, the inversion set of $\alpha$ is $\Phi(\alpha) = \{(i, j) \, | \, 1 \leq i < j \leq n, \alpha(i) > \alpha(j)\}$. We describe all $r$-tuples $\alpha_1, \alpha_2, \ldots, \alpha_r…

Combinatorics · Mathematics 2014-09-04 R. Dewji , I. Dimitrov , A. McCabe , M. Roth , D. Wehlau , J. Wilson

Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the…

Information Theory · Computer Science 2015-03-13 Ha Q. Nguyen , Lav R. Varshney , Vivek K Goyal

We find a formula for the resolution of fixed points in extensions of permutation orbifold conformal field theories by its (half-)integer spin simple currents. We show that the formula gives a unitary and modular invariant S matrix.

High Energy Physics - Theory · Physics 2011-08-03 M. Maio , A. N. Schellekens

A general fixed point theorem for isometries in terms of metric functionals is proved under the assumption of the existence of a conical bicombing. It is new even for isometries of Banach spaces as well as for non-locally compact…

Functional Analysis · Mathematics 2023-01-19 Anders Karlsson

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…

Functional Analysis · Mathematics 2008-02-18 M. Marques Alves , B. F. Svaiter

We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of…

Functional Analysis · Mathematics 2014-04-02 Faik Gürsoy

Caputo fractional (with power-law kernels) and fractional (delta) difference maps belong to a more widely defined class of generalized fractional maps, which are discrete convolutions with some power-law-like functions. The conditions of…

Chaotic Dynamics · Physics 2023-03-10 Mark Edelman

The flag-major index "fmaj" and the classical length function "$\ell$" are used to construct two $q$-analogs of the generating polynomial for the hyperoctahedral group~$B_n$ by number of positive and negative fixed points (resp. pixed…

Combinatorics · Mathematics 2007-05-23 Dominique Foata , Guo-Niu Han

We give a bijective correspondence between the number of nilpotent matrices over a Boolean semiring and the number of directed acyclic graphs on ordered vertices. We then enumerate pairs of maps between two finite sets whose composites are…

Combinatorics · Mathematics 2025-12-08 Weixi Chen , Mee Seong Im , Catherine Lillja , Nicolas Rugo

Consider a random permutation of $\{1, \ldots, \lfloor n^{t_2}\rfloor\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\equiv (t_1, t_2)\in\mathbb [0, 1]^2$. Next,…

Probability · Mathematics 2021-06-21 Helmut Pitters

In this paper, the existence of coincidence points and common fixed points for multivalued mappings satisfying certain graphic {\psi}-contraction contractive conditions with set-valued domain endowed with a graph, without appealing to…

General Mathematics · Mathematics 2016-06-17 Sergei Silvestrov , Talat Nazir

The Seiberg-Witten map links noncommutative gauge theories to ordinary gauge theories, and allows to express the noncommutative variables in terms of the commutative ones. Its explicit form can be found order by order in the noncommutative…

High Energy Physics - Theory · Physics 2009-11-07 Stephane Fidanza

Manin transformations are maps of the plane that preserve a pencil of cubic curves. They are the composition of two involutions. Each involution is constructed in terms of an involution point that is required to be one of the base points of…

Exactly Solvable and Integrable Systems · Physics 2021-03-02 Peter H. van der Kamp , David I. McLaren , G. R. W. Quispel

We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.

Combinatorics · Mathematics 2007-05-23 Igor Pak , Ernesto Vallejo

Let B be any Lp space for p in (1,infty) or any Banach space isomorphic to a Hilbert space, and k be a nonnegative integer. We show that if n is at least 4, then the universal lattice Gamma =SL_n (Z[x1,...,xk]) has property (F_B) in the…

Functional Analysis · Mathematics 2011-06-08 Masato Mimura