Related papers: Average size of random polygons with fixed knot to…

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

Let F be a random k-SAT formula on n variables, formed by selecting uniformly and independently m = rn out of all possible k-clauses. It is well-known that if r>2^k ln 2, then the formula F is unsatisfiable with probability that tends to 1…

Given is a 1.5D terrain $\mathcal{T}$, i.e., an $x$-monotone polygonal chain in $\mathbb{R}^2$. For a given $2\le k\le n$, our objective is to approximate the largest area or perimeter convex polygon of exactly or at most $k$ vertices…

Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random…

We consider uniform spanning tree (UST) in topological polygons with $2N$ marked points on the boundary with alternating boundary conditions. In [LPW21], the authors derive the scaling limit of the Peano curve in the UST. They are variants…

We establish a new fundamental relationship between total curvature of knots and crossing number. If K is a smooth knot in 3-space, R the cross-section radius of a uniform tube neighborhood of K, L the arclength of K, and k the total…

For the reference triangle or tetrahedron $T$, we study the stability properties of the $L^2(T)$-projection $\Pi_N$ onto the space of polynomials of degree $N$. We show $\|\Pi_N u\|_{L^2(\partial T)}^2 \leq C \|u\|_{L^2(T)} \|u\|_{H^1(T)}$.…

We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval…

We consider gradient-based optimisation of wide, shallow neural networks, where the output of each hidden node is scaled by a positive parameter. The scaling parameters are non-identical, differing from the classical Neural Tangent Kernel…

Let K be a tame knot with irreducible exterior M(K) in a closed, connected, orientable 3--manifold Sigma such that pi_1(Sigma) is cyclic. If infinity is not a strict boundary slope, then the diameter of the set of strict boundary slopes of…

We use the random Green's matrix model to study the scaling properties of the localization transition for scalar waves in a three-dimensional (3D) ensemble of resonant point scatterers. We show that the probability density $p(g)$ of…

In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that,…

Given a knot K in an Euclidean space E and a finite dimensional space V of smooth functions on K, we express the expected number of critical points of a random function in V in terms of an integral-geometric invariant of K and V. When V…

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

We develop polynomial-time algorithms for near-optimal minimax mean estimation under $\ell_2$-squared loss in a Gaussian sequence model under convex constraints. The parameter space is an origin-symmetric, type-2 convex body $K \subset…

The role of the topology and its relation with the geometry of biopolymers under different physical conditions is a nontrivial and interesting problem. Aiming at understanding this issue for a related simpler system, we use Monte Carlo…

In this paper we study principal components analysis in the regime of high dimensionality and high noise. Our model of the problem is a rank-one deformation of a Wigner matrix where the signal-to-noise ratio (SNR) is of constant order, and…

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…

We consider the problem of estimating the size of a maximum cut (Max-Cut problem) in a random Erd\H{o}s-R\'{e}nyi graph on $n$ nodes and $\lfloor cn \rfloor$ edges. It is shown in Coppersmith et al. ~\cite{Coppersmith2004} that the size of…

We perform numerical studies including Monte Carlo simulations of high rotational symmetry random tilings. For computational convenience, our tilings obey fixed boundary conditions in regular polygons. Such tilings are put in correspondence…