Related papers: Another involution principle-free bijective proof …
Richardson tableaux are a remarkable subfamily of standard Young tableaux introduced by Karp and Precup in order to index the irreducible components of Springer fibers equal to Richardson varieties. We show that the set of insertion…
Applying an inductive technique for Stein and zero bias couplings yields Berry-Esseen theorems for normal approximation for two new examples. The conditions of the main results do not require that the couplings be bounded. Our two…
We give a stability result for sparse convolutions on $\ell^2(G)\times \ell^1(G)$ for torsion-free discrete Abelian groups $G$ such as $\mathbb{Z}$. It turns out, that the torsion-free property prevents full cancellation in the convolution…
We introduce the concept of boundary degeneracy of topologically ordered states on a compact orientable spatial manifold with boundaries, and emphasize that the boundary degeneracy provides richer information than the bulk degeneracy.…
We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(\lambda,\mu)$ of shape $\lambda=(m,n^b)$ and content $\mu$, a $(b+2)$-tuple. We prove that $(SSYT(\lambda,\mu),\langle \partial^{b+2} \rangle, f(q))$ exhibits the…
Peterson and Proctor obtained a formula which expresses the multivariate generating function for $P$-partitions on a $d$-complete poset $P$ as a product in terms of hooks in $P$. In this paper, we give a skew generalization of…
Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…
We propose an approach to symbolic regression based on a novel variational autoencoder for generating hierarchical structures, HVAE. It combines simple atomic units with shared weights to recursively encode and decode the individual nodes…
We propose and analyze a hybridized discontinuous Galerkin (HDG) method for the spherically symmetric Einstein--scalar system in Bondi gauge. After rewriting the model as a local first-order PDE--ODE system by introducing suitable scaled…
In this paper, we propose Barrier Hamiltonian Monte Carlo (BHMC), a version of the HMC algorithm which aims at sampling from a Gibbs distribution $\pi$ on a manifold $\mathrm{M}$, endowed with a Hessian metric $\mathfrak{g}$ derived from a…
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
We study the Maurer-Cartan equation of the pre-Lie algebra of graphs controling the deformation theory of associative algebras and prove that there is a canonical solution within the class of graphs without circuits, without assuming the…
Building upon the rule-algebraic stochastic mechanics framework, we present new results on the relationship of stochastic rewriting systems described in terms of continuous-time Markov chains, their embedded discrete-time Markov chains and…
In a recent preprint, Lai showed that the quotient of generating functions of weighted lozenge tilings of two "half hexagons with lateral dents", which differ only in width, factors nicely, and the same is true for the quotient of…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…
We prove the Lukacs-Olkin-Rubin theorem without invariance of the distribution of the "quotient", which was the key assumption in the original proof of [Olkin--Rubin, Ann. Math. Stat. 33 (1962), 1272--1280]. Instead we assume existence of…
We construct a new bijection between the set of $n\times k$ $0$-$1$ matrices with no three $1$'s forming a $\Gamma$ configuration and the set of $(n,k)$-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two…
We study the problem of generating connected random graphs with no self-loops or multiple edges and that, in addition, have a given degree sequence. The generation method we focus on is the edge-switching Markov-chain method, whose…
A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is…
Decoding complex relationships among large numbers of variables with relatively few observations is one of the crucial issues in science. One approach to this problem is Gaussian graphical modeling, which describes conditional independence…