Related papers: Mitosis recursion for coefficients of Schubert pol…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…
In recent work, Hamaker, Pechenik, Speyer, and Weigandt showed that a certain differential operator $\nabla$ expands positively in the basis of Schubert polynomials. For $\pi$ a dominant permutation, Gaetz and Tung showed an analogous…
The present work is inspired by three interrelated themes: Weingarten calculus for integration over unitary groups, monotone Hurwitz numbers which enumerate certain factorisations of permutations into transpositions, and Jucys-Murphy…
We propose the Bayesian bridge estimator for regularized regression and classification. Two key mixture representations for the Bayesian bridge model are developed: (1) a scale mixture of normals with respect to an alpha-stable random…
We introduce the notion of syzygy for a set of reduction operators and relate it to the notion of syzygy for presentations of algebras. We give a method for constructing a linear basis of the space of syzygies for a set of reduction…
In 2011, Rubey generalized chute and ladder moves on the set of reduced pipe dreams for a permutation $w$ and conjectured that the induced poset on reduced pipe dreams is a lattice. In this paper, we prove this conjecture. Our key tool is a…
Method for a mosaic image representation (MIR) is proposed for a selective treatment of image fragments of different transition frequency. MIR method is based on piecewise-constant image approximation on a non-uniform orthogonal grid…
We propose a hybrid iterative method based on MIONet for PDEs, which combines the traditional numerical iterative solver and the recent powerful machine learning method of neural operator, and further systematically analyze its theoretical…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
We study cocycles (non-autonomous dynamical systems) satisfying a certain squeezing condition with respect to the quadratic form of a bounded self-adjoint operator acting in a Hilbert space. We prove that (under additional assumptions) the…
The zeta and Moebius transforms over the subset lattice of $n$ elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires $O(3^n)$ arithmetic…
This is the extended version of a survey prepared for publication in the Springer INdAM series. Superbosonisation, introduced by Littelmann-Sommers-Zirnbauer, is a generalisation of bosonisation, with applications in Random Matrix Theory…
We prove a root system uniform, concise combinatorial rule for Schubert calculus of_minuscule_ and_cominuscule_ flag manifolds G/P (the latter are also known as "compact Hermitian symmetric spaces"). We connect this geometry to the poset…
We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…
Data matrix having different sets of entities in its rows and columns are known as two mode data or affiliation data. Many practical problems require to find relationships between the two modes by simultaneously clustering the rows and…
From the works of Rauzy and Thurston, we know how to construct (multiple) tilings of some Euclidean space using the conjugates of a Pisot unit $\beta$ and the greedy $\beta$-transformation. In this paper, we consider different…
This paper studies the algorithms for the minimisation of weighted automata. It starts with the definition of morphisms-which generalises and unifies the notion of bisimulation to the whole class of weighted automata-and the unicity of a…
In our previous work we have introduced an analogue of Robinson-Schensted-Knuth correspondence for Schubert calculus of the complete flag varieties. The objects inserted are certain biwords, the outcomes of insertion are bumpless pipe…
We prove that twisted versions of Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i+\partial_i)\widetilde{\mathfrak S}_w$ are monomial positive and…