Related papers: On the centrosymmetric permutations in a class
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
A noncommutative projective variety is defined, after Artin and Zhang, by a graded coherent algebra A, where the category of coherent sheaves is the quotient qgr(A) of the category of finitely presented graded modules by the subcategory of…
We study graded symmetric algebras, which are the symmetric monoids in the monoidal category of vector spaces graded by a group. We show that a finite dimensional graded semisimple algebra is graded symmetric. The center of a symmetric…
In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…
In this paper, we discuss the embedding problem for centrosymmetric matrices, which are higher order generalizations of the matrices occurring in Strand Symmetric Models. These models capture the substitution symmetries arising from the…
In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Current evolutionary biology models usually assume that a phenotype undergoes gradual change. This is in stark contrast to biological intuition, which indicates that change can also be punctuated-the phenotype can jump. Such a jump could…
We give optimal convergence rates in the central limit theorem for a large class of martingale difference sequences with bounded third moments. The rates depend on the behaviour of the conditional variances and for stationary sequences the…
A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of…
We study the limiting behavior of smooth linear statistics of the spectrum of random permutation matrices in the mesoscopic regime, when the permutation follows one of the Ewens measures on the symmetric group. If we apply a smooth enough…
In this paper we give an affirmative answer to a conjecture proposed by Danny Neftin, that is, if the commutator of two permutations has at least n-4 fixed points where two permutations are in degree n symmetric group, then there exists a…
We study the growth at the golden rotation number of Sudler's sine product. This sequence has been variously studied elsewhere as a skew product of sines, Birkhoff sum, q-Pochhammer symbol (on the unit circle), and restricted Euler…
We study higher-dimensional homological analogues of bond percolation on a square lattice and site percolation on a triangular lattice. By taking a quotient of certain infinite cell complexes by growing sublattices, we obtain finite cell…
In this paper we prove that for a fixed neat principal congruence subgroup of a Bianchi group the order of the torsion part of its second cohomology group with coefficients in an integral lattice associated to the m-th symmetric power of…
Pin permutations play an important role in the structural study of permutation classes, most notably in relation to simple permutations and well-quasi-ordering, and in enumerative consequences arising from these. In this paper, we continue…
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…
Problem 8.1 in Astaiza et. al. asks about the relationship between the cycle decomposition of a permutation $\sigma$ and that of its symmetric tensor power $\sigma ^{\odot k}$. In this paper, we investigate this question and give formulas…
We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…