Related papers: P$\wp$N functions, complete mappings and quasigrou…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
We study the shape of the F-signature function of a $d$-dimensional quotient singularity $\mathbb{k}[[ x_1,\ldots,x_d]]^G$, and we show that it is a quasi-polynomial. We prove that the second coefficient is always zero and we describe the…
The quasisymmetric generating function of the set of permutations whose inverses have a fixed descent set is known to be symmetric and Schur-positive. The corresponding representation of the symmetric group is called the descent…
Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is…
Let $H$ and $B$ be subgroups of a finite group $G$ such that $G=N_{G}(H)B$. Then we say that $H$ is \emph{quasipermutable} (respectively \emph{$S$-quasipermutable}) in $G$ provided $H$ permutes with $B$ and with every subgroup (respectively…
A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$…
We consider the category of finite dimensional representations of the quantum double of a finite group as a modular tensor category. We study auto-equivalences of this category whose induced permutations on the set of simple objects…
Let $X^N$ be a family of $N\times N$ independent GUE random matrices, $Z^N$ a family of deterministic matrices, $P$ a self-adjoint non-commutative polynomial, that is for any $N$, $P(X^N)$ is self-adjoint, $f$ a smooth function. We prove…
We examine a parameterized family of functions F_a, all of which are continuous and some of which are nowhere or almost nowhere differentiable, we explore the behavior of F'_a and F"_a almost everywhere for different values of a, focusing…
We construct invariant quasimorphisms for groups acting on the circle. Furthermore, we provide a criterion for the non-extendablity of the resulting quasimorphisms and an explicit formula which relates the values of our quasimorphisms to…
A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…
We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…
In this paper, we construct some new classes of complete permutation monomials with exponent $d=\frac{q^n-1}{q-1}$ using AGW criterion (a special case). This proves two recent conjectures in [Wuetal2] and extends some of these recent…
Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests…
In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F-multiplicity free. Combinatorially, this is equivalent to…
Several indices used in a factor graph data structure can be permuted without changing the underlying probability distribution. An algorithm that performs inference on a factor graph should ideally be equivariant or invariant to…
We work out axioms for the duals $G\subset U_N^+$ of the finite quantum permutation groups, $F\subset S_N^+$ with $|F|<\infty$, and we discuss how the basic theory of such quantum permutation groups partly simplifies in the dual setting. We…
In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of its quotient graphs. We apply here that procedure to the proper power graph…
Let $G$ be a graph with vertex set $V(G)$, $f$ a permutation of $V(G)$. Define $\delta_f(G)=|d(x,y)-d(f(x),f(y))|$ and $\delta_f(G)=\Sigma\delta_f(x,y)$, where the sum is taken over all unordered pair $x$, $y$ of distinct vertices of $G$.…
We study the orbits under the natural action of a permutation group $G \subseteq S_n$ on the powerset $\mathscr{P}(\{1, \dots , n\})$. The permutation groups having exactly $n+1$ orbits on the powerset can be characterized as set-transitive…