Related papers: Skew domino Schensted algorithm and sign-imbalance
A new method for the stabilization of the sign problem in the Green Function Monte Carlo technique is proposed. The method is devised for real lattice Hamiltonians and is based on an iterative ''stochastic reconfiguration'' scheme which…
Neural operators offer powerful approaches for solving parametric partial differential equations, but extending them to spherical domains remains challenging due to the need to preserve intrinsic geometry while avoiding distortions that…
In O'Connell-Pei(2013) a q-weighted version of the Robinson-Schensted algorithm was introduced. In this paper we show that this algorithm has a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted…
We introduce new combinatorial objects called the shifted domino tableaux. We prove that these objects are in bijection with pairs of shifted Young tableaux. This bijection shows that shifted domino tableaux can be seen as elements of the…
Stembridge introduced the notion of stability for Kronecker triples which generalize Murnaghan's classical stability result for Kronecker coefficients. Sam and Snowden proved a conjecture of Stembridge concerning stable Kronecker triple,…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
We present a new kind of normalization theorem: linearization theorem for skew products. The normal form is a skew product again, with the fiber maps linear. It appears, that even in the smooth case, the conjugacy is only H\"older…
We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…
The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the (n-1)/2th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance…
We investigate the spin and pseudospin symmetry in the single-particle resonant states by solving the Dirac equation containing a Woods-Saxon potential with Green's function method. Taking double-magic nucleus $^{208}$Pb as an example,…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
Fast, accurate, and stable computation of the Clebsch-Gordan (C-G) coefficients is always desirable, for example, in light scattering simulations, the translation of the multipole fields, quantum physics and chemistry. Current recursive…
Using a transversality argument, we demonstrate the positivity of certain coefficients in the equivariant cohomology and K-theory of a generalized flag manifold. This strengthens earlier equivariant positivity theorems (of Graham and…
Score-based Generative Models (SGMs) approximate a data distribution by perturbing it with Gaussian noise and subsequently denoising it via a learned reverse diffusion process. These models excel at modeling complex data distributions and…
Random tensor models for a generic complex tensor generalize matrix models in arbitrary dimensions and yield a theory of random geometries. They support a 1/N expansion dominated by graphs of spherical topology. Their Schwinger Dyson…
Random Matrix Theory is a powerful tool in applied mathematics. Three canonical models of random matrix distributions are the Gaussian Orthogonal, Unitary and Symplectic Ensembles. For matrix ensembles defined on k-fold tensor products of…
We extend the notion of $k$-ribbon tableaux to the Fibonacci lattice, a differential poset defined by R. Stanley in 1975. Using this notion, we describe an insertion algorithm that takes $k$-colored permutations to pairs of $k$-ribbon…
If we consider previously introduced extensions of Stanley's chromatic symmetric function $X_{G}(x_1, x_2, \ldots)$ for a graph $G$ to elements in the algebra $\textsf{QSym}$ of quasisymmetric functions and in the algebra $\textsf{NCSym}$…
Skewed probit regression is but one example of a statistical model that generalizes a simpler model, like probit regression. All skew-symmetric distributions and link functions arise from symmetric distributions by incorporating a skewness…