Related papers: The geometry of optimal functionals
In this paper, we attempt to explore the landscape of two-dimensional conformal field theories (2d CFTs) by efficiently searching for numerical solutions to the modular bootstrap equation using machine-learning-style optimization. The torus…
Let $V = \{ v_1,\dots,v_N\}$ be a collection of $N$ vectors that live near a discrete sphere. We consider discrete directional maximal functions on $\mathbb{Z}^2$ where the set of directions lies in $V$, given by \[ \sup_{v \in V, k \geq C…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
We consider a family of functionals $J$ to be maximized over the planar convex sets $K$ for which the perimeter and Steiner point have been fixed. Assuming that $J$ is the integral of a quadratic expression in the support function $h$, we…
We show that, in dimension three and higher, the space of harmonic functions vanishing on the cone defined by a generically chosen harmonic quadratic polynomial is two-dimensional. This phenomenon is surprisingly robust, generalizing to…
We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…
This paper is devoted to studying the first-order variational analysis of non-convex and non-differentiable functions that may not be subdifferentially regular. To achieve this goal, we entirely rely on two concepts of directional…
Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…
CFTs are naturally defined on Riemann surfaces. The rational ones can be solved using methods from algebraic geometry. One particular feature is the covariance of the partition function under the mapping class group. In genus $g=1$, this…
For arbitrary planar convex domain, we compute the behavior of Christoffel function up to a constant factor using comparison with other simple reference domains. The lower bound is obtained by constructing an appropriate ellipse contained…
We analyze worst-case convergence guarantees of first-order optimization methods over a function class extending that of smooth and convex functions. This class contains convex functions that admit a simple quadratic upper bound. Its study…
Choosing the appropriate geometry in which to express the equations of fundamental physics can have a determinant effect on the simplicity of those equations and on the way they are perceived. The point of departure in this paper is the…
Isotropic functions of positions $\hat{\bf r}_1, \hat{\bf r}_2,\ldots, \hat{\bf r}_N$, i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch-Gordan…
This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic…
This article examines the design of Quadratic Fisher Discriminants (QFDs) that operate directly on image pixels, when image ensembles are taken to comprise all rotated and reflected versions of distinct sample images. A procedure based on…
In this talk, I will discuss the use of harmonic functions to study the geometry and topology of complete manifolds. In my previous joint work with Luen-fai Tam, we discovered that the number of infinities of a complete manifold can be…
We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…