Related papers: On Mappings on the Hypercube with Small Average St…

Let $r(n,k)$ (resp. $s(n,k)$) be the number of Schr\"oder paths (resp. little Schr\"oder paths) of length $2n$ with $k$ hills, and set $r(0,0)=s(0,0)=1$. We bijectively establish the following recurrence relations: \begin{align*}…

Given a compact interval $[a,b] \subset [0,\pi]$, we construct a parabolic self-map of the upper half-plane whose set of slopes is $[a,b]$. The nature of this construction is completely discrete and explicit: we explicitly construct a…

We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their $p$-th power for…

For each pseudo-Anosov map $\phi$ on surface $S$, we will associate it with a $\mathbb{Q}$-submodule of $\mathbb{R}$, denoted by $A(S,\phi)$. $A(S,\phi)$ is defined by an interaction between the Thurston norm and dilatation of pseudo-Anosov…

We are interested in the distribution of Wishart samples after forgetting their scaling factors. We call such a distribution a projective Wishart distribution. We show that projective Wishart distributions have strong links with the…

We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns…

Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

We introduce the concept of a hyperuniformity disorder length that controls the variance of volume fraction fluctuations for randomly placed windows of fixed size. In particular, fluctuations are determined by the average number of…

An ordered matching of size $n$ is a graph on a linearly ordered vertex set $V$, $|V|=2n$, consisting of $n$ pairwise disjoint edges. There are three different ordered matchings of size two on $V=\{1,2,3,4\}$: an alignment…

In a projective plane $\Pi _{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $\Pi _{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following…

Diffusion properties of a self-avoiding polymer embedded in regularly distributed obstacles with spacing a=20 and confined in two dimensions is studied numerically using the extended bond fluctuation method which we have developed recently.…

We investigate the rate of convergence of the iterates of an n-dimensional quasiregular mapping within the basin of attraction of a fixed point of high local index. A key tool is a refinement of a result that gives bounds on the distortion…

This paper studies an asymptotic framework for conducting inference on parameters of the form $\phi(\theta_0)$, where $\phi$ is a known directionally differentiable function and $\theta_0$ is estimated by $\hat \theta_n$. In these settings,…

We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the…

Quasiconformal maps are homeomorphisms with useful local distortion inequalities; infinitesimally, they map balls to ellipsoids with bounded eccentricity. This leads to a number of useful regularity properties, including quantitative…

For $d\ge 3$ we first show that the Hausdorff dimension of the set of $A$-divergent on average points in the $(d-1)$-dimensional closed horosphere in the space of $d$-dimensional Euclidean lattices, where $A$ is the group of positive…

In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\mu\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a…

We show that the diameter of a uniformly drawn spanning tree of a simple connected graph on $n$ vertices with minimal degree linear in $n$ is typically of order $\sqrt{n}$. A byproduct of our proof, which is of independent interest, is that…

Let $n\geq 2$ and $r\in \{1, \cdots, n-1\}$ be integers, $M$ be a compact smooth K\''ahler manifold of complex dimension $n$, $E$ be a holomorphic vector bundle with complex rank $r$ and equipped with an hermitian metric $h_E$, and $L$ be…