Related papers: Decomposition of higher-order Wright convex functi…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Using the theory of functions of several complex variables, we prove that if an analytic function in several variables satisfies a system of $q$-partial differential equations, then, it can be expanded in terms of the product of the…

In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…

For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and…

Let W be a polyconvex function defined on the 2 x 2 real matrices. The Busemann representative f, say, of W is the largest possible convex representative of W. Writing L for the set of affine functions on R^{5} such that a(A, det A) is less…

We introduce M\"obius functions of higher rank, a new class of arithmetic functions so that the classical M\"obius function is of rank 2. With this idea, we evaluate Dirichlet series on the sum of the reciprocal square of all $r$-free…

The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…

Let $D$ be a closed disk in the complex plane centered at the origin, $f, g$ complex valued continuous function on $D$. Let $P[f,g; D]$ (res. $R[f, g; D])$) be the uniform closure on $D$ of polynomials (res. rational functions) in variables…

The main result of the paper is the following: Every $z$-linear maps is a functional p-convex. We will prove this statement using lemma developed by Kalton and Peck [6] and theorem developed by Aoki and Rolewicz.Based on the definition of…

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex…

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with…

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

In 1980, Faltings proved, by deep local algebra methods, a local result regarding formal functions which has the following global geometric fact as a consequence. Theorem: Let k be an algebraically closed field (of any characteristic). Let…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…

This paper extends the Kadison duality between compact convex sets and function systems to the setting of partial convexity. A partially convex set is a set that is convex in a designated set of convex variables when the others are held…

This study is devoted to the polynomial representation of the matrix $p$th root functions. The Fibonacci-H\"orner decomposition of the matrix powers and some techniques arisen from properties of generalized Fibonacci sequences, notably the…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…