English
Related papers

Related papers: Pin classes II: Small pin classes

200 papers

We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations…

Combinatorics · Mathematics 2015-11-17 Cheyne Homberger , Vince Vatter

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Combinatorics · Mathematics 2014-10-13 Cheyne Homberger

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

We study a $U(1)\times U(1)$ system with short-range interactions and mutual $\theta=2\pi/3$ statistics in (2+1) dimensions. We are able to reformulate the model to eliminate the sign problem, and perform a Monte Carlo study. We find a…

Statistical Mechanics · Physics 2015-06-05 Scott D. Geraedts , Olexei I. Motrunich

A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced. In this paper, we introduce five natural types of crucial…

Combinatorics · Mathematics 2022-06-28 Sergey Avgustinovich , Sergey Kitaev , Anna Taranenko

Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized…

Representation Theory · Mathematics 2026-04-21 Paul Balmer , Martin Gallauer

There are conflicting reports in the literature regarding the finite-size scaling of the Liouvillian gap and dynamical fluctuations at discontinuous phase transitions, with various studies reporting either exponential or power-law behavior.…

Statistical Mechanics · Physics 2024-10-23 Krzysztof Ptaszynski , Massimiliano Esposito

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Discrete Mathematics · Computer Science 2011-08-19 Alexander Valyuzhenich

We study the high temperature phase of a family of typed branching diffusions initially studied in [Ast\'{e}risque 236 (1996) 133--154] and [Lecture Notes in Math. 1729 (2000) 239--256 Springer, Berlin]. The primary aim is to establish some…

Probability · Mathematics 2007-05-23 Y. Git , J. W. Harris , S. C. Harris

The flow of the low energy eigenstates of a $U_q[sl(2|1)]$ superspin chain with alternating fundamental ($3$) and dual ($\bar{3}$) representations is studied as function of a twist angle determining the boundary conditions. The finite size…

Statistical Mechanics · Physics 2017-06-29 Holger Frahm , Konstantin Hobuß

We consider the following general model of a sorting procedure: we fix a hereditary permutation class $\mathcal{C}$, which corresponds to the operations that the procedure is allowed to perform in a single step. The input of sorting is a…

Combinatorics · Mathematics 2025-08-28 Vít Jelínek , Michal Opler , Jakub Pekárek

We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of…

Probability · Mathematics 2009-05-22 Adrien Joseph

The $k$-core percolation is a fundamental structural transition in complex networks. Through the analysis of the size jump behaviors of $k$-core in the evolution process of networks, we confirm that $k$-core percolation is continuous phase…

Statistical Mechanics · Physics 2017-10-10 Yong Zhu , Xiaosong Chen

Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representing them as subsets of the set of permutations of $n$…

Information Theory · Computer Science 2010-12-10 Alexander Barg , Arya Mazumdar

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

We study braiding statistics between quasiparticles and vortices in two-dimensional charge-$2m$ (in units of $e$) superconductors that are coupled to a $\mathbb Z_{2m}$ dynamical gauge field, where $m$ is any positive integer. We show that…

Superconductivity · Physics 2016-08-17 Chenjie Wang

A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…

Combinatorics · Mathematics 2018-08-27 Kassie Archer , L. -K. Lauderdale

We classify topological phases of non-Hermitian systems in the Altland-Zirnbauer classes with an additional reflection symmetry in all dimensions. By mapping the non-Hermitian system into an enlarged Hermitian Hamiltonian with an enforced…

Mesoscale and Nanoscale Physics · Physics 2019-03-13 Chun-Hui Liu , Hui Jiang , Shu Chen

We consider a few special cases of the more general question: How many permutations $\pi\in\mathcal{S}_n$ have the property that $\pi^2$ has $j$ descents for some $j$? In this paper, we first enumerate Grassmannian permutations $\pi$ by the…

Combinatorics · Mathematics 2024-06-14 Kassie Archer , Aaron Geary

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

Combinatorics · Mathematics 2011-03-08 Petter Brändén , Anders Claesson
‹ Prev 1 8 9 10 Next ›