Related papers: Affine shuffles, shuffles with cuts, the Whitehous…
This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…
In a recent paper, Bacher and de la Harpe study conjugacy growth series of infinite permutation groups and their relationships with $p(n)$, the partition function, and $p(n)_{\textbf{e}}$, a generalized partition function. They prove…
If a tensor with various symmetries is properly unfolded, then the resulting matrix inherits those symmetries. As tensor computations become increasingly important it is imperative that we develop efficient structure preserving methods for…
We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
The eigenvalue probability density function for symplectic invariant random matrix ensembles can be generalised to discrete settings involving either a linear or exponential lattice. The corresponding correlation functions can be expressed…
Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep results as the Baik-Deift-Johansson Theorem that connect it…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
We introduce a new family of symmetric functions, which are $q$-analogues of products of Schur functions defined in terms of ribbon tableaux. These functions can be interpreted in terms of the Fock space representation of the quantum affine…
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of…
Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for…
We study spherical Schubert varieties in the affine Grassmannian. These Schubert varieties have a natural conjectural modular description due to Finkelberg-Mirkovi\'c. This modular description is easily seen to be set-theoretically correct,…
Iteration complexities for optimizing smooth functions with first-order algorithms are typically stated in terms of a global Lipschitz constant of the gradient, and near-optimal results are then achieved using fixed step sizes. But many…
This is the second part of a two-part investigation. We continue the study of a class of balanced urn schemes on balls of two colors (white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn and ball addition rules…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
We introduce an affine Schur algebra via the affine Hecke algebra associated to Weyl group of affine type C. We establish multiplication formulas on the affine Hecke algebra and affine Schur algebra. Then we construct monomial bases and…
We study the relation between quantum affine algebras of type A and Grassmannian cluster algebras. Hernandez and Leclerc described an isomorphism from the Grothendieck ring of a certain subcategory $\mathcal{C}_{\ell}$ of…
We study the property of a normal scheme, that the complement of every hypersurface is an affine scheme. To this end we introduce the affine class group. It is a factor group of the divisor class group and measures the deviation from this…
As a continuation to our previous work, we consider a generalization of carries process. Our results are : (i) right eigenvectors of the transition probability matrix, (ii) correlation of carries between different steps, and (iii)…
Analytical expressions for the distribution of the length of chords corresponding to the affine invariant measure on the set of chords are given for convex polygons. These analytical expressions are a computational improvement over other…