Related papers: Decomposition of higher-order Wright convex functi…
The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…
Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…
It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…
In this paper, we show that, for any $\beta \in [1,2]$, a given strictly positive real-valued continuous function on $[0,1]$ whose graph has upper box-counting dimension less than or equal to $\beta $ can be decomposed as a product of two…
If a function $f:\mathbb{R}\to\mathbb{R}$ can be represented as the sum of $n$ periodic functions as $f=f_1+\dots+f_n$ with $f(x+\alpha_j)=f(x)$ ($j=1,\dots,n$), then it also satisfies a corresponding $n$-order difference equation…
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
The classic Riesz representation theorem characterizes all linear and increasing functionals on the space $C_{c}(X)$ of continuous compactly supported functions. A geometric version of this result, which characterizes all linear increasing…
In this paper it is shown that higher order quasiconvex functions suitable in the variational treatment of problems involving second derivatives may be extended to the space of all matrices as classical quasiconvex functions. Precisely, it…
The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors.…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or 'lift' of the convex set is especially useful if the…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
This paper explores some connections between rank one convexity, multiplicative quasiconvexity and Schur convexity. Theorem 5.1 gives simple necessary and sufficient conditions for an isotropic objective function to be rank one convex on…
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…
In this paper, authors study the convexity and concavity properties of real-valued function with respect to the classical means, and prove a conjecture posed by Bruce Ebanks in \cite{e}.
In this article, we prove a decomposition theorem on differential polynomials of theta functions of high level.
For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…