Related papers: Balanced rectangles over Sturmian words and minima…
We take a global view at substitution invariant Sturmian sequences. We show that homogeneous substitution invariant Sturmian sequences $s_{\alpha,\alpha}$ can be indexed by two binary trees, associated directly to Johannes Kepler's tree of…
We consider the empirical eigenvalue distribution of an $m\times m$ principle submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. Earlier work of Petz and R\'effy identified the limiting spectral measure…
The present paper analyzes the discrepancy of distribution of rational points on general semisimple algebraic group varieties. The results include mean-square, almost sure, and uniform discrepancy estimates with explicit error bounds, which…
In this paper, we establish an optimal dual version of trace estimate involving angular regularity. Based on this estimate, we get the generalized Morawetz estimates and weighted Strichartz estimates for the solutions to a large class of…
Stolarsky's invariance principle quantifies the deviation of a subset of a metric space from the uniform distribution. Classically derived for spherical sets, it has been recently studied in a number of other situations, revealing a general…
We present a novel method for approximately equilibrating a matrix $A \in {\bf R}^{m \times n}$ using only multiplication by $A$ and $A^T$. Our method is based on convex optimization and projected stochastic gradient descent, using an…
Let $\{x_{\alpha}\}_{\alpha \in \mathbb{Z}}$ and $\{y_{\alpha}\}_{\alpha \in \mathbb{Z}}$ be two independent collections of zero mean, unit variance random variables with uniformly bounded moments of all orders. Consider a nonsymmetric…
We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…
The aim of this paper is to study new classes of Riemannian manifolds endowed with a smooth potential function, including in a general framework classical canonical structures such as Einstein, harmonic curvature and Yamabe metrics, and,…
We study W-algebras obtained by quantum Hamiltonian reduction of $sl(Mn)$ associated to the $sl(2)$ embedding of rectangular type. The algebra can be realized as the asymptotic symmetry of higher spin gravity with $M \times M$ matrix valued…
We consider randomized Verblunsky parameters for orthogonal polynomials on the unit circle as they relate to the problem of Steklov, bounding the polynomials' uniform norm independent of $n$.
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…
We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth…
This paper revisits Menzerath's Law, also known as the Menzerath-Altmann Law, which models a relationship between the length of a linguistic construct and the average length of its constituents. Recent findings indicate that simple…
In the first part of the paper, we define an approximated Brunn-Minkowski inequality which generalizes the classical one for length spaces. Our new definition based only on distance properties allows us also to deal with discrete spaces.…
In this paper we show that, using combinatorial inequalities and Matrix-Averages, we can generate Musielak-Orlicz spaces, i.e., we prove that $1/\pi \sum_{\pi} \max\limits_{1 \leq i \leq n} \abs{x_i y_{i\pi(i)}} \sim \norm{x}_{\Sigma M_i}$,…
The statistical shape analysis called Procrustes analysis minimizes the distance between matrices by similarity transformations. The method returns a set of optimal orthogonal matrices, which project each matrix into a common space. This…
A word $\sigma=\sigma_1...\sigma_n$ over the alphabet $[k]=\{1,2,...,k\}$ is said to be {\em smooth} if there are no two adjacent letters with difference greater than 1. A word $\sigma$ is said to be {\em smooth cyclic} if it is a smooth…
This paper is devoted to improvements of functional inequalities based on scalings and written in terms of relative entropies. When scales are taken into account and second moments fixed accordingly, deficit functionals provide explicit…
It has long been known that complex balanced mass-action systems exhibit a restrictive form of behaviour known as locally stable dynamics. This means that within each compatibility class $\mathcal{C}_{\mathbf{x}_0}$---the forward invariant…