English
Related papers

Related papers: On the Lipschitz Constant of the RSK Correspondenc…

200 papers

Persistent Laplacians are matrix operators that track how the shape and structure of data transform across scales and are popularly adopted in biology, physics, and machine learning. Their eigenvalues are concise descriptors of geometric…

Machine Learning · Computer Science 2025-06-27 Le Vu Anh , Mehmet Dik , Nguyen Viet Anh

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…

Combinatorics · Mathematics 2021-10-22 Alexander Clifton , Bishal Deb , Yifeng Huang , Sam Spiro , Semin Yoo

A family of permutations $A \subset S_n$ is said to be \emph{$t$-set-intersecting} if for any two permutations $\sigma, \pi \in A$, there exists a $t$-set $x$ whose image is the same under both permutations, i.e. $\sigma(x)=\pi(x)$. We…

Combinatorics · Mathematics 2019-12-06 David Ellis

A set in the Euclidean plane is constructed whose image under the classical Radon transform is Lipschitz in every direction. It is also shown that, under mild hypotheses, for any such set the function which maps a direction to the…

Classical Analysis and ODEs · Mathematics 2016-09-22 Jonas Azzam , Jonathan Hickman , Sean Li

Given a permutation $\sigma$, the Robinson-Schensted correspondence determines a certain partition called the shape of $\sigma$. Famously, the shape measures the longest unions of increasing and decreasing subsequences, thus giving global…

Combinatorics · Mathematics 2026-05-12 William Q. Erickson

Weprovide an upper bound for generalized Littlewood-Richardson coefficients $c^w_{uv}$, where $u$ is a two-row Young diagram corresponding to a Grassmannian permutation. We end with a conjecture on the upper bounds for all such structure…

Combinatorics · Mathematics 2024-12-02 Zijie Tao , Yunchi Zheng

We infer upper and lower bounds on the exponential growth constants $\alpha(\Lambda)$, $\alpha_0(\Lambda)$, and $\beta(\Lambda)$ describing the large-$n$ behavior of, respectively, the number of acyclic orientations, acyclic orientations…

Statistical Mechanics · Physics 2019-10-09 Shu-Chiuan Chang , Robert Shrock

What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…

Combinatorics · Mathematics 2012-07-13 Nathan Linial , Zur Luria

The rank of a skew partition $\lambda/\mu$, denoted $rank(\lambda/\mu)$, is the smallest number $r$ such that $\lambda/\mu$ is a disjoint union of $r$ border strips. Let $s_{\lambda/\mu}(1^t)$ denote the skew Schur function…

Combinatorics · Mathematics 2007-05-23 Guo-Guang Yan , Arthur L. B. Yang , Joan J. Zhou

We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…

Combinatorics · Mathematics 2026-05-05 Balázs Maga

We examine the exponentially improved asymptotic expansion of the Lerch zeta function $L(\lambda,a,s)=\sum_{n=1}^\infty \exp (2\pi ni\lambda)/(n+a)^s$ for large complex values of $a$, with $\lambda$ and $s$ regarded as parameters. It is…

Classical Analysis and ODEs · Mathematics 2016-02-02 R B Paris

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…

Combinatorics · Mathematics 2019-07-02 Colin Defant

It is well established that to ensure or certify the robustness of a neural network, its Lipschitz constant plays a prominent role. However, its calculation is NP-hard. In this note, by taking into account activation regions at each layer…

Optimization and Control · Mathematics 2024-02-05 Mohammed Sbihi , Sophie Jan , Nicolas Couellan

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…

General Mathematics · Mathematics 2026-05-21 E. G. Santos

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

We give, as $L$ grows to infinity, an explicit lower bound of order $L^{n/m}$ for the expected Betti numbers of the vanishing locus of a random linear combination of eigenvectors of $P$ with eigenvalues below $L$. Here, $P$ denotes an…

Spectral Theory · Mathematics 2016-04-20 Damien Gayet , Jean-Yves Welschinger

For a lattice $\Lambda$ with $n$ vertices and dimension $d$ equal or higher than two, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral…

Statistical Mechanics · Physics 2009-11-11 Shu-Chiuan Chang , Wenya Wang

Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…

Machine Learning · Computer Science 2023-06-21 Blaise Delattre , Quentin Barthélemy , Alexandre Araujo , Alexandre Allauzen

We study the Steinberg variety associated to matrix Schubert varieties, and develop a Robinson-Schensted type correspondence, $\tau\leftrightarrow(\Lambda,\mathsf Q,\mathsf P)$. Here $\tau$ is a partial permutation of size $p\times q$,…

Algebraic Geometry · Mathematics 2020-10-28 Rahul Singh

In this paper we present explicit estimate for Lipschitz constant of solution to a problem of calculus of variations. The approach we use is due to Gamkrelidze and is based on the equivalence of the problem of calculus of variations and a…

Optimization and Control · Mathematics 2017-12-14 Miguel Oliveira , Georgi Smirnov