Related papers: Minimal cut-generating functions are nearly extrem…
In this paper, we extend the class of strongly $E$-preinvex and strongly $E$-invex functions to quasi strongly $E$-preinvex, quasi strongly $E$-invex and pseudo strongly $E$-invex functions. Some nontrivial suitable examples have been…
It is well known that a Wilson action reduces to the generating functional of connected correlation functions as we take the momentum cutoff to zero. For a fixed point Wilson action, this implies that for momenta large compared with the…
In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is…
For a class of discrete quasi convex functions called semi-strictly quasi M$^\natural$-convex functions, we investigate fundamental issues relating to minimization, such as optimality condition by local optimality, minimizer cut property,…
This paper considers the problem of variable-length lossy source coding. The performance criteria are the excess distortion probability and the cumulant generating function of codeword lengths. We derive a non-asymptotic fundamental limit…
We consider continuous functions f : [0,1] \to R that cut the real axis at every point of a measurable set of positive measure and we construct examples where f fails to have bounded variation, and at the opposite end, where f admits…
We construct a two-sided discontinuous piecewise linear minimal valid function for the 1-row Gomory--Johnson model which is not extreme, but which is not a convex combination of other piecewise linear minimal valid functions. The new…
We describe new computer-based search strategies for extreme functions for the Gomory--Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions.
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…
For a transcendental entire function $f$, the property that there exists $r>0$ such that $m^n(r)\to\infty$ as $n\to\infty$, where $m(r)=\min \{|f(z)|:|z|=r\}$, is related to conjectures of Eremenko and of Baker, for both of which order…
A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…
Given a weakly almost additive sequence of continuous functions with bounded variation $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on a subshift $X$ over finitely many symbols, we study properties of a function $f$ on $X$ such that…
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
In this self-contained paper, we present a theory of the piecewise linear minimal valid functions for the 1-row Gomory-Johnson infinite group problem. The non-extreme minimal valid functions are those that admit effective perturbations. We…
We investigate three competing notions that generalize the notion of a facet of finite-dimensional polyhedra to the infinite-dimensional Gomory-Johnson model. These notions were known to coincide for continuous piecewise linear functions…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
In this paper, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give the integer hull of the…
We consider moderately trimmed sums of non-negative i.i.d. random variables. We show that for every distribution function there exists a proper moderate trimming such that for the trimmed sum a non-trivial strong law of large numbers holds.…
We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…