Related papers: Robust Smoothed Analysis of a Condition Number for…

We consider the Cauchy problem for the one-dimensional periodic cubic nonlinear Schr\"odinger equation (NLS) with initial data below L^2. In particular, we exhibit nonlinear smoothing when the initial data are randomized. Then, we prove…

This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of…

Suppose that a linear bounded operator $B$ on a Hilbert space exhibits at least linear GMRES convergence, i.e., there exists $M_B<1$ such that the GMRES residuals fulfill $\|r_k\|\leq M_B\|r_{k-1}\|$ for every initial residual $r_0$ and…

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

Consider a random graph $G$ of size $N$ constructed according to a \textit{graphon} $w \, : \, [0,1]^{2} \mapsto [0,1]$ as follows. First embed $N$ vertices $V = \{v_1, v_2, \ldots, v_N\}$ into the interval $[0,1]$, then for each $i < j$…

In the lattice approach to Loop Quantum Gravity on a fixed graph computations tend to be involved and are rarely analytically manageable. But, when interested in the expectation values of coherent states on the lattice which are sharply…

We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…

Let $M$ be a closed smooth connected spin manifold of even dimension $n$, let $g$ be a Riemannian metric of regularity $W^{1,p}$, $p > n$, on $M$ whose distributional scalar curvature in the sense of Lee-LeFloch is bounded below by…

This paper investigates the robustness of the Lur'e problem under positivity constraints, drawing on results from the positive Aizerman conjecture and robustness properties of Metzler matrices. Specifically, we consider a control system of…

We prove that cocompact arithmetic lattices in a simple Lie group are uniformly discrete if and only if the Salem numbers are uniformly bounded away from $1$. We also prove an analogous result for semisimple Lie groups. Finally, we shed…

In this paper, we expand on results from our previous paper "The Case Against Smooth Null Infinity I: Heuristics and Counter-Examples" [1] by showing that the failure of "peeling" (and, thus, of smooth null infinity) in a neighbourhood of…

In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…

Based on the geometric {\it Triangle Algorithm} for testing membership of a point in a convex set, we present a novel iterative algorithm for testing the solvability of a real linear system $Ax=b$, where $A$ is an $m \times n$ matrix of…

We prove a central limit theorem for smooth linear statistics associated with zero divisors of standard Gaussian holomorphic sections in a sequence of holomorphic line bundles with Hermitian metrics of class $\mathscr{C}^{3}$ over a compact…

We report surprising steady oscillations in aggregation-fragmentation processes. Oscillating solutions are observed for the class of aggregation kernels $K_{i,j} = i^{\nu}j^{\mu} + j^{\nu}i^{\mu}$ homogeneous in masses $i$ and $j$ of…

Recent work has highlighted the centrality of smooth calibration [Kakade and Foster, 2008] as a robust measure of calibration error. We generalize, unify, and extend previous results on smooth calibration, both as a robust calibration…

We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…

A binary code with covering radius $R$ is a subset $C$ of the hypercube $Q_n=\{0,1\}^n$ such that every $x\in Q_n$ is within Hamming distance $R$ of some codeword $c\in C$, where $R$ is as small as possible. For a fixed coordinate…

Let $C$ be a smooth irreducible projective curve of genus $g$ and $L$ a line bundle of degree $d$ generated by a linear subspace $V$ of $H^0(L)$ of dimension $n+1$. We prove a conjecture of D. C. Butler on the semistability of the kernel of…

The requirement that packings of hard particles, arguably the simplest structural glass, cannot be compressed by rearranging their network of contacts is shown to yield a new constraint on their microscopic structure. This constraint takes…