English
Related papers

Related papers: On the Cycle Structure of the Metacommutation Map

200 papers

Let $F_p$ be the prime field with $p$ elements. We derive the homogeneous weight on the Frobenius matrix ring $M_2(F_p)$ in terms of the generating character. We also give a generalization of the Lee weight on the finite chain ring…

Information Theory · Computer Science 2017-06-30 Dixie F. Falcunit , Virgilio P. Sison

We discuss the class of superconductors which have pairing correlations which are odd in frequency, as introduced originally by Berezinskii and more recently by Balatsky and Abrahams. As follows from the equations of motion, a natural…

Condensed Matter · Physics 2016-08-31 Elihu Abrahams , A. V. Balatsky , D. J. Scalapino , J. R. Schrieffer

We provide a complete picture of contractivity of trace preserving positive maps with respect to $p$-norms. We show that for $p>1$ contractivity holds in general if and only if the map is unital. When the domain is restricted to the…

Mathematical Physics · Physics 2015-06-26 David Perez-Garcia , Michael M. Wolf , Denes Petz , Mary Beth Ruskai

Kronecker sequences $(k \alpha \mod 1)_{k=1}^{\infty}$ for some irrational $\alpha > 0$ have played an important role in many areas of mathematics. It is possible to associate to each finite segment $(k \alpha \mod 1)_{k=1}^{n}$ a…

Combinatorics · Mathematics 2025-09-05 François Clément

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Number Theory · Mathematics 2019-08-21 David Wu

A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle…

Group Theory · Mathematics 2013-11-27 Guodong Deng , Yun Fan

We show that all the zeros of the quadrinomial $p(z)=1+\kappa(z+z^{N-1})+z^N$ lie on the unit circle if and only if the inequalities \[ -1\le\kappa\le 1\; (\mbox{ if $N$ is even}),\;\; -1\le\kappa\le N/(N-2)\; (\mbox{ if $N$ is odd}) \]…

Classical Analysis and ODEs · Mathematics 2024-10-21 Dmitriy Dmitrishin , Alexander Stokolos

The cyclicity and Koblitz conjectures ask about the distribution of primes of cyclic and prime-order reduction, respectively, for elliptic curves over $\mathbb{Q}$. In 1976, Serre gave a conditional proof of the cyclicity conjecture, but…

Number Theory · Mathematics 2025-06-25 Sung Min Lee , Jacob Mayle , Tian Wang

We consider the classical momentum- or velocity-dependent two-dimensional Hamiltonian given by $$\mathcal H_N = p_1^2 + p_2^2 +\sum_{n=1}^N \gamma_n(q_1 p_1 + q_2 p_2)^n ,$$ where $q_i$ and $p_i$ are generic canonical variables, $\gamma_n$…

Mathematical Physics · Physics 2023-01-06 Alfonso Blasco , Ivan Gutierrez-Sagredo , Francisco J. Herranz

We construct a finite 1-connected CW complex X such that $H_*(\Omega X; Z)$ has p-torsion for the infinitely many primes satisfying p ~ 5,7,17,19 mod 24, but no p-torsion for the infinitely many primes satisfying p ~ 13 or 23 mod 24.

Algebraic Topology · Mathematics 2007-05-23 Y. Felix , S. Halperin , J. -C. Thomas

Counting permutations of $[n]$ by the number of records, i.e. left-to-right maxima, is a classic problem in combinatorial enumeration. In the first volume of ``The Art of Computer Programming", Donald Knuth demonstrated its relevance for…

Combinatorics · Mathematics 2025-01-14 Boris Pittel

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

Probability · Mathematics 2018-03-12 Valentin Bahier

We show that the proportion of permutations of length $n$ with principal M\"{o}bius function equal to zero, $Z(n)$, is asymptotically bounded below by 0.3995. If a permutation $\pi$ contains two intervals of length 2, where one interval is…

Combinatorics · Mathematics 2018-10-24 Robert Brignall , David Marchant

In this paper, we study hyperbolic cycles in the first homology group with local coefficients of congruence subgroups of $\mathrm{SL}_2(\mathbb{Z})$. We prove that, for any prime number $p$, the $p$-ordinary part of the first homology group…

Number Theory · Mathematics 2026-03-25 Hohto Bekki , Ryotaro Sakamoto

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

Number Theory · Mathematics 2010-09-01 N. A. Carella

Let $G$ be a graph on $n$ vertices, labeled $v_1,\ldots,v_n$ and $\pi$ be a permutation on $[n]:=\{1,2,\cdots, n\}$. Suppose that each pebble $p_i$ is placed at vertex $v_{\pi(i)}$ and has destination $v_i$. During each step, a disjoint set…

Combinatorics · Mathematics 2016-09-01 Junhua He , Louis A. Valentin , Xiaoyan Yin , Gexin Yu

This paper introduces and investigates a novel class of skew-regular Quaternary Hadamard matrices. For every odd prime power $p$, we establish the existence of these matrices for all orders $1+p^2$, each characterized by a constant row sum…

Combinatorics · Mathematics 2026-03-31 Hadi Kharaghani , Vlad Zaitsev

We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where $0<q\le 1$ and…

Probability · Mathematics 2017-09-12 Alexey Gladkich , Ron Peled

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

Combinatorics · Mathematics 2023-05-18 Jesse Campion Loth , Michael Levet , Kevin Liu , Eric Nathan Stucky , Sheila Sundaram , Mei Yin

In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…

Computational Complexity · Computer Science 2015-11-03 Eugene M. Luks
‹ Prev 1 8 9 10 Next ›