Related papers: Affine shuffles, shuffles with cuts, the Whitehous…
The author and Nakano recently proved that multiplicities in a Specht filtration of a symmetric group module are well-defined precisely when the characteristic is at least five. This result suggested the possibility of a symmetric group…
We study a generalization of the affine preferential attachment model where triangles are randomly added to the graph. We show that the model exhibits an asymptotically power-law degree distribution with adjustable parameter $\gamma\in…
We study basic geometric properties of some group analogue of affine Springer fibers and compare with the classical Lie algebra affine Springer fibers. The main purpose is to formulate a conjecture that relates the number of irreducible…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…
Automorphisms of finite order and real forms of "smooth" affine Kac-Moody algebras are studied, i.e. of 2-dimensional extensions of the algebra of smooth loops in a simple Lie algebra. It is shown that they can be parametrized by certain…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…
Fusion product originates in the algebraisation of the operator product expansion in conformal field theory. Read and Saleur (2007) introduced an analogue of fusion for modules over associative algebras, for example those appearing in the…
This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
We study representations of groups by "affine" automorphisms of compact, convex spaces, with special focus on "irreducible" representations: equivalently "minimal" actions. When the group in question is PSL(2,R), we exhibit a one-one…
Work on generalizations of the Cohen-Lenstra and Cohen-Martinet heuristics has drawn attention to probability measures on the space of isomorphism classes of profinite groups. As is common in probability theory, it would be desirable to…
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
The distribution of products of random matrices chosen from fixed spherical classes is determined for classical rank 1 symmetric spaces. It is observed that $n\to\infty$ limit behaves approximately as in the abelian case. A theorem on the…
As computer clusters are found to be highly effective for handling massive datasets, the design of efficient parallel algorithms for such a computing model is of great interest. We consider ({\alpha}, k)-minimal algorithms for such a…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…
We construct a family of PBWD bases for the positive subalgebras of quantum loop algebras of type $B_n$ and $G_2$, as well as their Lusztig and RTT (for type $B_n$ only) integral forms, in the new Drinfeld realization. We also establish a…
Unbiased shuffling algorithms, such as the Fisher-Yates shuffle, are often used for shuffle play in media players. These algorithms treat all items being shuffled equally regardless of how similar the items are to each other. While this may…