Related papers: Polynomial valuations on convex functions and thei…
This paper shows a finiteness property of a divisorial valuation in terms of arcs. First we show that every divisorial valuation over an algebraic variety corresponds to an irreducible closed subset of the arc space. Then we define 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 number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
For convex univalent functions we give instances where the sharp bound for various coefficient functionals are identical to those for the corresponding bound for the inverse function. We give instances where the sharp bounds differ and also…
By considering probability distributions over the set of assignments the expected truth values assignment to propositional variables are extended through linear operators, and the expected truth values of the clauses at any given…
In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk are widely studied. A new methodology is employed to construct subclasses of univalent harmonic mappings from a given subfamily of univalent…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We generalize valuations on polyhedral cones to valuations on fans. For fans induced by hyperplane arrangements, we show a correspondence between rotation-invariant valuations and deletion-restriction invariants. In particular, we define a…
This paper analyzes the structure of the set of nodal solutions of a class of one-dimensional superlinear indefinite boundary values problems with an indefinite weight functions in front of the spectral parameter. Quite astonishingly, the…
We revisit the Ou-Wang's approach to the cone restriction problem via polynomial partitioning. By recasting their inductive scheme as a recursive algorithm and incorporating the nested polynomial Wolff axioms, we obtain improved bounds for…
We classify valuations on lattice polygons with values in the ring of formal power series that commute with the action of the affine unimodular group. A typical example of such valuations is induced by the Laplace transform, but as it turns…
There exist two major subclasses in the class of superquadratic functions, one comprises concave and decreasing functions, while the other consists of convex and monotone increasing functions. Leveraging this distinction, we introduce…
Given noisy data, function estimation is considered when the unknown function is known apriori to consist of a small number of regions where the function is either convex or concave. When the regions are known apriori, the estimate is…
Two distinct systems of commutative complex numbers in n dimensions are described, of polar and planar types. Exponential forms of n-complex numbers are given in each case, which depend on geometric variables. Azimuthal angles, which are…
Combinatorial mixed valuations associated to translation-invariant valuations on polytopes are introduced. In contrast to the construction of mixed valuations via polarization, combinatorial mixed valuations reflect and often inherit…
We develop the calculus of superforms as a tool for convex geometry. The formalism is applied to valuations on convex bodies, the Alexandrov-Fenchel inequalities and Monge- Amp\`ere equations on the boundary of convex bodies.
In this article we have studied some properties of subharmonic functions in a strongly symmetric Riemannian manifold with a pole. As a generalization of polynomial growth of a function we have introduced the notion of polynomial growth of…