Related papers: Affine shuffles, shuffles with cuts, the Whitehous…
We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle,…
Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…
Feature selection, dimension selection, and embedding compression are fundamental techniques for improving efficiency and generalization in deep recommender systems. Although conceptually related, these problems are typically studied in…
In this work, we consider the proportion of smooth (free of large prime factors) values of a binary form $F(X_1,X_2)\in\Z[X_1,X_2]$. In a particular case, we give an asymptotic equivalent for this proportion which depends on $F$. This is…
Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…
Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…
A sequence $a_n\da 0$ forms a rate of random mixing for a unitary system $(G,\mu, \pi, {\cal H})$ if for any $u, v\in {\cal H}$ $$\limsup {|<\pi (g_n^\omega)u, v>|\over a_n} < \infty$$ a.e. $\omega$ in the probability space $(G^{\mathbb N},…
A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…
Several clustering methods (e.g., Normalized Cut and Ratio Cut) divide the Min Cut cost function by a cluster dependent factor (e.g., the size or the degree of the clusters), in order to yield a more balanced partitioning. We, instead,…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
Analogues of 1-shuffle elements for complex reflection groups of type $G(m,1,n)$ are introduced. A geometric interpretation for $G(m,1,n)$ in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and…
We show that any affine invariant function on the set of positive definite matrices must factor through the determinant function, as long as the restriction of the function to scalar matrices is surjective. A motivation from robust…
We provide an equivalence between the category of affine, smooth group schemes over the ring of generalized dual numbers $k[I]$, and the category of extensions of the form $1 \rightarrow \text{Lie}(G, I) \rightarrow E \rightarrow G…
For any convex preorder on the set of positive roots of affine type A, we classify and construct all associated cuspidal and semicuspidal skew shapes. These combinatorial objects correspond to cuspidal and semicuspidal skew Specht modules…
't Hooft anomalies of discrete global symmetries and gaugings thereof have rich mathematical structures and far-reaching physical consequences. We examine each subgroup $G$, up to automorphisms, of the permutation group $S_4$ that acts on…
The homogeneous shear of the {111} planes along the <110> direction of bulk silicon has been investigated using ab initio techniques, to better understand the strain properties of both shuffle and glide set planes. Similar calculations have…
In this article we introduced algebraic sieves, i.e. selection procedures on a given finite set to extract a particular subset. Such procedures are performed by finite groups acting on the set. They are called sieves because there are…
We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…
We investigate the mathematics behind unshuffles, a type of card shuffle closely related to classical perfect shuffles. To perform an unshuffle, deal all the cards alternately into two piles and then stack the one pile on top of the other.…
We consider two types of fractional integral moduli of smoothness, which are widely used in theory of functions and approximation theory. In particular, we obtain new equivalences between these moduli of smoothness and the classical moduli…