相关论文: The formula for the permutation of mutation sequen…

We describe the conjugation of the reddening sequence according to the formula of $c$-vectors with respect to changing the initial seed. As applications, we extend the Rotation Lemma, the Target before Source Theorem, and the mutation…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

The circular descent of a permutation $\sigma$ is a set $\{\sigma(i)\mid \sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumerations of permutations by the circular descent set. Let $cdes_n(S)$ be the number of permutations of…

Given a framed quiver, i.e. one with a frozen vertex associated to each mutable vertex, there is a concept of green mutation, as introduced by Keller. Maximal sequences of such mutations, known as maximal green sequences, are important in…

In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…

For any quiver mutation sequence, we define a pair of matrices that describe a fixed point equation of a cluster transformation determined from the mutation sequence. We give an explicit relationship between this pair of matrices and the…

In a recent paper by K.-H. Lee, K. Lee and M. Mills, a mutation of reflections in the universal Coxeter group is defined in association with a mutation of a quiver. A matrix representation of these reflections is determined by a linear…

We give a precise definition of mutation of skew symmetrizable matrices over group rings and relate it to folding and mutation of quivers with symmetries. These matrices can have non-zero diagonal entries and we explain a mutation rule in…

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…

A proper version of the proto renormalization-group scheme is presented to derive amplitude equations in striped pattern formation with conserved and nonconserved order parameter. In the conserved case, the result preserves the conservation…

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.

We use semi-invariant pictures to prove two conjectures about maximal green sequences. First: if $Q$ is any acyclic valued quiver with an arrow $j\to i$ of infinite type then any maximal green sequence for $Q$ must mutate at $i$ before…

A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…

We derive the renormalization group equations for the neutrino masses and mixing angles in explicit form and discuss the possible classes of their solutions. We identify fixed points in the equations for mixing angles, which can be reached…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…

Matrices are two-dimensional data structures allowing one to conceptually organize information. For example, adjacency matrices are useful to store the links of a network; correlation matrices are simple ways to arrange gene co-expression…