Related papers: On Descents in Standard Young Tableaux
The latent variables learned by VAEs have seen considerable interest as an unsupervised way of extracting features, which can then be used for downstream tasks. There is a growing interest in the question of whether features learned on one…
In this paper we investigate functions that are harmonic with respect to the non-symmetric strictly $\alpha$-stable L\'evy processes on an open set $D \in \mathbb{R}^d$. We obtain the explicit formula for their boundary decay rate at parts…
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we…
We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…
We investigate the statistical behavior of gradient descent iterates with dropout in the linear regression model. In particular, non-asymptotic bounds for the convergence of expectations and covariance matrices of the iterates are derived.…
We construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide…
Recent years have seen growing interest in learning disentangled representations, in which distinct features, such as size or shape, are represented by distinct neurons. Quantifying the extent to which a given representation is disentangled…
In this note, we formulate a "one-sided" version of Wormald's differential equation method. In the standard "two-sided" method, one is given a family of random variables which evolve over time and which satisfy some conditions including a…
We propose conditions for the emergence of Turing patterns in a domain that changes in size by homogeneous growth/shrinkage. These conditions to determine the bifurcation are based on considering the geometric change of a potential function…
We analyze the valuation partial differential equation for European contingent claims in a general framework of stochastic volatility models where the diffusion coefficients may grow faster than linearly and degenerate on the boundaries of…
We consider a large class of 2D area-preserving diffeomorphisms that are not uniformly hyperbolic but have strong hyperbolicity properties on large regions of their phase spaces. A prime example is the Standard map. Lower bounds for…
Recent studies show that transformer-based architectures emulate gradient descent during a forward pass, contributing to in-context learning capabilities - an ability where the model adapts to new tasks based on a sequence of prompt…
We investigate certain large deviation asymptotics concerning random interlacements in Z^d, d bigger or equal to 3. We find the principal exponential rate of decay for the probability that the average value of some suitable non-decreasing…
The issue of a "mean shape" of a random set $X$ often arises, in particular in image analysis and pattern detection. There is no canonical definition but one possible approach is the so-called Vorob'ev expectation $\E_V(X)$, which is…
The well known Jensen inequality, holds true for every convex functions. However, we found that it is possible to apply it to some problems related to nonconvex functions for which Jensen's inequality holds true locally. Having considered a…
We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…
Closed formulas are known for $S(k,0;n)$, the number of standard Young tableaux of size $n$ and with at most $k$ parts, where $1\le k\le 5$. Here we study the analogue problem for $S(k,\ell;n)$, the number of standard Young tableaux of size…
We estimate the expected value of certain function $f:\{-1,1\}^{n}\to\mathbb{R}$. For example, with computer assistance, we show that if $\Delta$ is the Laplacian of the Cayley graph of…