Related papers: Exponential-Size Circuit Complexity is Comeager in…
Random coding, expurgated and sphere packing bounds are derived by method of types and method of graph decomposition for $E$-capacity of discrete memoryless channel (DMC). Three decoding rules are considered, the random coding bound is…
We consider heat semigroups of the form $\exp(t(\Delta - \lambda\mathbf{1}_{\Omega_0}))$ on bounded domains. These singularly perturbed equations arise in certain models of diffusion limited chemical reactions. Using variants of Moser…
Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…
We study an energy-constrained random walker on a length-$N$ interval of the one-dimensional integer lattice, with boundary reflection. The walker consumes one unit of energy for every step taken in the interior, and energy is replenished…
Let $1\leq p\leq q\leq\infty.$ Being motivated by the classical notions of limited, $p$-limited and coarse $p$-limited subsets of a Banach space, we introduce and study $(p,q)$-limited subsets and their equicontinuous versions and coarse…
We bound an exponential sum that appears in the study of irregularities of distribution (the low-frequency Fourier energy of the sum of several Dirac measures) by geometric quantities: a special case is that for all $\left\{ x_1, \dots,…
We study the Poincare-Bendixson theorem for two-dimensional continuous dynamical systems in compact domains from the point of view of computation, seeking algorithms for finding the limit cycle promised by this classical result. We start by…
We show that any DNNF circuit that expresses the set of linear orders over a set of $n$ candidates must be of size $2^{\Omega(n)}$. Moreover, we show that there exist DNNF circuits of size $2^{O(n)}$ expressing linear orders over $n$…
We consider the semiclassical limit of systems of autonomous PDE's in 1+1 space-time dimensions in a scattering regime. We assume the matrix valued coefficients are analytic in the space variable and we further suppose that the…
Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…
The loop $O(n)$ model is a model for a random collection of non-intersecting loops on the hexagonal lattice, which is believed to be in the same universality class as the spin $O(n)$ model. It has been conjectured that both the spin and the…
The finite-size critical properties of the ${\cal O}(n)$ vector $\phi^4$ model, with long-range interaction decaying algebraically with the interparticle distance $r$ like $r^{-d-\sigma}$, are investigated. The system is confined to a…
The local Rademacher complexity framework is one of the most successful general-purpose toolboxes for establishing sharp excess risk bounds for statistical estimators based on the framework of empirical risk minimization. Applying this…
We give examples of semiclassical Schr\"odinger operators with exponentially large cutoff resolvent norms, even when the supports of the cutoff and potential are very far apart. The examples are radial, which allows us to analyze the…
We prove that if conditions I-II (below) hold and there is a sequence of Boolean functions $f_n$ hard to approximate by p-size circuits such that p-size circuit lower bounds for $f_n$ do not have p-size proofs in Extended Frege system EF,…
Nondeterministic circuits are a nondeterministic computation model in circuit complexity theory. In this paper, we prove a $3(n-1)$ lower bound for the size of nondeterministic $U_2$-circuits computing the parity function. It is known that…
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…
We study the solvability of boundary-value problems for differential-operator equations of the second order in L p (0, 1; X), with 1 < p < +$\infty$, X being a UMD complex Banach space. The originality of this work lies in the fact that we…
There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…
This paper is concerned with the study of the criticality of families of planar centers. More precisely, we study sufficient conditions to bound the number of critical periodic orbits that bifurcate from the outer boundary of the period…