Related papers: A non-iterative straightening algorithm and orthog…
Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…
When modeling scientific and industrial problems, geometries are typically modeled by explicit boundary representations obtained from computer-aided design software. Unfitted (also known as embedded or immersed) finite element methods offer…
Our contribution is two-folded. First, starting from the known fact that every real skew-Hamiltonian matrix has a real Hamiltonian square root, we give a complete characterization of the square roots of a real skew-Hamiltonian matrix W.…
Let $\Bbbk$ be an algebraically closed field of characteristic zero. Let $\mathrm{Sch}/\Bbbk$ denote the category of schemes of finite type over $\Bbbk$. Let $B$ be a connected projective scheme over $\Bbbk$ and let $\mathcal L$ be an ample…
In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…
We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…
We consider the refined Schur superconformal index of 4d $\mathcal N=4$ $U(N)$ SYM and the first term of its giant-graviton expansion, first predicted in arXiv:2001.11667 using indirect superconformal algebra considerations and analytic…
Skew stable Grothendieck polynomials are $K$-theoretic analogues of skew Schur polynomials. We give a free-fermionic presentation of skew stable Grothendieck polynomials and their dual symmetric functions. By using our presentation, we…
Let $k$ and $m$ be positive integers and $\lambda/\mu$ a skew partition. We compute the principal specialization of the skew Schur polynomials $s_{\lambda /\mu}(x_1, \ldots, x_{k})$ modulo $q^m-1$ under suitable conditions. We interpret the…
In this paper we give a symbolical formula and a cancellation-free formula for the Schur elements associated to the simple modules of the degenerate cyclotomic Hecke algebras. As some direct applications, we show that the Schur elements are…
We prove a sharp stability estimate for Schur iterates of contractive analytic functions in the open unit disk. We then apply this result in the setting of the inverse scattering approach and obtain a fast algorithm for solving the discrete…
We present a non-perturbative formulation of renormalization by viewing the regularized Schwinger-Dyson hierarchy as a meromorphic connection, that is, as a D-module on the product of spacetime with the regulator disc. The irregular…
We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum…
In this article, we realize skew-gentle algebras as skew-tiling algebras associated to admissible partial triangulations of punctured marked surfaces. Based on this, we establish a bijection between tagged permissible curves and certain…
We investigate discretizations of the integrable discrete nonlinear Schr\"odinger dynamical system and related symplectic structures. We develop an effective scheme of invariant reducing the corresponding infinite system of ordinary…
Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…
Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…
The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed…
We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…
The simulation of fracture using continuum ductile damage models attains a pathological discretization dependence caused by strain localization, after loss of ellipticity of the problem, in regions whose size is connected to the spatial…