相关论文: Embedding univalent functions in filtering Loewner…
We introduce the notion of Loewner (ellipsoid) function for a log concave function and show that it is an extension of the Loewner ellipsoid for convex bodies. We investigate its duality relation to the recently defined John (ellipsoid)…
We show that a smooth bounded domain in $\mathbb{C}^n$ admitting partial pseudoconvex exhaustion remains partial pseudoconvex. The main ingredient of the proof is based on a new characterization of hyper-$q$-convex domains. Furthermore, we…
We study the approximation of functions which are invariant with respect to certain permutations of the input indices using flow maps of dynamical systems. Such invariant functions includes the much studied translation-invariant ones…
We consider neural networks with a single hidden layer and non-decreasing homogeneous activa-tion functions like the rectified linear units. By letting the number of hidden units grow unbounded and using classical non-Euclidean…
By using the method of Loewner chains, we establish some sufficient conditions for the analyticity and univalency of functions defined by an integral operator. Also, we refine the result to a quasiconformal extension criterion with the help…
L$^\natural$ (natural)-convex functions encompass a large class of nonlinear functions over general integer domains and arise in a wide range of real-world applications. We explore the minimization of L$^\natural$-convex functions, of…
In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…
We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…
Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…
A Daniell-Stone type characterization theorem for Aumann integrals of set-valued measurable functions will be proven. It is assumed that the values of these functions are closed convex upper sets, a structure that has been used in some…
We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…
In this paper, we study the properties of integral functionals induced on $L^1_E (S,\mu)$ by closed convex functions on a Euclidean space $E$. We give sufficient conditions for such integral functions to be strongly rotund (well-posed). We…
We give a characterization of smooth, rotation and dually epi-translation invariant valuations and use this result to obtain a new proof of the Hadwiger theorem on convex functions. We also give a description of the construction of the…
We study regular inclusions of finite-dimensional von Neumann algebras from a matrix-theoretic perspective. To this end, we introduce a new combinatorial invariant of an inclusion, called the normalizer matrix, which encodes the structure…
We consider the relaxation of polyconvex functionals with linear growth with respect to the strict convergence in the space of functions of bounded variation. These functionals appears as relaxation of $F(u,\Omega):=\int_\Omega f(\nabla…
In this paper, we investigate the characterization of balanced bounded convex domains in $\mathbb{C}^n$ in terms of the squeezing function. As an application, we provide a characterization of the polydisc in $\mathbb{C}^n$.
We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…
The objective of this paper is to design an embedding method that maps local features describing an image (e.g. SIFT) to a higher dimensional representation useful for the image retrieval problem. First, motivated by the relationship…
The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the underlying symmetries…