English
Related papers

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

200 papers

We give asymptotic bounds for the optimal Lipschitz constants for the systole map from the Teichmuller space to the curve complex. We give similar results to those known for closed surfaces in the cases when the genus is fixed or the ratio…

Geometric Topology · Mathematics 2014-09-10 Aaron D. Valdivia

We obtain sharp bounds for the modulus of continuity of the uncentered maximal function in terms of the modulus of continuity of the given function, via integral formulas. Some of the results deduced from these formulas are the following:…

Classical Analysis and ODEs · Mathematics 2010-09-08 J. M. Aldaz , L. Colzani , J. Pérez Lázaro

One classical measure of the quality of an interpolating function is its Lipschitz constant. In this paper we consider interpolants with additional smoothness requirements, in particular that their derivatives be Lipschitz. We show that…

Classical Analysis and ODEs · Mathematics 2016-04-15 Matthew J. Hirn

For a given permutation $\pi_n$ in $S_n$, a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (\pi_n(i) - \pi_n (j)) < 0$. In this paper, we study various statistics of random…

Combinatorics · Mathematics 2021-08-02 Oğuz Gürerk , Ümit Işlak , Mehmet Akif Yıldız

This paper considers the evolution dynamics of the free boundaries in terms of the change of $m$, the allowed amount of transported mass or the change of $\lambda$, the transportation cost cap, i.e. the allowed maximum cost for a unit mass…

Analysis of PDEs · Mathematics 2015-08-12 Gonzalo Davila , Young-Heon Kim

A triangle group is denoted by $\Delta(p,q,r)$ and has finite presentation $$ \Delta(p,q,r)=\langle x,y | x^p=y^q=(xy)^r=1 \rangle .$$ We examine a method for composition of permutation representations of a triangle group $\Delta(p,q,r)$…

Group Theory · Mathematics 2017-08-03 Siddiqua Mazhar

The following Proposition is a positive answer to a question about cancellations between permutations that arises in a model problem in the many body theory of Fermions. It concerns the mathematically rigorous implementation of the Pauli…

Combinatorics · Mathematics 2013-12-05 Nikola Djokic

Lipschitz constants are connected to many properties of neural networks, such as robustness, fairness, and generalization. Existing methods for computing Lipschitz constants either produce relatively loose upper bounds or are limited to…

Machine Learning · Computer Science 2022-10-17 Zhouxing Shi , Yihan Wang , Huan Zhang , Zico Kolter , Cho-Jui Hsieh

The "pancake problem" asks how many prefix reversals are sufficient to sort any permutation $\pi \in \mathcal{S}_k$ to the identity. We write $f(k)$ to denote this quantity. The best known bounds are that $\frac{15}{14}k -O(1) \le f(k)\le…

Combinatorics · Mathematics 2022-11-29 Zach Hunter

For a class of reaction-diffusion equations describing propagation phenomena, we prove that for any entire solution $u$, the level set $\{u=\lambda\}$ is a Lipschitz graph in the time direction if $\lambda$ is close to $1$. Under a further…

Analysis of PDEs · Mathematics 2020-10-23 Kelei Wang

In this paper, we study permutations $\pi \in S_n$ with exactly $m$ transpositions. In particular, we are interested in the expected value of $\pi(1)$ when such permutations are chosen uniformly at random. When $n$ is even, this expected…

Combinatorics · Mathematics 2021-12-13 Peter Kagey

We study a new bi-Lipschitz invariant \lambda(M) of a metric space M; its finiteness means that Lipschitz functions on an arbitrary subset of M can be linearly extended to functions on M whose Lipschitz constants are enlarged by a factor…

Metric Geometry · Mathematics 2007-05-23 A. Brudnyi , Yu. Brudnyi

Let $(\varphi_i)_{i=1}^n$ be mutually orthogonal functions on a probability space such that $\|\varphi_i\|_\infty \leq 1 $ for all $i \in [n]$. Let $\alpha > 0$. Let $\Phi(u) = u^2 \log^{\alpha}(u)$ for $u \geq u_{0}$, and $\Phi(u) =…

Classical Analysis and ODEs · Mathematics 2025-09-05 Will Burstein

Let $\lambda$ be a partition of the positive integer $n$ chosen umiformly at random among all such partitions. Let $L_n=L_n(\lambda)$ and $M_n=M_n(\lambda)$ be the largest part size and its multiplicity, respectively. For large $n$, we…

Probability · Mathematics 2017-12-12 Ljuben Mutafchiev

This paper explores the partition properties of roller coaster permutations, a class of permutations characterized by maximizing the number of alternating runs in all subsequences. We establish a connection between the structure of these…

Combinatorics · Mathematics 2026-01-01 William Adamczak

Let $F$ be a non-Archimedean locally compact field. We show that the local Langlands correspondence over $F$ has a strong property generalizing the higher ramification theorem of local class field theory. If $\pi$ is an irreducible cuspidal…

Number Theory · Mathematics 2017-09-26 Colin J. Bushnell , Guy Henniart

Let $K$ be a field of characteristic two, and let $\lambda$ be a two-part partition of some natural number $r$. Denote the permutation module corresponding to the (maximal) Young subgroup $\Sigma_\lambda$ in $\Sigma_r$ by $M^\lambda$. We…

Representation Theory · Mathematics 2007-05-23 Stephen Doty , Karin Erdmann , Anne Henke

This paper considers to the equation [\int_{S} \frac{U(Q)}{|P-Q|^{N-1}} dS(Q) = F(P), P \in S,] where the surface S is the graph of a Lipschitz function \phi on R^N, which has a small Lipschitz constant. The integral in the left-hand side…

Analysis of PDEs · Mathematics 2014-05-06 V. Kozlov , J. Thim , B. O. Turesson

Lipschitz constants for the width and diameter functions of a convex body in $\mathbb R^n$ are found in terms of its diameter and thickness (maximum and minimum of both functions). Also, a dual approach to thickness is proposed.

Metric Geometry · Mathematics 2026-02-17 Oleg Mushkarov , Nikolai Nikolov , Pascal J. Thomas

We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow…

Discrete Mathematics · Computer Science 2014-02-21 Anke van Zuylen , James Bieron , Frans Schalekamp , Gexin Yu