Related papers: Cyclic Sieving of Matchings
The Quantum Symmetric Simple Exclusion Process (QSSEP) is a model of quantum particles hopping on a finite interval and satisfying the exclusion principle. Recently Bernard and Jin have studied the fluctuations of the invariant measure for…
Claesson and Linusson [Proc. Am. Math. Soc., 139 (2011), 435-449] observed that there are n! matchings on [2n] with no left-nestings. Inspired by this result, this paper is devoted to exploring a deeper connection between matchings and…
We consider a model of two (fully) compact polymer chains, coupled through an attractive interaction. These compact chains are represented by Hamiltonian paths (HP), and the coupling favors the existence of common bonds between the chains.…
The asymmetric simple exclusion exclusion process (ASEP) is a model of particles hopping on a one-dimensional lattice of n sites. It was introduced around 1970, and since then has been extensively studied by researchers in statistical…
Symmetry breaking--the phenomenon in which the symmetry of a system is not inherited by its stable states--underlies pattern formation, superconductivity, and numerous other effects. Recent theoretical work has established the possibility…
This is my PhD thesis supervised by Professor Jerzy Weyman. A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows…
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the…
Define $QC(n)$ to be the number of quasiplatonic topological actions of the cyclic group $C_n$ on surfaces of genus at least two. We use formulas of Benim and Wootton to give an explicit formula for $QC(n)$. In addition, we relate the…
This short note deals with the so-called $ Sock \; Matching \; Problem$. We define $B_{n,k}$ as the number of all the finite sequences $a_1, \ldots, a_{2n}$ of nonnegative integers which contain at least one occurrence of $k$ $(1 \leq k…
It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…
A family of sets has the $(p,q)$ property if among any $p$ members of the family some $q$ have a nonempty intersection. It is shown that for every $p\ge q\ge d+1$ there is a $c=c(p,q,d)<\infty$ such that for every family $\scr F$ of…
We resolve affirmatively some conjectures of Reiner, Stanton, and White \cite{ReinerComm} regarding enumeration of transportation matrices which are invariant under certain cyclic row and column rotations. Our results are phrased in terms…
A classical result of Artin states that the ideal generated by symmetric polynomials in $n$ variables is of codimension $n!$. The author, F. Bergeron and N. Bergeron have recently obtained a surprising analogous in the case of…
Denoting by $C_n(X)$ the configuration space of $n$ distinct points in $X$, with $X$ being either Euclidean $3$-space $\mathbb{E}^3$ or hyperbolic $3$-space $\mathbb{H}^3$ or $\mathbb{C}P^1$ , by $\mathscr{P}_{k,d}$ the vector space of…
This paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing…
We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in…
We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…
The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens…
In this paper, we consider the lengths of cycles that can be embedded on the edges of the generalized pancake graphs which are the Cayley graph of the generalized symmetric group $S(m,n)$, generated by prefix reversals. The generalized…
We show that for every $k \in \mathbb{N}$ there exists $C > 0$ such that if $p^k \ge C \log^8 n / n$ then asymptotically almost surely the random graph $G_{n,p}$ contains the $k$\textsuperscript{th} power of a Hamilton cycle. This…