Related papers: Affine shuffles, shuffles with cuts, the Whitehous…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
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…
We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so-called ask zeta functions of direct sums of modules of matrices or…
The affine Grassmannian of $SL_n$ admits an embedding into the Sato Grassmannian, which further admits a Pl\"ucker embedding into the projectivization of Fermion Fock space. Kreiman, Lakshmibai, Magyar, and Weyman describe the linear part…
We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…
It is known that the Frank-Wolfe (FW) algorithm, which is affine-covariant, enjoys accelerated convergence rates when the constraint set is strongly convex. However, these results rely on norm-dependent assumptions, usually incurring…
We define a new family of symmetric functions which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions including symmetry, dominance and conjugation. We conjecture certain positivity…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…
Let $B_t(n)$ be the number of set partitions of a set of size~$t$ into at most $n$ parts and let $B'_t(n)$ be the number of set partitions of $\{1,\ldots, t\}$ into at most $n$ parts such that no part contains both $1$ and~$t$ or both $i$…
The goal of this paper is to provide exact and terminating algorithms for the formal analysis of deterministic continuous-time control systems with affine input and polynomial state dynamics (in short, polynomial systems). We consider the…
Symmetric Positive Definite (SPD) matrices have been widely used in medical data analysis and a number of different Riemannian met-rics were proposed to compute with them. However, there are very few methodological principles guiding the…
We prove asymptotic equivalents for finite-level representations of symmetric groups, that is, for Young diagrams having all but finitely many boxes on their first row. We deduce that random walks on symmetric groups generated by conjugacy…
A connection between representation of compact groups and some invariant ensembles of Hermitian matrices is described. We focus on two types of invariant ensembles which extend the Gaussian and the Laguerre Unitary ensembles. We study them…
In this paper, we exhibit a new family of martingale couplings between two one-dimensional probability measures $\mu$ and $\nu$ in the convex order. This family is parametrised by two dimensional probability measures on the unit square with…
We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…
We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a…
A notion of heaps of modules as an affine version of modules over a ring or, more generally, over a truss, is introduced and studied. Basic properties of heaps of modules are derived. Examples arising from geometry (connections, affine…
In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of…
We give a new formula for the Littlewood--Richardson coefficients in terms of peelable tableaux compatible with shuffle tableaux, in the same fashion as Remmel--Whitney rule. This gives an efficient way to compute generalized…
Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…